Register
GATE 1999 Computer Science questions and solutions

Recent questions tagged gate1999

3.6k
views
4 answers
11 votes
GATE CSE 1999 | Question: 20-b
Consider the following solution to the producer-consumer problem using a buffer of size 1. Assume that the initial value of count is 0. Also assume that the testing of co...
User Avatar
1.9k
views
3 answers
3 votes
GATE CSE 1999 | Question: 22-b
Consider the set of relationsEMP (Employee-no. Dept-no, Employee-name, Salary)DEPT (Dept-no. Dept-name, Location)Write an SQL query to:Calculate, for each department numb...
User Avatar
3.3k
views
2 answers
27 votes
GATE CSE 1999 | Question: 11b
Write a constant time algorithm to insert a node with data $D$ just before the node with address $p$ of a singly linked list.
User Avatar
3.2k
views
5 answers
21 votes
GATE CSE 1999 | Question: 3
Mr. X claims the following: If a relation R is both symmetric and transitive, then R is reflexive. For this, Mr. X offers the following proof:“From xRy, using symme...
User Avatar
12.6k
views
4 answers
22 votes
GATE CSE 1999 | Question: 22-a
Consider the set of relationsEMP (Employee-no. Dept-no, Employee-name, Salary)DEPT (Dept-no. Dept-name, Location)Write an SQL query to:Find all employees names who work i...
User Avatar
8.2k
views
2 answers
36 votes
GATE CSE 1999 | Question: 21
Consider a B-tree with degree $m$, that is, the number of children, $c$, of any internal node (except the root) is such that $m \leq c \leq 2m-1$. Derive the maximum and ...
User Avatar
4.6k
views
6 answers
21 votes
GATE CSE 1999 | Question: 20-a
A certain processor provides a 'test and set' instruction that is used as follows:TSET register, flagThis instruction atomically copies flag to register and sets flag to ...
User Avatar
26.3k
views
4 answers
46 votes
GATE CSE 1999 | Question: 19
A certain computer system has the segmented paging architecture for virtual memory. The memory is byte addressable. Both virtual and physical address spaces contain $2^{1...
User Avatar
762
views
0 answers
0 votes
GATE CSE 1999 | Question: 18
Design a 2K $\times$ 8 (2048 locations, each 8 bit wide) memory system mapped at addresses (1000)$_{16}$ to (17FF)$_{16}$ for the 8085 processor using four 1K $\times$ 4 ...
User Avatar
6.1k
views
3 answers
22 votes
GATE CSE 1999 | Question: 17
Consider the following program fragment in the assembly language of a certain hypothetical processor. The processor has three general purpose registers $R1, R2$and $R3$. ...
User Avatar
527
views
0 answers
0 votes
GATE CSE 1999 | Question: 16
User Avatar
6.0k
views
1 answers
13 votes
GATE CSE 1999 | Question: 15
What will be the output of the following program assuming that parameter passing iscall by valuecall by referencecall by copy restoreprocedure P{x, y, z}; begin y:y+1; z:...
User Avatar
2.5k
views
3 answers
13 votes
GATE CSE 1999 | Question: 14
Show that the formula $\left[(\sim p \vee q) \Rightarrow (q \Rightarrow p)\right]$ is not a tautology.Let $A$ be a tautology and $B$ any other formula. Prove that $(A \ve...
User Avatar
10.8k
views
3 answers
35 votes
GATE CSE 1999 | Question: 13
An instruction pipeline consists of $4$ stages – Fetch $(F)$, Decode field $(D)$, Execute $(E)$ and Result Write $(W)$. The $5$ instructions in a certain instruction se...
User Avatar
4.7k
views
3 answers
20 votes
GATE CSE 1999 | Question: 12
In binary tree, a full node is defined to be a node with $2$ children. Use induction on the height of the binary tree to prove that the number of full nodes plus one is e...
User Avatar
6.6k
views
3 answers
41 votes
GATE CSE 1999 | Question: 11a
Consider the following algorithms. Assume, procedure $A$ and procedure $B$ take $O (1)$ and $O(1/n)$ unit of time respectively. Derive the time complexity of the algorith...
User Avatar
1.7k
views
1 answers
6 votes
GATE CSE 1999 | Question: 10
Suppose we have a function HALTS which when applied to any arbitrary function $f$ and its arguments will say TRUE if function $f$ terminates for those arguments and FALSE...
User Avatar
1.8k
views
0 answers
2 votes
GATE CSE 1999 | Question: 9
Let synthesized attribute val give the value of the binary number generated by S in the following grammar. For example, on input 101.101, S.val = 5.625.$S \rightarrow L.L...
User Avatar
5.4k
views
3 answers
31 votes
GATE CSE 1999 | Question: 8
Let $A$ be an $n \times n$ matrix such that the elements in each row and each column are arranged in ascending order. Draw a decision tree, which finds $1$st, $2$nd and $...
User Avatar
5.2k
views
2 answers
34 votes
GATE CSE 1999 | Question: 7
Show that the language $$L = \left\{ xcx \mid x \in \left\{0,1\right\}^* \text{ and }c\text{ is a terminal symbol}\right\}$$ is not context free. $c$ is not $0$ or $1$.
User Avatar
4.2k
views
4 answers
28 votes
GATE CSE 1999 | Question: 6
Given that $A$ is regular and $(A \cup B)$ is regular, does it follow that $B$ is necessarily regular? Justify your answer.Given two finite automata $M1, M2$, outline an ...
User Avatar
6.6k
views
5 answers
33 votes
GATE CSE 1999 | Question: 5
Let $G$ be a connected, undirected graph. A cut in $G$ is a set of edges whose removal results in $G$ being broken into two or more components, which are not connected wi...
User Avatar
3.2k
views
1 answers
9 votes
GATE CSE 1999 | Question: 4
Let $G$ be a finite group and $H$ be a subgroup of $G$. For $a \in G$, define $aH=\left\{ah \mid h \in H\right\}$.Show that $|aH| = |bH|.$Show that for every pair of elem...
User Avatar
20.4k
views
2 answers
39 votes
GATE CSE 1999 | Question: 2.25
Which of the following is/are correct?An SQL query automatically eliminates duplicatesAn SQL query will not work if there are no indexes on the relationsSQL permits attri...
User Avatar
11.4k
views
3 answers
47 votes
GATE CSE 1999 | Question: 2.24
Consider the following $C$ function definitionint Trial (int a, int b, int c) { if ((a>=b) && (c<b)) return b; else if (a>=b) return Trial(a, c, b); else return Trial(b, ...
User Avatar
15.8k
views
3 answers
54 votes
GATE CSE 1999 | Question: 2.23
A certain processor supports only the immediate and the direct addressing modes. Which of the following programming language features cannot be implemented on this proces...
User Avatar
9.3k
views
5 answers
36 votes
GATE CSE 1999 | Question: 2.22
The main difference(s) between a CISC and a RISC processor is/are that a RISC processor typicallyhas fewer instructionshas fewer addressing modeshas more registersis easi...
User Avatar
15.4k
views
8 answers
46 votes
GATE CSE 1999 | Question: 2.21
If $T_1 = O(1)$, give the correct matching for the following pairs:$$\begin{array}{l|l}\hline \text{(M) $T_n = T_{n-1} + n$} & \text{(U) $T_n = O(n)$} \\\hline \text{(...
User Avatar
7.6k
views
2 answers
15 votes
GATE CSE 1999 | Question: 2.19
Arrange the following configuration for CPU in decreasing order of operating speeds:Hard wired control, Vertical microprogramming, Horizontal microprogramming.Hard wired ...
User Avatar
10.6k
views
6 answers
24 votes
GATE CSE 1999 | Question: 2-18, ISRO2008-46
Raid configurations of the disks are used to provideFault-tolerance High speedHigh data density(A) & (B)
User Avatar
Page: