Register

Recent questions tagged gate1998

26 votes
4 answers
36
GATE CSE 1998 | Question: 2.16
The overlay tree for a program is as shown below: What will be the size of the partition (in physical memory) required to load (and run) this program? $\text{12 KB}$ $\text{14 KB}$ $\text{10 KB}$ $\text{8 KB}$
The overlay tree for a program is as shown below:What will be the size of the partition (in physical memory) required to load (and run) this program?$\text{12 KB}$$\text{...
User Avatar
28 votes
1 answer
37
GATE CSE 1998 | Question: 2.15
Faster access to non-local variables is achieved using an array of pointers to activation records called a stack heap display activation tree
Faster access to non-local variables is achieved using an array of pointers to activation records called a stackheapdisplayactivation tree
User Avatar
25 votes
3 answers
39
GATE CSE 1998 | Question: 2.13
What is the result of the following program? program side-effect (input, output); var x, result: integer; function f (var x:integer):integer; begin x:x+1;f:=x; end begin x:=5; result:=f(x)*f(x); writeln(result); end $5$ $25$ $36$ $42$
What is the result of the following program?program side-effect (input, output); var x, result: integer; function f (var x:integer):integer; begin x:x+1;f:=x; end begin x...
User Avatar
29 votes
6 answers
40
GATE CSE 1998 | Question: 2.12
What value would the following function return for the input $x=95$? Function fun (x:integer):integer; Begin If x > 100 then fun = x – 10 Else fun = fun(fun (x+11)) End; $89$ $90$ $91$ $92$
What value would the following function return for the input $x=95$?Function fun (x:integer):integer; Begin If x 100 then fun = x – 10 Else fun = fun(fun (x+11)) End;$...
User Avatar
29 votes
11 answers
41
GATE CSE 1998 | Question: 2.11
A complete $n$-ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$-ary tree, the number of leaves in it is given by $x(n-1) +1$ $xn-1$ $xn +1$ $x(n+1)$
A complete $n$-ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$-ary tree, the number of leaves in it is g...
User Avatar
22 votes
3 answers
43
GATE CSE 1998 | Question: 2-9
Formatting for a floppy disk refers to arranging the data on the disk in contiguous fashion writing the directory erasing the system data writing identification information on all tracks and sectors
Formatting for a floppy disk refers toarranging the data on the disk in contiguous fashionwriting the directoryerasing the system datawriting identification information o...
User Avatar
22 votes
3 answers
44
GATE CSE 1998 | Question: 2.8
Which of the following operations is commutative but not associative? AND OR NAND EXOR
Which of the following operations is commutative but not associative?ANDORNANDEXOR
User Avatar
25 votes
1 answer
45
GATE CSE 1998 | Question: 2.7
The function represented by the Karnaugh map given below is $A.B$ $AB+BC+CA$ $\overline{B \oplus C}$ $A.BC$
The function represented by the Karnaugh map given below is$A.B$$AB+BC+CA$$\overline{B \oplus C}$$A.BC$
User Avatar
23 votes
3 answers
46
GATE CSE 1998 | Question: 2.6
Which of the following statements is false? Every finite subset of a non-regular set is regular Every subset of a regular set is regular Every finite subset of a regular set is regular The intersection of two regular sets is regular
Which of the following statements is false?Every finite subset of a non-regular set is regularEvery subset of a regular set is regularEvery finite subset of a regular set...
User Avatar
39 votes
4 answers
47
GATE CSE 1998 | Question: 2.5
Let $L$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimal state deterministic finite state automaton accepting $L$ is $2$ $5$ $8$ $3$
Let $L$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimal state deterministic finite state automaton accepting $L$...
User Avatar
26 votes
5 answers
50
GATE CSE 1998 | Question: 2.2
Consider the following determinant $\Delta = \begin{vmatrix} 1 & a & bc \\ 1 & b & ca \\ 1 & c & ab \end{vmatrix}$ Which of the following is a factor of $\Delta$? $a+b$ $a-b$ $a+b+c$ $abc$
Consider the following determinant $\Delta = \begin{vmatrix} 1 & a & bc \\ 1 & b & ca \\ 1 & c & ab \end{vmatrix}$Which of the following is a factor of $\Delta$?$a+b$$a-b...
User Avatar
20 votes
4 answers
51
GATE CSE 1998 | Question: 2.1
The rank of the matrix given below is: $\begin{bmatrix} 1 &4 &8 &7\\ 0 &0& 3 &0\\ 4 &2& 3 &1\\ 3 &12 &24 &21 \end{bmatrix}$ $3$ $1$ $2$ $4$
The rank of the matrix given below is:$$\begin{bmatrix} 1 &4 &8 &7\\ 0 &0& 3 &0\\ 4 &2& 3 &1\\ 3 &12 &24 &21 \end{bmatrix}$$$3$$1$$2$$4$
User Avatar
47 votes
2 answers
52
GATE CSE 1998 | Question: 1.35
There are five records in a database. ... and it contains the values $1, 3, 2, 5$ and $4$. Which one of the fields is the index built from? Age Name Occupation Category
There are five records in a database.$$\begin{array}{|c|c|c|c|} \hline \textbf {Name} & \textbf {Age} & \textbf {Occupation} & \textbf{Category } \\\hline \text{Rama} & ...
User Avatar
31 votes
8 answers
53
GATE CSE 1998 | Question: 1.34
Which normal form is considered adequate for normal relational database design? $2NF$ $5NF$ $4NF$ $3NF$
Which normal form is considered adequate for normal relational database design?$2NF$$5NF$$4NF$$3NF$
User Avatar
23 votes
1 answer
54
GATE CSE 1998 | Question: 1.33
Given two union compatible relations $R_1(A, B)$ and $R_2 (C, D)$, what is the result of the operation $R_1 \Join_{ A = C \wedge B = D} R_2$? $R_1 \cup R_2$ $R_1 \times R_2$ $R_1 – R_2$ $R_1 \cap R_2$
Given two union compatible relations $R_1(A, B)$ and $R_2 (C, D)$, what is the result of the operation $R_1 \Join_{ A = C \wedge B = D} R_2$?$R_1 \cup R_2$$R_1 \times R_2...
User Avatar
29 votes
4 answers
55
GATE CSE 1998 | Question: 1.32
A computer has six tape drives, with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock free? $6$ $5$ $4$ $3$
A computer has six tape drives, with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock fr...
User Avatar
19 votes
4 answers
56
GATE CSE 1998 | Question: 1.31
A counting semaphore was initialized to $10$. Then $6 P$ (wait) operations and $4V$ (signal) operations were completed on this semaphore. The resulting value of the semaphore is $0$ $8$ $10$ $12$
A counting semaphore was initialized to $10$. Then $6 P$ (wait) operations and $4V$ (signal) operations were completed on this semaphore. The resulting value of the semap...
User Avatar
32 votes
3 answers
57
GATE CSE 1998 | Question: 1.30
When the result of a computation depends on the speed of the processes involved, there is said to be cycle stealing race condition a time lock a deadlock
When the result of a computation depends on the speed of the processes involved, there is said to becycle stealingrace conditiona time locka deadlock
User Avatar
18 votes
2 answers
59
GATE CSE 1998 | Question: 1.28
A linker reads four modules whose lengths are $200, 800, 600$ and $500$ words, respectively. If they are loaded in that order, what are the relocation constants? $0, 200, 500, 600$ $0, 200, 1000, 1600$ $200, 500, 600, 800$ $200, 700, 1300, 2100$
A linker reads four modules whose lengths are $200, 800, 600$ and $500$ words, respectively. If they are loaded in that order, what are the relocation constants?$0, 200, ...
User Avatar
46 votes
2 answers
60
GATE CSE 1998 | Question: 1.27
Type checking is normally done during lexical analysis syntax analysis syntax directed translation code optimization
Type checking is normally done duringlexical analysissyntax analysissyntax directed translationcode optimization
User Avatar
Page: