Hi, in general, it turned out that I am a stupid, because i didn't pass the retellings in English, so I remain to study at the mkn, I hope that this isn't a bad...
But on the other hand, I passed "the offset by graph"(please tell me how to write this correctly) by 5, although formally, of course, there is no assessment, but it's still nice
Now I need to prepare for a analysis, without a clue how I will pass it, but I believe in the best.
I dunno whether to go to the cs center or not, because I will have a job and about the same amount of study. Probably I don’t have time, on the other hand I want to try very much
But on the other hand, I passed "the offset by graph"(please tell me how to write this correctly) by 5, although formally, of course, there is no assessment, but it's still nice
Now I need to prepare for a analysis, without a clue how I will pass it, but I believe in the best.
I dunno whether to go to the cs center or not, because I will have a job and about the same amount of study. Probably I don’t have time, on the other hand I want to try very much
graphs_dk.pdf
2.9 MB
By the way this is a very good book on graph theory
What do you think that in С++ templates you can write class or typename, and the difference will be only for a person?
Anonymous Poll
17%
useful (code more readable)
33%
useless (not obviously and two ways to do the same)
8%
neutral (historical reason...)
42%
I'm a Batman
I went to interview to CS Center. The interview consists of two parts, 30 minutes each.
In the first part they give you 3 problems. I had folllowing problems:
1) How many ways to make a tower of height N from red and blue cubes so that not a single red would stand on red.
I didn't have time to solve this problem at the interview, but solved it later. In the comments I will give a hint and then a solution
2) Write code that finds an element in an array that occurs in more than half of the positions. Time: O(n) Memory: O(1)
I solved it, the solution will be in the comments
3) A boring task with equations and graphs, I solved it
In the second part you tell about your motivation, how good you are, and how much free time you have
I hope I will pass (but don't believe it)
In the first part they give you 3 problems. I had folllowing problems:
1) How many ways to make a tower of height N from red and blue cubes so that not a single red would stand on red.
I didn't have time to solve this problem at the interview, but solved it later. In the comments I will give a hint and then a solution
2) Write code that finds an element in an array that occurs in more than half of the positions. Time: O(n) Memory: O(1)
I solved it, the solution will be in the comments
3) A boring task with equations and graphs, I solved it
In the second part you tell about your motivation, how good you are, and how much free time you have
I hope I will pass (but don't believe it)