Q.No. Question Choice 1 Choice 2 Linked List Implementation of Queue
Q.No. Question Choice 1 Choice 2 Linked List Implementation of Queue
3 Which of the following is false about Linked List? Random access with It is easy to insert and delete element in
linked list is fast Linked list
5 In case of binary Search Tree which of the following traversal method gives Preorder Postorder
sorted output?
6 In which of the following tree height of left sub tree and height of right AVL Tree Expression Tree
sub tree differ at most by one?
void fn( ){
char c;
cin.get(c);
if (c != '\n') { The string entered is The string entered is printed in
12 fn( ); printed as it is reverse order.
cout.put(c);
}
}
13 Which of the following statement is false ? Arrays are dense lists and stat Data elements in linked list need not be stor
14 Item in priority queue can jump to the front on the line if they have priority 1 0
15 The data structure required for Breadth First Traversal on a graph is Queue Stack
16 Which of the following operations is performed more efficiently by doubly linked list Deleting a node whose locationSearching of an unsorted list for a given item
17 Which of the following can a Dynamic Link Library contain? Only Code Code and Data Only
18 A full binary tree with 2n+1 nodes contain n leaf nodes n non-leaf nodes
19 If a node in a BST has two children, then its inorder predecessor has no left child no right child
What data structures you should use for dictionary searching and it should be capable of
20 doing spell check also ? array hashing
It will go in an infinite
loop. It will print an empty line. Choice 2
Pointers store the next data elLinked lists are collection of the Choice 3
None Error Choice 1
Array Tree Choice 1
Inverting a node after the nodTraversing a list to process each Choice 1
Code and Resources only Code, Data and Resources Choice 4
(n-1) leaf nodes (n-1) non-leaf nodes Choice 2
two children no child Choice 2