A queue where the delimiter -queue operation depends not on FIFO, is called a priority queue
The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should
Use better data structuresB.
Increase the hard disk spaceC.
Use the better algorithmD.
Use as much data as we can store on the hard disk
Consider the function X as under
int X (int& Value)
Now a and b are integers in a calling function. Which one of the following is a valid call to the above function X.
a = X (b) ;B. a = X (&b) ; C.
a = X (*b) ;D.
None of the given optionions
In the call by value methodology, a copy of the object is passed to the called function.
The tree data structure is a
Linear data structureB.
Non-linear data structureC.
Graphical data structureD. Data structure like queue
When should you use a const reference parameter?
Whenever the parameter has huge size.B. Whenever the parameter has huge size, the function changes the parameter within its body, and you do NOT want these changes to alter the actual argument. C.
Whenever the parameter has huge size, the function changes the parameter within its body, and you DO want these changes to alter the actual argument.D.
Whenever the parameter has huge size, and the function does not change the parameter within its body.
Here is the start of a C++ class declaration:
void x(foo f);
void y(const foo f);
void z(foo f) const;
Which of the three member functions can alter the PRIVATE member variables of the foo object that activates the function?
Only x can alter the private member variables of the object that activates the function.B.
Only y can alter the private member variables of the object that activates the function.C.
Only z can alter the private member variables of the object that activates the function.D.
Two of the functions can alter the private member variables of the object that activates the function.
What is the maximum depth of recursive calls a function may make?
n (where n is the argument)D. There is no fixed maximum
Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for a search operation are,
Log2 (n+1) -1B. Log2 (n+1) C.
In the linked list implementation of the stack class, where does the push member function places the new entry on the linked list?
At the headB.
At the tailC.
After all other entries that are greater than the new entry.D.
After all other entries that are smaller than the new entry.