ISRO CSE 2015 PYQ

If the sequence of operations - push(1), push(2), pop, push(1), push(2), pop, pop, pop, push(2), pop are performed on a stack, the sequence of popped out values is

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

Six files F1, F2, F3, F4, F5 and F6 have 100, 200, 50, 80, 120, 150 records respectively. In what order should they be stored so as to optimize access time? Assume each file is accessed with the same frequency.

A hash table with 10 buckets with one slot per bucket is used. Symbols S1 and S7 are entered using linear probing. The maximum number of comparisons needed in searching an item that is not present is

The queue data structure is to be realized by using stack. The number of stacks needed would be