Computer : Multiple choice questions quiz 2

DOWNLOAD PDF

1. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
(A) Elementary items
(B) Atoms
(C) Scalars
(D) All of above
2. Which of the following statement is false ?
(A) Arrays are dense lists and static data structure
(B) Data elements in linked list need not be stored in adjacent space in memory
(C) Pointers store the next data element of a list
(D) Linked lists are collection of the nodes that contain information part and next pointer
3. Binary search algorithm cannot be applied to
(A) Sorted binary trees
(B) Sorted linear array
(C) Pointer array
(D) Sorted linked list
4. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
(A) Housefull
(B) Saturated
(C) Underflow
(D) Overflow
5. The situation when in a linked list START=NULL is
(A) Underflow
(B) Overflow
(C) Housefull
(D) Saturated
6. The following is two-way list
(A) Grounded header list
(B) Circular header list
(C) Linked list with header and trailer nodes
(D) None of above
7. The following name does not relate to stacks
(A) FIFO lists
(B) LIFO list
(C) Piles
(D) Push-down lists
8. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in tree for efficiency. These special pointers are called
(A) Leaf
(B) Branch
(C) Path
(D) Thread
9. In a graph if e=(u, v) means
(A) e begins at u and ends at v
(B) u is processor and v is successor
(C) both B and C are true
(D) none is true
10. 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
Answers: 1. (D) 2. (C) 3. (D) 4. (D) 5. (A) 6. (D) 7. (C) 8. (D) 9. (C) 10. (B)