IBPS IT Officers Professional Knowledge Quiz - Set 7

sponsored links

1. Two main measures for the efficiency of an algorithm are 
1. Processor and memory 
2. Complexity and Capacity 
3. Time and Space
4. Data and Space
5. None of these
2. The time factor when determining the efficiency of algorithm is measured by
1. Counting microseconds
2. Counting the number of key operations 
3. Counting the number of statements 
4. Counting the kilobytes of algorithm 
5. None of these
3. The space factor when determining the efficiency of algorithm is measured by ? 
1. counting the maximum memory needed by the algorithm 
2. coning the minimum memory needed by the algorithm 
3. counting the average memory needed by the algorithm 
4. counting the maximum disk space needed by the algorithm 
5. None of these
4. Which of the following case does not exist in complexity theory 
1. Best case
2. Worst Case 
3. Average case 
4. Null case 
5. None of these
5. The Worst case occur in linear search algorithm when 
1. Item is somewhere in the middle of the array 
2. Item is not in the array at all
3. Item is the last element in the array 
4. Item is the last element in the array or is not there at all 
5. None of these
6. The Average case occur in linear search algorithm 
1. when item is somewhere in the middle of the array 
2. when item is not in the array at all 
3. when item is the last element in the array 
4. when item is the last element in the array or is not there at all 
5. None of these
7. The complexity of linear search algorithm is 
1. O(n)
2. O(log n)
3. O(n2)
4. O(n log n)
5. None of these
8. Some code optimizations are carried out on the intermediate code because
1. they enhance the portability of the compiler to other target processors
2. program analysis is more accurate on intermediate code than on machine code
3. the information from data flow analysis cannot be used for optimization
4. the information from the front end cannot be used for optimization
5. None of these
9. The complexity of Bubble sort algorithm is 
   
1. O(n)
2. O(log n)
3. O(n2)
4. O(n long n)
5. None of these
10. Each array declaration need not give, implicitly or explicitly, the information about 
1. the name of array 
2. the data type of array 
3. the first data from the set to be stored 
4. the index set of the array 
5. None of these
11. Queue can be used to implement ?
1. radix sort 
2. quick sort 
3. recursion
4. depth first search 
5. None of these
12. The number of binary trees with 3 nodes which when traversed in post order gives the sequence A, B, C is ?
1. 3
2. 9
3. 7
4. 5
5. None of these
13. The average search time of hashing with linear probing will be less if the load factor ?
1. is far less than one
2. equals one 
3. is far greater than one
4. all of the above 
5. None of these
14. A binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is ?
1. log2n
2. n-1
3. n
4. 2n
5. None of these
15. 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 ?
1. Bubble sort
2. Insertion sort 
3. Selection sort 
4. Heap sort 
5. None of these
16. The way a card game player arranges his cards as he picks them up one by one, is an example of ?
1. bubble sort 
2. selection sort 
3. insertion sort 
4. merge sort 
5. None of these
17. The average successful search time for sequential search on 'n' times is ?
1. n/2
2. (n-1)/2
3. (n+2)/2
4. log(n)+1
5. None of these
18. Linked lists are suitable for which of the following problems ? 
1. Insertion sort 
2. Binary search 
3. Radix sort 
4. Polynomial manipulation 
5. None of these
19. The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense ?
1. Finite state automata 
2. Deterministic push down automata
3. Non-deterministic push down automata
4. Turing machine 
5. None of these
20. Which data structure in a compiler is used for managing information about variables and their attributes ?
1. Abstract syntax-tree 
2. Symbol table 
3. Semantic stack 
4. Parser table 
5. None of these

Check Complete Study Materials for IBPS IT Officers Online Exam 2015 from here

sponsored links