Sunday, 29 November 2015

IBPS Bank Jobs Exam - IT Officer Computer Knowledge (Data Structure) Quiz - 51





1. The time factor when determining the efficiency of algorithm is measured by
(a) Counting microseconds     

(b) Counting the number of key operation     
(c) Counting the number of statements     
(d) Counting the kilobytes of algorithm

2. 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
(e) None of these
 
3. Which of the following case does not exist in complexity theory
(a) Best case     
(b) Worst case     
(c) Average case     
(d) Null case
 
4. 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
(e) None of these
 
5. 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) When Item is the last element in the array or is not there at all
(e) None of these
 
6. The complexity of linear search algorithm is
(a) O(n)     
(b) O(log n)     
(c) O(n2)     
(d) O(n log n)
 
7. The complexity of Binary search algorithm is
(a) O(2)    
(b) O(log)     
(c) O(n2)     
(d) O(n log n)
 
8. The complexity of Bubble sort algorithm is
(a) O(n)     
(b) O(log n)     
(c) O(n2)     
(d) O(n log n)
 
9. Each array declaration need not give, implicitly or explicitly, the information about
(a) The name of array
(b) The data type of array
(c) The first data from the set to be stored
(d) The index set of the array
 
10. If the sequence of operations – push(1), push(2), pop, push(1), push(2), pop, pop, pol, push(2), pop are preformed on a stack, the sequence of popped out values are?
(a) 2, 2, 1, 1, 2     
(b) 2, 2, 1, 2, 2     
(c) 2, 1, 2, 2, 1     
(d) 2, 1, 2, 2, 2
 
11. Queen can be used to implement?
(a) Radix sort           
(b) Quick sort        
(c) Recursion     
(d) Depth first search
 
12. A machine took 200 sec to sort 200 names, using bubble sort. In 800 sec, it can approximately sort?
(a) 400 names     
(b) 800 names     
(c) 750 names     
(d) 850 names
 
13. A machine needs a minimum of 100 sec to sort 1000 names by quick sort. The minimum time needed to sort 100 names will be approximately?
(a) 50.2 sec     
(b) 6.7 sec     
(c) 72.7 sec     
(d) 11.2 sec
 
14. The number of binary trees with 3 nodes which when traversed in post order gives the sequence A, B, C is?
(a) 3     
(b) 9     
(c) 7     
(d) 5
 
15. The average search time of hashing with linear probing will be less if the load factor?
(a) Is far less than one     
(b) Equals one     
(c) Is far greater than one       
(d) All of the above
 
16. A binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is?
(a) 1og2n     
(b) n – 1     
(c) n     
(d) 2n
 
17. As part of maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be?
(a) Bubble sort     
(b) Insertion sort     
(c) Selection sort     
(d) Heap sort
 
18. The way a card game player arranges his cards as he picks them up one by one, is an example of?
(a) Bubble sort     
(b) Selection sort     
(c) Insertion sort     
(d) Merge sort
 
19. The average successful search time for sequential search on ‘n’ items is?
(a) n/2     
(b) (n – 1)/2     
(c) (n + 2)/2     
(d) log(n) + 1
 
20. Linked lists are suitable for which of the following problems?
(a) Insertion sort     
(b) Binary search     
(c) Radix sort     
(d) Polynomial manipulation

Also read Important Computer Notes and Study material for Computer DoIT & C Informatics Assistant Recruitment Exam 2016-17

No comments:

Post a Comment

Advertisement