Computer : Multiple choice questions - 6

DOWNLOAD PDF

Computer quiz

1. Which of the following is not a limitation of binary search algorithm ?
(A) binary search algorithm is not efficient when the data elements are more than 1000.
(B) must use a sorted array
(C) requirement of sorted array is expensive when a lot of insertion and deletions are needed
(D) there must be a mechanism to access middle element directly

2. Two dimensional arrays are also called
(A) tables arrays
(B) matrix arrays
(C) both of the above
(D) none of the above

3. The term “push” and “pop” is related to the
(A) Array
(B) Lists
(C) stacks
(D) all of above

4. A data structure where elements can be added or removed at either end but not in the middle is referred as
(A) Linked lists
(B) Stacks
(C) Queues
(D) Deque

5. The following sorting algorithm is of divideand-conquer type
(A) Bubble sort
(B) Insertion sort
(C) Quick sort
(D) None of the above

6. An algorithm that calls itself directly or indirectly is known as
(A) Recursion
(B) Polish notation
(C) Traversal algorithm
(D) None of the above

7. The 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) A and B both false
(D) A and B both true

8. The memory address of the first element of an array is called
(A) base address
(B) floor address
(C) foundation address
(D) first address

9. The memory address of fifth element of an array can be calculated by the formula
(A) LOC(Array[5])=Base(Array[5])+(5-lower boun(D), where w is the number of words per memory cell for the array
(B) LOC(Array[5])=Base(Array[4])+(5-Upper boun(D), where w is the number of words per memory cell for the array
(C) LOC(Array[5]=Base(Array)+w(5-lower boun(D), where w is the number of words per memory cell for the array
(D) None of the above

10. The following data structure can’t store the non-homogeneous data elements
(A) Arrays
(B) Records
(C) Pointers
(D) None of the above

Answers: 
1. (A) 2. (C) 3. (C) 4. (D) 5. (B) 6. (A) 7. (A) 8. (A) 9. (C) 10. (A)