Thursday 11 April 2013
General Knowledge quiz for entrance exam
1. Two main measures for the efficiency of an algorithm are
c. Time and space
2. The time factor when determining the efficiency of algorithm is measured by
b. Counting the
number of key operations
3. The space factor when determining the efficiency of algorithm is measured by
a. Counting the
maximum memory needed by the algorithm
4. Which of the following case does not exist in complexity
theory
d. Null case
5. The Worst case occur in linear search algorithm when
d. Item is the last element in the array or is not there at
all
6. The Average case occur in linear search algorithm
a. When Item is somewhere in the middle of the array
7. The complexity of the average case of an algorithm is
a. Much more complicated to analyze than that of worst case
8. The complexity of linear search algorithm is
a. O(n)
9. The complexity of Binary search algorithm is
b. O(log n)
10. The complexity of Bubble sort algorithm is
c. O(n2)
11. The complexity of merge sort algorithm is
d. O(n log n)
12. The indirect change of the values of a variable in one
module by another module is called
c. side effect
13. Which of the following data structure is not linear data
structure?
d. None of above
14. Which of the following data structure is linear data
structure?
c. Arrays
15. The operation of processing each element in the list is
known as
d. Traversal
16. Finding the location of the element with a given value
is:
b. Search
17. Arrays are best data structures
a. for relatively permanent collections of data
18. Linked lists are best suited
b. for the size of the structure and the data in
the structure are constantly changing
19. Each array declaration need not give, implicitly or
explicitly, the information about
c. the first data from the set to be stored
20. 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
