Question # 1 of 10 ( Start time: 05:15:48 PM ) Total Marks: 1
Which of the following is not a data structure ?
Select correct option:
Linked list
Stack
Queue
Memory cell
Question # 2 of 10 ( Start time: 05:17:18 PM ) Total Marks: 1
Stack and Queue can be implemented using _________,
Select correct option:
Singly Link List
Binary Tree
Binary Search Tree
AVL Tree
Question # 3 of 10 ( Start time: 05:18:39 PM ) Total Marks: 1
The principal benefit of a linked list over a conventional array is that the order of the linked items may be_______ from the order that the data items are stored in memory.
Select correct option:
Same
Identical
Different
Equivalent
Question # 4 of 10 ( Start time: 05:20:08 PM ) Total Marks: 1
In node class one field is an integer data and other field will be ______.
Select correct option:
Pointer to class
Pointer to node
Pointer to integer
None of given options
Question # 5 of 10 ( Start time: 05:21:34 PM ) Total Marks: 1
Consider the following infix expression. 7/8 + 9 If one converts the above expression into postfix, what would be the resultant expression?
Select correct option:
7 8 9 / +
7 8 / + 9
/ 7 8 + 9
7 8 / 9 +
Question # 6 of 10 ( Start time: 05:23:03 PM ) Total Marks: 1
In__________ the ‘next’ returns false when it reaches to the last node due to the fact that the next field of the last node is set to NULL.
Select correct option:
Circular linked list
Triple linked list
Singly linked list
None of the above
Question # 7 of 10 ( Start time: 05:24:15 PM ) Total Marks: 1
The tree data structure is a
Select correct option:
Linear data structure
Non-linear data structure
Graphical data structure
Data structure like queue
Question # 8 of 10 ( Start time: 05:25:42 PM ) Total Marks: 1
If we use an array for implementing list, then for simplicity, it is good to use the start index from ________________.
Select correct option:
-1
0
1
2
