Which of the following in the data structure in which insertion can place from any direction but deletion can only takes place from opposite direction:
Stack
Array
Queue
Tree
Answer : Option B.
7489 IC is a:
32 bit RAM
64 bit RAM
32 bit ROM
64 bit ROM
Answer : Option B.
Predict the output of following C++ program.
#include
using namespace std;
class abc
{
static int x;
public:
abc() { x++; }
static int getX() {return x;}
};
int Test::x = 0;
int main()
{
cout << abc::getX() << " ";
abc t[5]; cout << abc::getX(); }
55
55
05
50
Answer : Option C.
"abc::getX()" is a static function so it can be called without object. Since x is initialized as 0, the first call to getX() returns 0. As x++ in constructor and when an array of 5 objects is created, the constructor is called 5 times. So x is incremented to 5 before the next call to getX().
Which of the following is true for B+ trees:
B+ trees are for storing data on disk.
On B+ trees range queries are faster.
B+ trees are for secondary indexes.
B+ trees are for primary indexes.
Answer : Option B.
Which of the following is not a function of aggregate function?
Avg
Count
Create
Max
Answer : Option C.
In the given context, option 4 is the most applicable.
