GATE 1990 CSE & IT
33 questions across 1 session
Match the pairs in the following: List - I (A) Pointer data type (B) Activation record (C) Repeat-until (D) Coercion List - II (p) Type conversion (q) Dynamic data structure (r) Re...
Show with the help of a block diagram represent Boolean function: $$f=AB+BC+CA$$ can be realized using only $$4:1$$ multiplexer.
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...
State whether the following statements are TRUE or FALSE with reason. The Link-load -and-go loading scheme required less storange space than the Link-and-go loading scheme.
Under paged memory management scheme simple lock and key memory protection arrangement may still be required if the $$........$$ processors do not have address mapping hardware.
Match the pairs in the following Question. $$\eqalign{ & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,List:\,{\rm I} \cr & \left( A \right)\,\,Criotical\,\,region \cr & \left( B \right)\,\,Wait/S...
Consider the number given by the decimal expression. $${16^3} \times 9 + {16^2} \times 7 + 16 \times 5 + 3$$ The number of $$1's$$ in the unsigned binary representation of the numb...
The highest-response ratio next scheduling policy favours $$.......$$ jobs, but it also limits the waiting time of $$ .....$$ jobs.
A certain moving arm disk-storage device has the following specifications: Number of tracks per surface $$=4004$$ Track storage capacity $$=130030$$ bytes Disk speed $$=3600$$ rpm...
State whether the following statement are TRUE or FALSE with reason. The data transfer between memory and $${\rm I}/O$$ devices using programmed $${\rm I}/O$$ is fasterthan interrr...
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 sign...
In a two -level virtual memory, the memory access time for main memory, $${t_M} = {10^{ - 8}}\sec $$ and the memory access time for the secondary memory, tag $$ = {10^{ - 3}}.$$ Wh...
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) N...
Indicate which of the following well-formed formula are valid:
Match the following: List - I (a) Lexical Analysis (b) Code Optimization (c) Code Generation (d) Abelian Group List - II (p) DAG's (q) Syntax trees (r) Push Down automata (s) Finit...
Match the pairs in the following: List - I (a) Straseen's matrix multiplication algorithm (b) Kruskal's minimum spanning tree algorithm (c) Bioconnected components algorithm (d) Fl...
Semaphore operations are atomic because they are implemented within the OS
Express T(n) in terms of the harmonic number H n = $$\sum\limits_{t = 1}^n {1/i,n \ge 1} $$ where T(n) satisfies the recurrence relation, T(n) = $${{n + 1} \over 2}$$ T(n-1) + 1, f...
Match the pairs in the following: List - I (a) Heap construction (b) Constructing hash table witn linear probing (c) AVL Tree construction (d) Digital tree construction List - II (...
Find the minimum product of sums of the following expression $$f = ABC + \overline A \,\overline B \,\overline C .$$
A graph is planar if and only if,
State whether the following statements are TRUE or FALSE with reason. Transferring data in blocks from the main memory to the cache memory enables an interleaved main memory unit t...
Assuming the current disk cylinder to be $$50$$ and the sequence for the cylinders to be $$1, 36, 49, 65, 53, 1, 2, 3, 20, 55, 16, 65$$ and $$78$$ find the sequences of servicing u...
Match the pairs in the following: List - I (A) Small talk (B) LISP (C) Prolog (D) VAL List - II (p) Logic programming (q) Data flow programming (r) Functional programming (s) Objec...
State whether the following statement is TRUE / FALSE. The problem is to whether a Turing Machine M accepts input $$w$$ is un-decidable.
Recursive languages are:
It is decidable whether:
State whether the following statement is TRUE / FALSE. All subjects of regular sets are regular.
State whether the following statement is TRUE / FALSE. A minimal $$DFA$$ that is equivalent to an $$NFDA$$ with $$n$$ modes has always 2 n states
State whether the following statement is TRUE / FALSE. A is recursive if both a and its complement are accepted by Turing Machine M accepts.
State whether the following statement is TRUE / FALSE. Regularity is preserved under the operation of string reversal.
State whether the following statement is TRUE / FALSE. The intersection of two $$CFL's$$ is also $$CFL.$$
Let $${R_1}$$ and $${R_2}$$ be regular sets defined over the alphabet $$\sum \, $$ then: