Computer : Multiple choice questions - 3

DOWNLOAD PDF

Computer quiz

1. A variable P is called pointer if
(A) P points to the address of first element in DATA
(B) P can store only memory addresses
(C) P contain the DATA and the address of DATA
(D) P contains the address of an element in DATA.


2. The Worst case occur in linear search algorithm when
(A) Item is not in the array at all
(B) Item is the last element in the array
(C) Item is the last element in the array or is not there at all
(D) None of above


3. The Average case occur in linear search algorithm
(A) When Item is somewhere in the middle of the array
(B) When Item is not in the array at all
(C) When Item is the last element in the array
(D) All the above


4. The complexity of the average case of an algorithm is
(A) Much more complicated to analyze than that of worst case
(B) Much more simpler to analyze than that of worst case
(C) Sometimes more complicated and some other times simpler than that of worst case
(D) None of the above


5. The following data structure allows deleting data elements from front and inserting at rear
(A) Stacks
(B) Queues
(C) Deques
(D) Binary search tree


6. This data structure allows deletions at both ends of the list but insertion at only one end.
(A) Input-restricted deque
(B) Output-restricted deque
(C) Priority queues
(D) None of the above


7. The following data structure is non-linear type
(A) Strings
(B) Lists
(C) Stacks
(D) None of the above


8. The following data structure is linear type
(A) Strings
(B) Lists
(C) Queues
(D) All of the above


9. To represent hierarchical relationship between elements, the following data structure is suitable
(A) Deque
(B) Priority
(C) Tree
(D) All of above


10. 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 above
Answers: 1. (D) 2. (C) 3. (A) 4. (A) 5. (B) 6. (A) 7. (D) 8. (D) 9. (C) 10. (C)