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
Recent questions tagged gate1997
1
vote
0
answers
1
GATE CSE 1997 | Question: 16
In this GATE ques- Part a) For Size balanced tree the recurrence (max height) is T(h)=T(h-1) +T(h-2) +1, solving which we get T(0)=1, T(1)=2,T(2)=1+2+1=4, T(3)=4+2+1=7 Here, T(0),T(1),T(2) are of the form 2h but T(3) is not equal to 23 then how can we claim that "size-balance binary tree of height 'h' contain at least 2h nodes." ?
Mamta Satywali
asked
in
DS
Mar 14, 2018
by
Mamta Satywali
785
views
gate1997
data-structures
binary-tree
12
votes
1
answer
2
GATE CSE 1997 | Question: 76-b
Consider the following relational database schema: EMP (eno name, age) PROJ (pno name) INVOLVED (eno, pno) EMP contains information about employees. PROJ about projects and involved about which employees involved in which projects. The underlined attributes are the primary ... makes a copy of $\text{EMP}$ and names it $E$ ($\rho$ is called the rename operator))
go_editor
asked
in
Databases
Feb 8, 2018
by
go_editor
2.3k
views
gate1997
databases
sql
descriptive
normal
1
vote
0
answers
3
GATE-1997 (1-marks question) logic function and minimization
Let * be define as x*y=x'+y. let z=x*y value of z*x is ... 1>x'+y 2>x 3>0 4>1
air1ankit
asked
in
Digital Logic
Sep 1, 2017
by
air1ankit
430
views
gate1997
digital-logic
propositional-logic
4
votes
0
answers
4
GATE-1997
Which of the following is essential for converting an infix expression into postfix? a - An operator stack b - An operand stack c - both a and b d - A parse tree I understand that you do not require an operand stack; only operator stack can do the job. But don't the parse tree also qualify for the answer?
Hardik1997
asked
in
DS
Jul 11, 2017
by
Hardik1997
630
views
data-structures
stack
gate1997
1
vote
3
answers
5
Deadlock
A computer has six tape drivers, with n processes competing for them. Each process may need two drivers. What is the maximum value of n for the system to be deadlock free? a] 6 b] 5 c] 4 d] 3
Cruise Device
asked
in
Operating System
Jan 16, 2016
by
Cruise Device
564
views
deadlock-prevention-avoidance-detection
operating-system
gate1997
12
votes
3
answers
6
GATE CSE 1997 | Question: 76-a
Consider the following relational database schema: EMP (eno name, age) PROJ (pno name) INVOLVED (eno, pno) EMP contains information about employees. PROJ about projects and involved about which employees involved in which projects. The underlined ... which is equivalent to SQL query. select eno from EMP|INVOLVED where EMP.eno=INVOLVED.eno and INVOLVED.pno=3
go_editor
asked
in
Databases
Oct 15, 2015
by
go_editor
4.9k
views
gate1997
databases
sql
relational-algebra
descriptive
39
votes
4
answers
7
GATE CSE 1997 | Question: 75
An operating system handles requests to resources as follows. A process (which asks for some resources, uses them for some time and then exits the system) is assigned a unique timestamp are when it starts. The timestamps are monotonically increasing with time. Let us denote ... , show how. If not prove it. Can a process P ever starve? If yes, show how. If not prove it.
go_editor
asked
in
Operating System
Oct 15, 2015
by
go_editor
6.1k
views
gate1997
operating-system
resource-allocation
normal
descriptive
32
votes
2
answers
8
GATE CSE 1997 | Question: 74
A program $P$ reads and processes $1000$ consecutive records from a sequential file $F$ stored on device $D$ without using any file system facilities. Given the following Size of each record $= 3200$ bytes Access time of $D = 10$ ... a blocking factor of $2$ (i.e., each block on $D$ contains two records of $F$) and $P$ uses one buffer?
go_editor
asked
in
Operating System
Oct 15, 2015
by
go_editor
5.9k
views
gate1997
operating-system
disk
7
votes
3
answers
9
GATE CSE 1997 | Question: 73
A concurrent system consists of $3$ processes using a shared resource $R$ in a non-preemptible and mutually exclusive manner. The processes have unique priorities in the range $1 \dots 3$, $3$ being the highest priority. It is required to synchronize ... =true; else begin V(proceed [priority]); busy:=true; end V(mutex) Give the pseudo code for the procedure release_R.
go_editor
asked
in
Operating System
Oct 15, 2015
by
go_editor
1.4k
views
gate1997
operating-system
process-synchronization
descriptive
16
votes
1
answer
10
GATE CSE 1997 | Question: 72
Following floating point number format is given $f$ is a fraction represented by a $6-bit$ mantissa (includes sign bit) in sign magnitude form, $e$ is a $4-bit$ exponent (includes sign hit) in sign magnitude form and $n=(f, e) = f. 2^e$ ... addition of $A$ and $B.$ What is the percentage error (up to one position beyond decimal point) in the addition operation in (b)?
go_editor
asked
in
Digital Logic
Oct 15, 2015
by
go_editor
2.2k
views
gate1997
digital-logic
floating-point-representation
normal
descriptive
21
votes
1
answer
11
GATE CSE 1997 | Question: 71
Let $f=(\bar{w} + y)(\bar{x} +y)(w+\bar{x}+z)(\bar{w}+z)(\bar{x}+z)$ Express $f$ as the minimal sum of products. Write only the answer. If the output line is stuck at $0$, for how many input combinations will the value of $f$ be correct?
go_editor
asked
in
Digital Logic
Oct 15, 2015
by
go_editor
2.4k
views
gate1997
digital-logic
min-sum-of-products-form
numerical-answers
19
votes
1
answer
12
GATE CSE 1997 | Question: 70
Following is a state table for time finite state machine. ... . For example if states $X$ and $Y$ are equivalent then use $XY$ as the name for the equivalent state in the minimal machine).
go_editor
asked
in
Theory of Computation
Oct 15, 2015
by
go_editor
6.2k
views
gate1997
theory-of-computation
minimal-state-automata
descriptive
0
votes
0
answers
13
GATE CSE 1997 | Question: 24
Kathleen
asked
in
Others
Sep 29, 2014
by
Kathleen
437
views
gate1997
out-of-syllabus-now
pascal
4
votes
0
answers
14
GATE CSE 1997 | Question: 23
The language $L,$ defined by the following grammar, allows use of real or integer data in expressions and assignment statements. <assign-stmt> :: <LHS> := <E> <E> ::= <E> + <T>|<T> <T> :: ... that the name and type of variable can be obtained by making the function calls' give_name $(id)$ and give_type $(id)$ respectively.
Kathleen
asked
in
Compiler Design
Sep 29, 2014
by
Kathleen
1.1k
views
gate1997
compiler-design
syntax-directed-translation
normal
descriptive
unsolved
0
votes
0
answers
15
GATE CSE 1997 | Question: 22
Kathleen
asked
in
Others
Sep 29, 2014
by
Kathleen
269
views
gate1997
out-of-syllabus-now
pascal
39
votes
2
answers
16
GATE CSE 1997 | Question: 21
Given that $L$ is a language accepted by a finite state machine, show that $L^P$ and $L^R$ are also accepted by some finite state machines, where $L^P = \left\{s \mid ss' \in L \text{ some string }s'\right\}$ $L^R = \left\{s \mid s \text{ obtained by reversing some string in }L\right\}$
Kathleen
asked
in
Theory of Computation
Sep 29, 2014
by
Kathleen
4.1k
views
gate1997
theory-of-computation
finite-automata
proof
22
votes
1
answer
17
GATE CSE 1997 | Question: 20
Construct a finite state machine with minimum number of states, accepting all strings over $(a,b)$ such that the number of $a$'s is divisible by two and the number of $b$'s is divisible by three.
Kathleen
asked
in
Theory of Computation
Sep 29, 2014
by
Kathleen
10.2k
views
gate1997
theory-of-computation
finite-automata
normal
minimal-state-automata
descriptive
39
votes
5
answers
18
GATE CSE 1997 | Question: 19
A $B^+$ - tree of order $d$ is a tree in which each internal node has between $d$ and $2 d$ key values. An internal node with $M$ key values has $M + 1$ children. The root (if it is an internal node) has between $1$ and $2d$ key values. The distance ... $4$ with $52$ leaves? What is the minimum number of leaves in a $B^+$-tree of order $d$ and height $h(h\geq 1)$?
Kathleen
asked
in
Databases
Sep 29, 2014
by
Kathleen
12.4k
views
gate1997
databases
b-tree
normal
descriptive
20
votes
3
answers
19
GATE CSE 1997 | Question: 18
Consider the following piece of 'C' code fragment that removes duplicates from an ordered list of integers. Node *remove-duplicates (Node* head, int *j) { Node *t1, *t2; *j=0; t1 = head; if (t1! = NULL) t2 = t1 ->next; ... times statements marked $S2$ get executed? What is the significance of the value in the integer pointed to by $j$ when the function completes?
Kathleen
asked
in
DS
Sep 29, 2014
by
Kathleen
3.9k
views
gate1997
data-structures
linked-list
normal
descriptive
26
votes
2
answers
20
GATE CSE 1997 | Question: 17
An array $A$ contains $n \geq 1$ positive integers in the locations $A[1], A[2], \dots A[n]$. The following program fragment prints the length of a shortest sequence of consecutive elements of $A$, $A[i], A[i+1], \dots,A[j]$ ... ◻ end else begin if(j-i) < min then min:=j-i; sum:=sum -A[i]; i:=i+1; end writeln (min +1); end.
Kathleen
asked
in
DS
Sep 29, 2014
by
Kathleen
4.0k
views
gate1997
data-structures
array
normal
descriptive
20
votes
3
answers
21
GATE CSE 1997 | Question: 16
A size-balanced binary tree is a binary tree in which for every node the difference between the number of nodes in the left and right subtree is at most $1$. The distance of a node from the root is the length of the path from the root to the ... height $h \geqslant 1$, how many nodes are at distance $h-1$ from the root? Write only the answer without any explanations.
Kathleen
asked
in
DS
Sep 29, 2014
by
Kathleen
3.8k
views
gate1997
data-structures
binary-tree
normal
descriptive
proof
10
votes
4
answers
22
GATE CSE 1997 | Question: 15
Consider the following function. Function F(n, m:integer):integer; begin if (n<=0) or (m<=0) then F:=1 else F:F(n-1, m) + F(n, m-1); end; Use the recurrence relation ... value of $F(n, m)$? How many recursive calls are made to the function $F$, including the original call, when evaluating $F(n, m)$.
Kathleen
asked
in
Algorithms
Sep 29, 2014
by
Kathleen
3.3k
views
gate1997
algorithms
recurrence-relation
descriptive
19
votes
4
answers
23
GATE CSE 1997 | Question: 14
Let $R$ be a reflexive and transitive relation on a set $A$. Define a new relation $E$ on $A$ as $E=\{(a, b) \mid (a, b) \in R \text{ and } (b, a) \in R \}$ Prove that $E$ is an equivalence relation on $A$. Define a relation $\leq$ on the equivalence ... $\exists a, b$ such that $a \in E_1, b \in E_2 \text{ and } (a, b) \in R$. Prove that $\leq$ is a partial order.
Kathleen
asked
in
Set Theory & Algebra
Sep 29, 2014
by
Kathleen
3.0k
views
gate1997
set-theory&algebra
relations
normal
proof
descriptive
39
votes
3
answers
24
GATE CSE 1997 | Question: 13
Let $F$ be the set of one-to-one functions from the set $\{1, 2, \dots, n\}$ to the set $\{1, 2,\dots, m\}$ where $m\geq n\geq1$. How many functions are members of $F$? How many functions $f$ in $F$ satisfy the property $f(i)=1$ for some $i, 1\leq i \leq n$? How many functions $f$ in $F$ satisfy the property $f(i)<f(j)$ for all $i,j \ \ 1\leq i \leq j \leq n$?
Kathleen
asked
in
Set Theory & Algebra
Sep 29, 2014
by
Kathleen
4.9k
views
gate1997
set-theory&algebra
functions
normal
descriptive
46
votes
6
answers
25
GATE CSE 1997 | Question: 12
Consider a hash table with $n$ buckets, where external (overflow) chaining is used to resolve collisions. The hash function is such that the probability that a key value is hashed to a particular bucket is $\frac{1}{n}$. The hash table is initially ... in any of the $K$ insertions? What is the probability that the first collision occurs at the $K^{th}$ insertion?
Kathleen
asked
in
DS
Sep 29, 2014
by
Kathleen
8.4k
views
gate1997
data-structures
hashing
probability
normal
descriptive
23
votes
4
answers
26
GATE CSE 1997 | Question: 11
Consider the grammar $S \rightarrow bSe$ $S \rightarrow PQR$ $P \rightarrow bPc$ $P \rightarrow \varepsilon$ $Q \rightarrow cQd$ $Q \rightarrow \varepsilon$ $R \rightarrow dRe$ $R \rightarrow \varepsilon$ where $S, P, Q, R$ ... $i, j, k, m$? Find the smallest string that has two parse trees.
Kathleen
asked
in
Compiler Design
Sep 29, 2014
by
Kathleen
5.2k
views
gate1997
compiler-design
grammar
normal
theory-of-computation
descriptive
5
votes
1
answer
27
GATE CSE 1997 | Question: 10
Consider the following program in Pseudo-Pascal syntax. program what: var z: integer procedure recur(x): begin if x <= 40 then begin x:x+z recur(x); z:=x+10 end end(*recur*) begin(*what*) z=10; recur(z); writeln(z) end ... by program? How many times is ‘recur’ called? What value is printed by the program if the parameter is passed by reference?
Kathleen
asked
in
Programming
Sep 29, 2014
by
Kathleen
1.7k
views
gate1997
programming
parameter-passing
normal
out-of-syllabus-now
31
votes
4
answers
28
GATE CSE 1997 | Question: 9
Consider a graph whose vertices are points in the plane with integer co-ordinates $(x,y)$ such that $1 \leq x \leq n$ and $1 \leq y \leq n$, where $n \geq 2$ is an integer. Two vertices $(x_1, y_1)$ ... only the answer without any explanations. What is the weight of a maximum weight-spanning tree in this graph? Write only the answer without any explanations.
Kathleen
asked
in
Algorithms
Sep 29, 2014
by
Kathleen
5.2k
views
gate1997
algorithms
spanning-tree
normal
descriptive
0
votes
0
answers
29
GATE CSE 1997 | Question: 8
Kathleen
asked
in
Others
Sep 29, 2014
by
Kathleen
347
views
gate1997
out-of-syllabus-now
pascal
0
votes
0
answers
30
GATE CSE 1997 | Question: 7
Kathleen
asked
in
Digital Logic
Sep 29, 2014
by
Kathleen
462
views
gate1997
digital-logic
8085-microprocessor
out-of-syllabus-now
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
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
IIIT-Delhi 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
(844)
Tier 1 Placement Questions
(17)
Job Queries
(76)
Projects
(9)
Unknown Category
(866)
Recent questions tagged gate1997
Recent Blog Comments
congrats pranab
Congratulations @Pranab Paul 10 🥳
sir give access to these tests at least mid May...
Was there interview for mtech as well?
Check CCMT website for previous year cutoff for...