read the following code and tell me the output, and is there anything wrong about it? #include <iostream> class A { public: A() { foo(); } virtual void foo(int a = 10) { std::cout << "A = " << a << std::endl; } }; class B : public A { public: B() { foo(); } virtual void foo(int b = 20) { std::cout << "B = " << b << std::endl; } }; int main() { A* aPtr = new B(); aPtr->foo(); delete aPtr; return 0; }
Given an input of stream of words find the most recurring word. what is the data structure used for this purpose. what will be the time complexity of that.
Improve on the previous code, then give the running time on the two codes and explain which would be better to use if you were a manager and presented with these two codes and why
Insert sort & complexity? binary tree & Depth First Search? reverse number?Classic questions.
Algorithm test, how to represent in flow chart a certain game or a certain aglorithm
Reverse singly linked list
what is the size of an empty class ?
Find and store all the occurences of each letter in a word.
Why do you want to work for Bloomberg and not for Google for example.
Question gives out some options and ask you which one is not a common revision control system :S
Viewing 161 - 170 interview questions