GATE 02
GATE 2016, SET I, 1 Mark A processor can support a maximum of 4GB, where the memory is word-addressable (a word consists of two bytes). ...
Read moreGATE 01
GATE 2013 R (ABCDEFGH) CH → G A → BC B → CFH E → A F → EG Find the number of candidate keys? ...
Read moreNet 52
CBSE NET Q. Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E – F) + G (A) ...
Read moreNet 51
CBSE NET JUNE 2015 Paper II Q. The in-order and pre-order Traversal of binary Tree are dbeafcg and abdecfg respectively. The post-order Traversal is______. A)dbefacg B)debfagc ...
Read moreNet 50
CBSE NET JUNE 2015 Paper II Q. A disk drive has 100 cylinders,numbered 0 to 99. Disk request come to the disk driver for cylinders ...
Read moreNet 49
CBSE NET Q. A LRU page replacement is used with four page frames and eight pages. How many page faults will occur with the reference ...
Read moreNet 48
CBSE NET Q. Consider an array A[20, 10], assume 4 words per memory cell and the base address of array A is 100. What is ...
Read moreNet 47
CBSE NET Q. An analog signal has a bit rate of 6000 bps and a baud rate of 2000 baud. How many data elements are ...
Read moreNet 46
CBSE NET Q. In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 ...
Read moreNet 45
CBSE NET DECEMBER 2012 PAPER II Q. Given an empty stack, after performing push (1), push (2), Pop, push (3), push (4), Pop, Pop, push ...
Read more