1
GATE CSE 2020
Numerical
+2
-0.67
Consider a database implemented using B+ tree for file indexing and installed on a disk drive with block size of 4 KB. The size of search key is 12 bytes and the size of tree/disk pointer is 8 bytes. Assume that the database has one million records. Also assume that no node of the B+ tree and no records are present initially in main memory. Consider that each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is ______.
Your input ____
2
GATE CSE 2020
Numerical
+1
-0.33
A multiplexer is placed between a group of 32 registers and an accumulator to regulate data movement such that at any given point in time the content of only one register will move to the accumulator. The minimum number of select lines needed for the multiplexer is _____.
Your input ____
3
GATE CSE 2020
Numerical
+1
-0.33
If there are m input lines and n output lines for a decoder that is used to uniquely address a byte addressable 1 KB RAM, then the minimum value of m + n is ____.
Your input ____
4
GATE CSE 2020
MCQ (Single Correct Answer)
+2
-0.67
Consider the Boolean function z(a,b,c). GATE CSE 2020 Digital Logic - Boolean Algebra Question 2 English
Which one of the following minterm lists represents the circuit given above?
A
z = $$\sum {\left( {0,1,3,7} \right)} $$
B
z = $$\sum {\left( {1,4,5,6,7} \right)} $$
C
z = $$\sum {\left( {2,4,5,6,7} \right)} $$
D
z = $$\sum {\left( {2,3,5} \right)} $$
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12