Calculator was allowed for this paper. Paper consisted of 56 questions, 28 questions of 1 mark and 2 question of 2 marks. Time duration: 90 mins
- The interesting graph question on complement of a graph and it was asked what are options hold true.
- Some code snippets, need to find output
- A c code using 'fork ()' and need to find the output from child and parent code paths.
- A dbms question to find the number of candidate keys.
- A dbms question pertaining to 2-phase locking - what all option are correct pertaining to 2 phase locking
- Computer Networks question on routing protocols
- A complex tree recursive code and need to find out what it does
- CAO - numerical on logical address size and block size
- OS - Numerical in which you need to run all the algorithms, LRU , FIFO, with direct, set-associative and fully-associative to correctly answer the question. There was no shortcut. You need to run all algos, as multiple options could be correct.
- Algorithm - need to put the given sorting algorithm in non-decreasing order of their worst asymptotic running times.
No comments:
Post a Comment