Hello and welcome to exampundit. Here is a set of IBPS SO IT Officer Professional Knowledge Quiz on Data Structure/Compiler Design for IBPS IT Officer Mains exam 2018.
- 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
(e) None of these
- Queue can be used to implement ?
(a) radix sort
(b) quick sort
(c) recursion
(d) depth first search
(e) None of these
- 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
(e) None of these
- 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
(e) None of these
- 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
(e) None of these
- 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
(e) None of these
- A binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is ?
(a) log2n
(b) n – 1
(c) n
(d) 2n
(e) None of these
- 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
(e) None of these
- 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
(e) None of these
- 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
(e) None of these
View other quizzes from here.