1
GATE CSE 1990
MCQ (Single Correct Answer)
+1
-0.3

Match the followings:

Group-I

(a) Pointer data type
(b) Activation Record
(c) Repeat -Until
(d) Coercion

Group-II

(p) Type Conversion
(q) Dynamic Data Structure
(r) Recursion
(s) Nondeterministic loop
A
a - p, b - r, c - s, d - q
B
a - q, b - r, c - s, d - p
C
a - q, b - s, c - r, d - p
D
a - r, b - q, c - s, d - p
2
GATE CSE 1990
Subjective
+2
-0
A block -set associative cache memory consists of $$128$$ blocks divided into four block sets. The main memory consists of $$16,384$$ blocks and each blocks contains $$256$$ eight bit words.

(i) How many bits are required for addressing the main memory?

(ii) How many bits are needed to represent the TAG, SET and WORD fields?

3
GATE CSE 1990
Subjective
+5
-0
State the Both's algorithm for multiplication of two numbers, Draw a block diagram for the implementation of the Booth's algorithm for determining the product of two $$8-$$bit signed numbers.
4
GATE CSE 1990
Fill in the Blanks
+2
-0
Fill in the blanks:
In the two bit full-adder/sub tractor unit shown in Fig., when the switch is in position $$2.$$ $$.....$$ using $$.....$$ arithmetic. GATE CSE 1990 Digital Logic - Combinational Circuits Question 14 English
EXAM MAP