Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
GATE 1999 Computer Science questions and solutions
Recent questions tagged gate1999
8
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.
go_editor
asked
in
Operating System
Feb 28, 2018
by
go_editor
2.6k
views
gate1999
operating-system
process-synchronization
normal
descriptive
2
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
go_editor
asked
in
Databases
Feb 8, 2018
by
go_editor
1.2k
views
gate1999
databases
sql
descriptive
easy
26
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.
Arjun
asked
in
DS
Dec 17, 2016
by
Arjun
2.4k
views
gate1999
data-structures
linked-list
descriptive
18
votes
4
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.
Kathleen
asked
in
Set Theory & Algebra
Sep 24, 2014
by
Kathleen
2.3k
views
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.
Kathleen
asked
in
Databases
Sep 24, 2014
by
Kathleen
10.8k
views
gate1999
databases
sql
easy
descriptive
34
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).$
Kathleen
asked
in
Databases
Sep 24, 2014
by
Kathleen
6.8k
views
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.
Kathleen
asked
in
Operating System
Sep 24, 2014
by
Kathleen
3.2k
views
gate1999
operating-system
process-synchronization
normal
descriptive
41
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.
Kathleen
asked
in
Operating System
Sep 24, 2014
by
Kathleen
17.7k
views
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)
Kathleen
asked
in
CO and Architecture
Sep 24, 2014
by
Kathleen
513
views
gate1999
co-and-architecture
8085-microprocessor
out-of-syllabus-now
19
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$?
Kathleen
asked
in
CO and Architecture
Sep 24, 2014
by
Kathleen
4.5k
views
gate1999
co-and-architecture
machine-instructions
normal
descriptive
0
votes
0
answers
11
GATE CSE 1999 | Question: 16
Kathleen
asked
in
Others
Sep 24, 2014
by
Kathleen
369
views
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
Kathleen
asked
in
Compiler Design
Sep 24, 2014
by
Kathleen
4.9k
views
gate1999
parameter-passing
normal
runtime-environment
descriptive
11
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.
Kathleen
asked
in
Mathematical Logic
Sep 24, 2014
by
Kathleen
1.7k
views
gate1999
mathematical-logic
normal
propositional-logic
proof
descriptive
33
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.
Kathleen
asked
in
CO and Architecture
Sep 24, 2014
by
Kathleen
8.2k
views
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.
Kathleen
asked
in
DS
Sep 24, 2014
by
Kathleen
3.5k
views
gate1999
data-structures
heap
normal
descriptive
38
votes
2
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.
Kathleen
asked
in
Algorithms
Sep 23, 2014
by
Kathleen
5.1k
views
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.
Kathleen
asked
in
Theory of Computation
Sep 23, 2014
by
Kathleen
1.2k
views
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.
Kathleen
asked
in
Compiler Design
Sep 23, 2014
by
Kathleen
1.3k
views
gate1999
compiler-design
grammar
normal
30
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.
Kathleen
asked
in
Algorithms
Sep 23, 2014
by
Kathleen
4.0k
views
gate1999
algorithms
sorting
normal
descriptive
33
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$.
Kathleen
asked
in
Theory of Computation
Sep 23, 2014
by
Kathleen
3.8k
views
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)
Kathleen
asked
in
Theory of Computation
Sep 23, 2014
by
Kathleen
3.3k
views
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.
Kathleen
asked
in
Graph Theory
Sep 23, 2014
by
Kathleen
5.3k
views
gate1999
graph-theory
graph-connectivity
normal
descriptive
proof
8
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.$
Kathleen
asked
in
Set Theory & Algebra
Sep 23, 2014
by
Kathleen
2.3k
views
gate1999
set-theory&algebra
group-theory
descriptive
proof
36
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
Kathleen
asked
in
Databases
Sep 23, 2014
by
Kathleen
15.7k
views
gate1999
databases
sql
easy
41
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
Kathleen
asked
in
Algorithms
Sep 23, 2014
by
Kathleen
8.7k
views
gate1999
algorithms
identify-function
normal
50
votes
2
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
Kathleen
asked
in
CO and Architecture
Sep 23, 2014
by
Kathleen
12.5k
views
gate1999
co-and-architecture
addressing-modes
normal
multiple-selects
31
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
Kathleen
asked
in
CO and Architecture
Sep 23, 2014
by
Kathleen
7.5k
views
gate1999
co-and-architecture
normal
cisc-risc-architecture
multiple-selects
42
votes
7
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}$
Kathleen
asked
in
Algorithms
Sep 23, 2014
by
Kathleen
12.0k
views
gate1999
algorithms
recurrence-relation
asymptotic-notations
normal
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.
Kathleen
asked
in
CO and Architecture
Sep 23, 2014
by
Kathleen
6.4k
views
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)
Kathleen
asked
in
Operating System
Sep 23, 2014
by
Kathleen
8.4k
views
gate1999
operating-system
disk
easy
isro2008
Page:
1
2
3
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
BITSHD 2023
My journey from being a MSc student to AIR 239 in GATE CSE 2023 and qualified UGC-NET JRF.
NEEPCO Recruitment 2023
GATE CSE 2023 Results
IIIT Banglore MTech 2023-24
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.5k)
Admissions
(653)
Exam Queries
(845)
Tier 1 Placement Questions
(17)
Job Queries
(76)
Projects
(9)
Unknown Category
(866)
Recent questions tagged gate1999
Recent Blog Comments
Please provide some tips about NET, since I want...
Amazing story to hear
Link added now:...
Sir can you please provide some good resources...
Where can we see the responses of the form filled?