Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
GATE 1999 Computer Science questions and solutions
Recent questions tagged gate1999
11
votes
4
answers
1
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 count and assignment to count are atomic operations. Producer: Repeat Produce an ... item; Forever; Show that in this solution it is possible that both the processes are sleeping at the same time.
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...
go_editor
3.4k
views
go_editor
asked
Feb 28, 2018
Operating System
gate1999
operating-system
process-synchronization
normal
descriptive
+
–
3
votes
3
answers
2
GATE CSE 1999 | Question: 22-b
Consider the set of relations EMP (Employee-no. Dept-no, Employee-name, Salary) DEPT (Dept-no. Dept-name, Location) Write an SQL query to: Calculate, for each department number, the number of employees with a salary greater than Rs. 1,00,000
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...
go_editor
1.8k
views
go_editor
asked
Feb 8, 2018
Databases
gate1999
databases
sql
descriptive
easy
+
–
27
votes
2
answers
3
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.
Write a constant time algorithm to insert a node with data $D$ just before the node with address $p$ of a singly linked list.
Arjun
3.1k
views
Arjun
asked
Dec 17, 2016
DS
gate1999
data-structures
linked-list
descriptive
+
–
20
votes
5
answers
4
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 symmetry we get yRx. Now because R is transitive xRy and yRx together imply xRx. Therefore, R is reflexive”. Give an example of a relation R which is symmetric and transitive but not reflexive.
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...
Kathleen
2.9k
views
Kathleen
asked
Sep 23, 2014
Set Theory & Algebra
gate1999
set-theory&algebra
relations
normal
descriptive
+
–
22
votes
4
answers
5
GATE CSE 1999 | Question: 22-a
Consider the set of relations EMP (Employee-no. Dept-no, Employee-name, Salary) DEPT (Dept-no. Dept-name, Location) Write an SQL query to: Find all employees names who work in departments located at ‘Calcutta’ and whose salary is greater than Rs.50,000. Calculate, for each department number, the number of employees with a salary greater than Rs. 1,00,000.
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...
Kathleen
12.2k
views
Kathleen
asked
Sep 23, 2014
Databases
gate1999
databases
sql
easy
descriptive
+
–
36
votes
2
answers
6
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 minimum number of records in the leaf nodes for such a B-tree with height $h, h \geq 1. ($Assume that the root of a tree is at height $0).$
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 ...
Kathleen
7.9k
views
Kathleen
asked
Sep 23, 2014
Databases
gate1999
databases
b-tree
normal
descriptive
+
–
21
votes
6
answers
7
GATE CSE 1999 | Question: 20-a
A certain processor provides a 'test and set' instruction that is used as follows: TSET register, flag This instruction atomically copies flag to register and sets flag to $1$. Give pseudo-code for implementing the entry and exit code to a critical region using this instruction.
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 ...
Kathleen
4.4k
views
Kathleen
asked
Sep 23, 2014
Operating System
gate1999
operating-system
process-synchronization
normal
descriptive
+
–
46
votes
4
answers
8
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^{16}$ bytes each. The virtual address space is divided into $8$ non-overlapping equal ... in page table entry for storing the aging information for the page? Assume that the page size is $512$ bytes.
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...
Kathleen
25.1k
views
Kathleen
asked
Sep 23, 2014
Operating System
gate1999
operating-system
virtual-memory
normal
descriptive
+
–
0
votes
0
answers
9
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$ ... address lines. $A_0$ is the lest significant) $D_0, D_1, D_2, D_3$ (bi-directional data lines. $D_0$ is the least significant)
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 ...
Kathleen
705
views
Kathleen
asked
Sep 23, 2014
CO and Architecture
gate1999
co-and-architecture
8085-microprocessor
out-of-syllabus-now
+
–
22
votes
3
answers
10
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$. The meanings of the instructions are shown by comments (starting with ;) after the instructions. ... the values n, 0, and 0 respectively. What is the final value of $R3$ when control reaches $Z$?
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$. ...
Kathleen
5.8k
views
Kathleen
asked
Sep 23, 2014
CO and Architecture
gate1999
co-and-architecture
machine-instruction
normal
descriptive
+
–
0
votes
0
answers
11
GATE CSE 1999 | Question: 16
Kathleen
497
views
Kathleen
asked
Sep 23, 2014
Others
gate1999
out-of-syllabus-now
pascal
+
–
13
votes
1
answer
12
GATE CSE 1999 | Question: 15
What will be the output of the following program assuming that parameter passing is call by value call by reference call by copy restore procedure P{x, y, z}; begin y:y+1; z: x+x; end; begin a:= b:= 3; P(a+b, a, a); Print(a); end
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:...
Kathleen
5.8k
views
Kathleen
asked
Sep 23, 2014
Compiler Design
gate1999
parameter-passing
normal
runtime-environment
descriptive
+
–
13
votes
3
answers
13
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 \vee B)$ is a tautology.
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...
Kathleen
2.3k
views
Kathleen
asked
Sep 23, 2014
Mathematical Logic
gate1999
mathematical-logic
normal
propositional-logic
proof
descriptive
+
–
34
votes
3
answers
14
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 sequence need these stages for the different number of clock cycles as shown by the ... $5$ instructions.
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...
Kathleen
10.3k
views
Kathleen
asked
Sep 23, 2014
CO and Architecture
gate1999
co-and-architecture
pipelining
normal
numerical-answers
+
–
20
votes
3
answers
15
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 equal to the number of leaves. Draw the min-heap that results from insertion of the following ... empty min-heap: $7, 6, 5, 4, 3, 2, 1$. Show the result after the deletion of the root of this heap.
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...
Kathleen
4.4k
views
Kathleen
asked
Sep 23, 2014
DS
gate1999
data-structures
binary-heap
normal
descriptive
+
–
41
votes
3
answers
16
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 algorithm in $O$-notation. algorithm what (n) begin if n = 1 then call A else begin what (n-1); call B(n) end end.
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...
Kathleen
6.4k
views
Kathleen
asked
Sep 23, 2014
Algorithms
gate1999
algorithms
time-complexity
normal
descriptive
+
–
6
votes
1
answer
17
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 otherwise. Example: Given the following function definition. FACTORIAL (N) ... have a function like HALTS which for arbitrary functions and inputs says whether it will terminate on that input or not.
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...
Kathleen
1.6k
views
Kathleen
asked
Sep 23, 2014
Theory of Computation
gate1999
theory-of-computation
descriptive
decidability
+
–
2
votes
0
answers
18
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 \mid L$ $L \rightarrow LB \mid B$ $B \rightarrow 0 \mid 1$ Write S-attributed values corresponding to each of the productions to find S.val.
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...
Kathleen
1.6k
views
Kathleen
asked
Sep 23, 2014
Compiler Design
gate1999
compiler-design
grammar
normal
+
–
31
votes
3
answers
19
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 $3$rd smallest elements in minimum number of comparisons.
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 $...
Kathleen
5.1k
views
Kathleen
asked
Sep 23, 2014
Algorithms
gate1999
algorithms
sorting
normal
descriptive
+
–
34
votes
2
answers
20
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$.
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$.
Kathleen
5.0k
views
Kathleen
asked
Sep 23, 2014
Theory of Computation
gate1999
theory-of-computation
context-free-language
normal
proof
+
–
28
votes
4
answers
21
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 algorithm to decide if $L(M1) \subset L(M2)$. (note: strict subset)
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 ...
Kathleen
4.0k
views
Kathleen
asked
Sep 23, 2014
Theory of Computation
gate1999
theory-of-computation
normal
regular-language
descriptive
+
–
33
votes
5
answers
22
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 with each other. The size of a cut is called its cardinality. A min-cut of $G$ is a cut ... $n$ vertices has a min-cut of cardinality $k$, then $G$ has at least $\left(\frac{n\times k}{2}\right)$ edges.
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...
Kathleen
6.3k
views
Kathleen
asked
Sep 23, 2014
Graph Theory
gate1999
graph-theory
graph-connectivity
normal
descriptive
proof
+
–
9
votes
1
answer
23
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 elements $a, b \in G$, either $aH = bH$ or $aH$ and $bH$ are disjoint. Use the above to argue that the order of $H$ must divide the order of $G.$
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...
Kathleen
3.1k
views
Kathleen
asked
Sep 23, 2014
Set Theory & Algebra
gate1999
set-theory&algebra
group-theory
descriptive
proof
+
–
39
votes
2
answers
24
GATE CSE 1999 | Question: 2.25
Which of the following is/are correct? An SQL query automatically eliminates duplicates An SQL query will not work if there are no indexes on the relations SQL permits attribute names to be repeated in the same relation None of the above
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...
Kathleen
19.6k
views
Kathleen
asked
Sep 23, 2014
Databases
gate1999
databases
sql
easy
+
–
47
votes
3
answers
25
GATE CSE 1999 | Question: 2.24
Consider the following $C$ function definition int 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, a, c); } The functional Trial: Finds the maximum of $a$, $b$, and $c$ Finds the minimum of $a$, $b$, and $c$ Finds the middle number of $a$, $b$, $c$ None of the above
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, ...
Kathleen
11.1k
views
Kathleen
asked
Sep 23, 2014
Algorithms
gate1999
algorithms
identify-function
normal
+
–
54
votes
3
answers
26
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 processor? Pointers Arrays Records Recursive procedures with local variable
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...
Kathleen
15.4k
views
Kathleen
asked
Sep 23, 2014
CO and Architecture
gate1999
co-and-architecture
addressing-modes
normal
multiple-selects
+
–
35
votes
4
answers
27
GATE CSE 1999 | Question: 2.22
The main difference(s) between a CISC and a RISC processor is/are that a RISC processor typically has fewer instructions has fewer addressing modes has more registers is easier to implement using hard-wired logic
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...
Kathleen
9.0k
views
Kathleen
asked
Sep 23, 2014
CO and Architecture
gate1999
co-and-architecture
normal
cisc-risc-architecture
multiple-selects
+
–
45
votes
8
answers
28
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{(N) $T_n = T_{n/2} + n$} & \text{(V) $T_n = O(n \log n)$ ... $\text{M-W, N-U, O-X, P-V}$ $\text{M-V, N-W, O-X, P-U}$ $\text{M-W, N-U, O-V, P-X}$
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{(...
Kathleen
14.8k
views
Kathleen
asked
Sep 23, 2014
Algorithms
gate1999
algorithms
recurrence-relation
asymptotic-notation
normal
match-the-following
+
–
15
votes
2
answers
29
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 control, Vertical microprogramming, Horizontal microprogramming. Hard ... , Vertical microprogramming, Hard wired control. Vertical microprogramming, Horizontal microprogramming, Hard wired control.
Arrange the following configuration for CPU in decreasing order of operating speeds:Hard wired control, Vertical microprogramming, Horizontal microprogramming.Hard wired ...
Kathleen
7.3k
views
Kathleen
asked
Sep 23, 2014
CO and Architecture
gate1999
co-and-architecture
microprogramming
normal
+
–
23
votes
6
answers
30
GATE CSE 1999 | Question: 2-18, ISRO2008-46
Raid configurations of the disks are used to provide Fault-tolerance High speed High data density (A) & (B)
Raid configurations of the disks are used to provideFault-tolerance High speedHigh data density(A) & (B)
Kathleen
10.2k
views
Kathleen
asked
Sep 23, 2014
Operating System
gate1999
operating-system
disk
easy
isro2008
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register