1. The advantage of.. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. [A] Lists [B] Linked Lists [A] Trees [A] Queues 2. The worst case occur in linear search algorithm when [A] Item is somewhere in the middle of the array [B] Item is not in the array at all [C] Item is the last element in the array [D] Item is the last element in the array or item is not there at all 3. Linked lists are best suited [A] for relatively permanent collections of data [B] for the size of the structure and the data in the structure are constantly changing [C] for both of above situation [D] for none of above situation 4. he elements of an array are stored successively in memory cells because [A] by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated [B] the architecture of computer memory does not allow arrays to store other than serially [C] both of above [D] none of above 5. A full binary tree with n leaves contains [A] n nodes. [B] log n 2 nodes. [C] 2n 1 nodes. [D] n 2 nodes. 6. A vertex of degree one is called [A] ppadent [B] Isolated vertex [C] Null vertex [D] Colored vertex
7. The in-order traversal of tree will yield a sorted listing of elements of tree in [A] binary trees [B] binary search trees [C] heaps [D] binary heaps 8. Finding the location of the element with a given value is: [A] Traversal [B] Search [C] Sort [D] None of above 9. A graph with n vertices will definitely have a parallel edge or self loop of the total number of edges are [A] more than n [B] more than n+1 [C] more than (n+1)/2 [D] more than n(n-1)/2 10. Which of the following is useful in implementing quick sort? [A] Stack [B] Set [C] List [D] Queue 11. A sorting algorithm which can prove to be a best time algorithm in one case and a worst time algorithm at other time? [A] Selection Sort [B] Heap Sort [C] Quick Sortno [D] All of the above 12. Which of the following can be used as a criterion for classification of data structures used in language processing?. [A] nature of a data structure [B] lifetime of a data structure [C] purpose of a data structure [D] All of the above
13. Sparse matrices have? [A] no zero. [B] many zero. [C] higher dimenstion. [D] none. 14. The postfix form of the expression (A+ B)*(C*D- E)*F / G is? [A] AB+ CD*E - FG /** [B] AB + CD* E - F **G / [C] AB + CD* E - *F *G / [D] AB + CDE * - * F *G / 15. The data structure required to check whether an expression contains balanced parenthesis is? [A] Stack [B] Queue [C] Array [D] Tree 16. The Worst case occur in linear search algorithm when [A] Item is somewhere in the middle of the array [B] Item is not in the array at all [C] Item is the last element in the array [D] Item is the last element in the array or is not there at all 17. Consider the linked list implementation of a stack. Which of the following node is considered as Top of the stack? [A] First node [B] Last node [C] Any node [D] Middle node 18. If every node u in G is adjacent to every other node v in G, A graph is said to be [A] isolated [B] complete [C] finite [D] strongly connected
19. If the MAX_SIZE is the size of the array used in the implementation of circular queue. How is rear manipulated while inserting an element in the queue? [A] rear=(rear%1)+max_size [B] rear=rear%(max_size+1) [C] rear=(rear+1)%max_size [D] rear=rear+(1%max_size) 20. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into EMPTY queue? [A] Only front pointer [B] Only rear pointer [C] Both front and rear pointer [D] None of these 21. A binary tree can easily be converted into q 2-tree [A] by replacing each empty sub tree by a new internal node [B] by inserting an internal nodes for non-empty node [C] by inserting an external nodes for non-empty node [D] by replacing each empty sub tree by a new external node 22. A graph is said to be if its edges are assigned data. [A] Tagged [B] Marked [C] Lebeled [D] Sticked 23. A binary tree whose every node has either zero or two children is called [A] Complete binary tree [B] Binary search tree [C] Extended binary tree [D] None of these 24. In the array implementation of circular queue, which of the following operation take worst case linear time? [A] Insertion [B] Deletion
[C] To empty a queue [D] None 25. The space factor when determining the efficiency of algorithm is measured by [A] Counting the maximum memory needed by the algorithm [B] Counting the minimum memory needed by the algorithm [C] Counting the average memory needed by the algorithm [D] Counting the maximum disk space needed by the algorithm ANSWERS 1 -- B 2 -- D 3 -- B 4 -- A 5 -- C 6 -- A 7 -- D 8 -- B 9 -- D 10 -- A 11 -- C 12 -- D 13 -- B 14 -- A 15 -- A 16 -- D 17 -- A 18 -- B 19 -- C 20 -- C 21 -- D 22 -- C 23 -- C 24 -- D 25 -- A If you have any concerns, please drop us an email(info@alljobinfo.com) Thanks in Advance