CS301 Midterm Online Quiz

0%

CS301-Midterm

1 / 50

The operation for removing an entry from a stack is traditionally called:

2 / 50

 A queue where the de-queue operation depends not on FIFO, is called a priority queue

3 / 50

In an array list the current element is

4 / 50

________ is the maximum number of nodes that you can have on a stack-linked list ?

5 / 50

Which of the following is Non Linear Data Structure?

6 / 50

Where does the push member function place the new entry in the array?

7 / 50

AVL Tree is,

8 / 50

The operation for removing an entry from a stack is traditionally called:

9 / 50

Which statement of the following statements is incorrect?

10 / 50

What statement changes currentNode so that it refers to the next node?

11 / 50

An array is a group of consecutive related memory locations.

12 / 50

We access elements in AVL Tree in,

13 / 50

Which one of the following statements is correct?

14 / 50

The operation for removing an entry from a stack is traditionally called:

15 / 50

 Which of the above is/are related to normal queues?

16 / 50

Which of the following is a non linear data structure?

17 / 50

A queue where the de-queue operation depends not on FIFO, is called a priority queue

18 / 50

A tree is an AVL tree if

19 / 50

Which one of the following operators has higher priority than all of others?

20 / 50

 In the linked list implementation of the stack class, where does the push member function places the new entry on the linked list?

21 / 50

_________ is a binary tree where every node has a value, every node's left subtree contains only values less than or equal to the node's value, and every node's right subtree contains only values that are greater then or equal?

22 / 50

The operation for adding an entry to a stack is traditionally called :    

23 / 50

In a program a reference variable, say x, can be declared as

24 / 50

What is the maximum depth of recursive calls a function may make?

25 / 50

A Compound Data Structure is the data structure which can have multiple data items of same type or of different types.Which of the following can be considered compound data structure?

26 / 50

A binary search tree should have minimum of one ________ node/s at each level,

27 / 50

We access elements in AVL Tree in,

28 / 50

What is the maximum depth of recursive calls a function may make?

29 / 50

bool LessThan( SomeClass anotherObject ); Which of the following tests in the client code correctly compares two class objects alpha and beta?

30 / 50

The difference between a binary tree and a binary search tree is that ,a binary search tree has

31 / 50

A queue where the de-queue operation depends not on FIFO, is called a priority queue

32 / 50

Consider the following infix expression: 3+5*6–7*(8+5) Which of the following is a correct equivalent expression(s) for the above?

33 / 50

Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for a search operation are,

34 / 50

5+6/2 If one converts the above expression into postfix, what would be the resultant expression?

35 / 50

The tree data structure is a

36 / 50

is a binary tree where every node has a value, every node's left subtree contains only values less than or equal to the node's value, and every node's right subtree contains only values that are greater then or equal ?

37 / 50

Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for a search operation are,

38 / 50

Consider the following function: void test_a(int n) { cout << n << " "; if (n>0) test_a(n-2); } What is printed by the call test_a(4)?

39 / 50

AVL Tree is,

40 / 50

The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should

41 / 50

Which one of the following statements is NOT correct?

42 / 50

Parameters in function call are passed using,

43 / 50

Which of the following abstract data types are NOT used by Integer Abstract Data type group?

44 / 50

Each node in Binary Search Tree has

45 / 50

Is a data structure that can grow easily dynamically at run time without having to copy existing elements?

46 / 50

Which one of the following calling methods does not change the original value of the argument in the calling function?

47 / 50

The expression AB+C* is called?

48 / 50

The operation for adding an entry to a stack is traditionally called :

49 / 50

What boolean expression will be true when cursor refers to the tail node of the list?

50 / 50

bool LessThan( SomeClass anotherObject ); Which of the following tests in the client code correctly compares two class objects alpha and beta?

Your score is

The average score is 51%

0%

Qunoot e Nazilah
Dua e Hajat
4 Qul
6 Kalma
Dua-e-Akasha
Darood Akbar
Surah Fatiha
Dua-e-Ganj Ul Arsh
Dua-e-Jamilah
Ayat-ul-Kursi