1
GATE CSE 2011
MCQ (Single Correct Answer)
+2
-0.6
On a non-pipe-lined sequential processor, a program segment, which is a part of the interrrupt service routine, is given to transfer $$500$$ bytes from an $${\rm I}/O$$ device to memory. Initialize the address register Initialize the count to $$500$$
$$LOOP:$$ Load a byte from device Store in memory at address given by address register $$$\eqalign{ & Increment\,\,\,the\,\,\,address\,\,register \cr & Decrement\,\,\,the\,\,count \cr & If\,\,\,count!\,\,\, = 0\,\,\,go\,\,\,to\,\,\,LOOP \cr} $$$

Assume that each statement in this program is equivalent to a machine instruction which takes one clock cycle to execute if it is non- load/store instruction. The load-store instructions take two clock cycles to execute.

The designer of the system also has an alternate approach of using the $$DMA$$ controller to implement the same transfer. The $$DMA$$ controller requires $$20$$ clock cycles for initialization and other overheads. Each $$DMA$$ transfer cycle takes two clock cycles to transfer one byte of data from the device to the memory.

What is the approximate speed up when the $$DMA$$ controller based design is used in place of the interrupt driven program based input-output?

A
$$3.4$$
B
$$4.4$$
C
$$5.1$$
D
$$6.7$$
2
GATE CSE 2011
MCQ (Single Correct Answer)
+1
-0.3
A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?
A
GATE CSE 2011 Data Structures - Trees Question 59 English Option 1
B
GATE CSE 2011 Data Structures - Trees Question 59 English Option 2
C
GATE CSE 2011 Data Structures - Trees Question 59 English Option 3
D
GATE CSE 2011 Data Structures - Trees Question 59 English Option 4
3
GATE CSE 2011
MCQ (Single Correct Answer)
+2
-0.6
We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree?
A
0
B
1
C
n!
D
(1/n+1) * 2nCn
4
GATE CSE 2011
MCQ (Single Correct Answer)
+1
-0.3
Consider a relation table with a single record for each registered student with a single record for each registered student with the following attributes.
$$1.$$ $$Registration$$ $$Num:$$ Unique registration number of each registered student.
$$2.$$ $$UID :$$ Unique identity number, unique at the national level for each cityzen.
$$3.$$ $$BankAccount_Num:$$ Unique account number at the bank. A student can have multiple accounts or joint accounts. This attribute stores the primary account number.
$$4.$$ $$Name:$$ Name of the student
$$5.$$ $$Hostel$$ $$Room:$$ Room number of the hostel.

Which of the following options is INCORRECT?

A
$$BankAccount$$ $$Num$$ is candidate key
B
$$Registration$$ $$Num$$ can be a primary key
C
$$UID$$ is a candidate key if all students are from the same country
D
If $$S$$ is a superkey such that $$S \cap UID$$ is NULL then $$S \cup UID$$ is also a superkey
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12