menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
GO Book for GATECSE 2022
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
Exact tag match
Recent Posts
A Short Guide to GATE
Seeking DRDO Scientist B previous year papers
STRATEGY TO EFFECTIVELY CREATE SHORT & MICRO NOTES FOR GATE EXAM AND BEST REVISION STRATEGY BY AIR-"152"
My Video Experience AIR-152 GATE_CS(Some More motivation)!!!!!!
AIR 33 IN GATE 2021 AND HOW I USED GATEOVERFLOW DURING MY PREPARATION
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3.1k)
Programming and DS
(5.2k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Follow @gateoverflow
GATE Overflow
Recent questions tagged gate1989
Recent Blog Comments
A Wonderful journey and a Great compilation of...
@hitchh1ker Thank You :) I will share TOC and...
may i know ur emailID ...just want to ask few...
Congratulations !!π Were u preparing full...
Congrats and thanks for detailed guide.
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
GATE 1989 Computer Science Questions
Recent questions tagged gate1989
18
votes
4
answers
1
GATE1989-14a
Symbolize the expression "Every mother loves her children" in predicate logic.
Symbolize the expression "Every mother loves her children" in predicate logic.
asked
Dec 16, 2016
in
Mathematical Logic
makhdoom ghaya
2.2k
views
gate1989
descriptive
first-order-logic
mathematical-logic
19
votes
3
answers
2
GATE1989-13c
Find the number of single valued functions from set A to another set B, given that the cardinalities of the sets A and B are $m$ and $n$ respectively.
Find the number of single valued functions from set A to another set B, given that the cardinalities of the sets A and B are $m$ and $n$ respectively.
asked
Dec 16, 2016
in
Set Theory & Algebra
makhdoom ghaya
1.3k
views
gate1989
descriptive
functions
13
votes
3
answers
3
GATE1989-13b
Find a solution to the following recurrence equation: $T(n)=\sqrt{n}+T(\frac{n}{2})$ $T(1)=1$
Find a solution to the following recurrence equation: $T(n)=\sqrt{n}+T(\frac{n}{2})$ $T(1)=1$
asked
Dec 16, 2016
in
Algorithms
makhdoom ghaya
2k
views
gate1989
descriptive
algorithms
recurrence
5
votes
2
answers
4
GATE1989-13a
A language uses an alphabet of six letters, $\left\{a, b, c, d, e, f\right\}$ ... Design a prefix binary code for the language which would minimize the average length of the encoded words of the language.
A language uses an alphabet of six letters, $\left\{a, b, c, d, e, f\right\}$ ... Design a prefix binary code for the language which would minimize the average length of the encoded words of the language.
asked
Dec 16, 2016
in
Algorithms
makhdoom ghaya
1.2k
views
descriptive
gate1989
algorithms
huffman-code
0
votes
0
answers
5
GATE1989-12b
Consider a database with the following three relations: CREDITS (STUDENT; COURSE) OFFERS (TEACHER; COURSE) BELONGS (TEACHER; DEPARTMENT) Given below is a code in query language QUEL. Describe in one English sentence the query posed by the given QUEL program. range of s is CREDITS ... LIST1 range of e2 is LIST2 range of e3 is LIST3 retrieve(E1.I) where e1.I=e2.I and where e1.I=e3.I
Consider a database with the following three relations: CREDITS (STUDENT; COURSE) OFFERS (TEACHER; COURSE) BELONGS (TEACHER; DEPARTMENT) Given below is a code in query language QUEL. Describe in one English sentence the query posed by the given QUEL program. range of s is CREDITS range of t ... is LIST1 range of e2 is LIST2 range of e3 is LIST3 retrieve(E1.I) where e1.I=e2.I and where e1.I=e3.I
asked
Dec 15, 2016
in
Databases
makhdoom ghaya
243
views
descriptive
gate1989
databases
out-of-syllabus-now
27
votes
3
answers
6
GATE1989-12a
Fig.7 shows a $B+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted into the $B+$ tree. Obtain the modified $B+$ tree after insertion.
Fig.7 shows a $B+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted into the $B+$ tree. Obtain the modified $B+$ tree after insertion.
asked
Dec 9, 2016
in
Databases
makhdoom ghaya
4.1k
views
descriptive
gate1989
databases
b-tree
5
votes
1
answer
7
GATE1989-11b
Consider the following precedence graph (Fig.6) of processes where a node denotes a process and a directed edge from node $P_{i}$ to node $P_{j}$ implies; that $P_{i}$ must complete before $P_{j}$ commences. Implement the graph using FORK and JOIN constructs. The actual computation done by a process may be indicated by a comment line.
Consider the following precedence graph (Fig.6) of processes where a node denotes a process and a directed edge from node $P_{i}$ to node $P_{j}$ implies; that $P_{i}$ must complete before $P_{j}$ commences. Implement the graph using FORK and JOIN constructs. The actual computation done by a process may be indicated by a comment line.
asked
Dec 9, 2016
in
Operating System
makhdoom ghaya
1k
views
gate1989
descriptive
operating-system
precedence-graph
process-synchronization
11
votes
4
answers
8
GATE1989-11a
A system of four concurrent processes, $P, Q, R$ and $S$, use shared resources $A, B$ and $C$. The sequences in which processes, $P, Q, R$ and $S$ ... . What strategies can be used to prevent deadlocks in a system of concurrent processes using shared resources if preemption of granted resources is not allowed?
A system of four concurrent processes, $P, Q, R$ and $S$, use shared resources $A, B$ and $C$. The sequences in which processes, $P, Q, R$ and $S$ ... processes. What strategies can be used to prevent deadlocks in a system of concurrent processes using shared resources if preemption of granted resources is not allowed?
asked
Dec 9, 2016
in
Operating System
makhdoom ghaya
1.4k
views
descriptive
gate1989
operating-system
resource-allocation
0
votes
0
answers
9
GATE1989-10b
Consider the following grammar for variable declarations: <vardecl> $\rightarrow$ <vardecl><idlist> : <type>; <vardecl> $\rightarrow \in$ <idlist> $\rightarrow$ ... wherever necessary. Make suitable assumptions regarding procedures operating on the symbol table; you need not elaborate upon these procedures.
Consider the following grammar for variable declarations: <vardecl> $\rightarrow$ <vardecl><idlist> : <type>; <vardecl> $\rightarrow \in$ <idlist> $\rightarrow$ <idlist>, id <idlist> $\rightarrow$ id <type> $\rightarrow$ integer <type> ... error messages wherever necessary. Make suitable assumptions regarding procedures operating on the symbol table; you need not elaborate upon these procedures.
asked
Dec 5, 2016
in
Compiler Design
makhdoom ghaya
324
views
descriptive
gate1989
compiler-design
syntax-directed-translation
unsolved
0
votes
1
answer
10
GATE1989-10a
Will recursion work correctly in a language with static allocation of all variables? Explain.
Will recursion work correctly in a language with static allocation of all variables? Explain.
asked
Dec 5, 2016
in
Compiler Design
makhdoom ghaya
617
views
gate1989
descriptive
compiler-design
runtime-environments
9
votes
1
answer
11
GATE1989-9
An input files has $10$ records with keys as given below: $25\quad 7\quad 34\quad 2\quad 70\quad 9\quad 61\quad 16\quad 49\quad 19$ This is to be sorted in non-decreasing order. Sort the input file using QUICKSORT by correctly ... brackets to demarcate subfiles. Sort the input file using 2-way- MERGESORT showing all major intermediate steps. Use square brackets to demarcate subfiles.
An input files has $10$ records with keys as given below: $25\quad 7\quad 34\quad 2\quad 70\quad 9\quad 61\quad 16\quad 49\quad 19$ This is to be sorted in non-decreasing order. Sort the input file using QUICKSORT by correctly positioning ... brackets to demarcate subfiles. Sort the input file using 2-way- MERGESORT showing all major intermediate steps. Use square brackets to demarcate subfiles.
asked
Dec 3, 2016
in
Algorithms
makhdoom ghaya
1.6k
views
gate1989
descriptive
algorithms
sorting
1
vote
1
answer
12
GATE1989-8b
Indicate the result of the following program if the language uses (i) static scope rules and (ii) dynamic scope rules. var x, y:integer; procedure A (var z:integer); var x:integer; begin x:=1; B; z:= x end; procedure B; begin x:=x+1 end; begin x:=5; A(y); write (y) ...end.
Indicate the result of the following program if the language uses (i) static scope rules and (ii) dynamic scope rules. var x, y:integer; procedure A (var z:integer); var x:integer; begin x:=1; B; z:= x end; procedure B; begin x:=x+1 end; begin x:=5; A(y); write (y) ...end.
asked
Dec 3, 2016
in
Compiler Design
makhdoom ghaya
649
views
gate1989
descriptive
compiler-design
runtime-environments
1
vote
2
answers
13
GATE1989-8a
What is the output produced by the following program, when the input is "HTGATE" Function what (s:string): string; var n:integer; begin n = s.length if n <= 1 then what := s else what :=contact (what (substring (s, 2, n)), s.C [1]) end; Note type string= ... $s_{2}$ - length obtained by concatenating $s_{1}$ with $s_{2}$ such that $s_{1}$ precedes $s_{2}$.
What is the output produced by the following program, when the input is "HTGATE" Function what (s:string): string; var n:integer; begin n = s.length if n <= 1 then what := s else what :=contact (what (substring (s, 2, n)), s.C [1]) end; Note type string=record length:integer; ... $s_{1}$ length + $s_{2}$ - length obtained by concatenating $s_{1}$ with $s_{2}$ such that $s_{1}$ precedes $s_{2}$.
asked
Dec 3, 2016
in
Algorithms
makhdoom ghaya
531
views
gate1989
descriptive
algorithms
identify-function
0
votes
0
answers
14
GATE1989-7
An 8085-based microcomputer consisting of 16 kbytes of ROM, 16kbytes of RAM and four 8-bit I/O ports is to be designed using RAM and ROM chips each of 2 kbytes capacity. The chip to be used for I/O ports realization consists of two 8-bit ports and requires ... the memory address space. The I/O locations are to occupy lower order I/O address space. Give memory map and I/O address map.
An 8085-based microcomputer consisting of 16 kbytes of ROM, 16kbytes of RAM and four 8-bit I/O ports is to be designed using RAM and ROM chips each of 2 kbytes capacity. The chip to be used for I/O ports realization consists of two 8-bit ports and requires four ... in the memory address space. The I/O locations are to occupy lower order I/O address space. Give memory map and I/O address map.
asked
Dec 1, 2016
in
CO and Architecture
makhdoom ghaya
173
views
gate1989
descriptive
8085
out-of-syllabus-now
0
votes
0
answers
15
GATE1989-6b
In a certain computer system, there is special instruction implemented to call subroutines. The instruction is JSR Reg.Sub Microsequence: Temp β Sub SP β (SP)+2 (SP) β (Reg) Reg β (PC) PC β (Temp) Where Temp is an internal CPU register Sub ... you would implement co-routine using the JSR instruction. Show the control flow diagram and the contents of the stack before and after the call.
In a certain computer system, there is special instruction implemented to call subroutines. The instruction is JSR Reg.Sub Microsequence: Temp β Sub SP β (SP)+2 (SP) β (Reg) Reg β (PC) PC β (Temp) Where Temp is an internal CPU register Sub is calling ... you would implement co-routine using the JSR instruction. Show the control flow diagram and the contents of the stack before and after the call.
asked
Dec 1, 2016
in
CO and Architecture
makhdoom ghaya
184
views
gate1989
descriptive
co-and-architecture
assembly
unsolved
0
votes
0
answers
16
GATE1989-6a
A certain computer system was designed with cache memory of size $1$ Kbytes and main memory size of $256$ Kbytes. The cache implementation was fully associative cache with $4$ bytes per block. The CPU memory data path was $16$ bits and the memory was ... the following questions: What is the hit ratio? Suggest a change in the program size of model to improve the hit ratio significantly.
A certain computer system was designed with cache memory of size $1$ Kbytes and main memory size of $256$ Kbytes. The cache implementation was fully associative cache with $4$ bytes per block. The CPU memory data path was $16$ ... Answer the following questions: What is the hit ratio? Suggest a change in the program size of model to improve the hit ratio significantly.
asked
Dec 1, 2016
in
CO and Architecture
makhdoom ghaya
280
views
gate1989
descriptive
co-and-architecture
cache-memory
unsolved
5
votes
0
answers
17
GATE1989-5b
It is required to implement a stack using bidirectional shift registers providing stack under flow and overflow detection capability. How many shift registers are needed for a stack capacity of $n$ $k-$bit words? Show the schematic diagram of the implementation, clearly indicating all the data and control lines.
It is required to implement a stack using bidirectional shift registers providing stack under flow and overflow detection capability. How many shift registers are needed for a stack capacity of $n$ $k-$bit words? Show the schematic diagram of the implementation, clearly indicating all the data and control lines.
asked
Dec 1, 2016
in
Digital Logic
makhdoom ghaya
283
views
descriptive
gate1989
shift-registers
unsolved
19
votes
5
answers
18
GATE1989-5-a
Find values of Boolean variables $A, B, C$ which satisfy the following equations: A+ B = 1 AC = BC A + C = 1 AB = 0
Find values of Boolean variables $A, B, C$ which satisfy the following equations: A+ B = 1 AC = BC A + C = 1 AB = 0
asked
Dec 1, 2016
in
Digital Logic
makhdoom ghaya
1.7k
views
gate1989
descriptive
digital-logic
boolean-algebra
5
votes
2
answers
19
GATE1989-4-xiv
Provide short answers to the following questions: For secondary key processing which of the following file organizations is preferred? Give a one line justification: Indexed sequential file organization. Two-way linked list. Inverted file organization. Sequential file organization.
Provide short answers to the following questions: For secondary key processing which of the following file organizations is preferred? Give a one line justification: Indexed sequential file organization. Two-way linked list. Inverted file organization. Sequential file organization.
asked
Dec 1, 2016
in
Databases
makhdoom ghaya
3.1k
views
gate1989
normal
databases
indexing
0
votes
0
answers
20
GATE1989-4-xiii
Provide short answers to the following questions: Consider the following sequence of UNIX commands: grep main a.c b.c c.c > grepout & wc < grepout & rm grepout & Why is this not equivalent to the following? grep main a.c.b.c c.c | wc
Provide short answers to the following questions: Consider the following sequence of UNIX commands: grep main a.c b.c c.c > grepout & wc < grepout & rm grepout & Why is this not equivalent to the following? grep main a.c.b.c c.c | wc
asked
Dec 1, 2016
in
Operating System
makhdoom ghaya
225
views
descriptive
gate1989
operating-system
shell-script
out-of-syllabus-now
20
votes
2
answers
21
GATE1989-4-xii
Provide short answers to the following questions: Disk requests come to disk driver for cylinders $10, 22, 20, 2, 40, 6$ and $38$, in that order at a time when the disk drive is reading from cylinder $20$. The seek time is $6$ msec per cylinder. Compute the total seek time if the disk arm scheduling algorithm is. First come first served. Closest cylinder next.
Provide short answers to the following questions: Disk requests come to disk driver for cylinders $10, 22, 20, 2, 40, 6$ and $38$, in that order at a time when the disk drive is reading from cylinder $20$. The seek time is $6$ msec per cylinder. Compute the total seek time if the disk arm scheduling algorithm is. First come first served. Closest cylinder next.
asked
Dec 1, 2016
in
Operating System
makhdoom ghaya
2.5k
views
gate1989
descriptive
operating-system
disk-scheduling
2
votes
1
answer
22
GATE1989-4-xi
Provide short answers to the following questions: Express the following list in terms of a linked list structure suitable for internal representation. $(((ab)c)d((e)))$
Provide short answers to the following questions: Express the following list in terms of a linked list structure suitable for internal representation. $(((ab)c)d((e)))$
asked
Nov 30, 2016
in
DS
makhdoom ghaya
368
views
gate1989
descriptive
data-structures
linked-lists
unsolved
3
votes
1
answer
23
GATE1989-4-x
Provide short answers to the following questions: A switching function is said to be neutral if the number of input combinations for which its value is 1 is equal to the number of input combinations for which its value is 0. Compute the number of neutral switching functions of $n$ variables (for a given n).
Provide short answers to the following questions: A switching function is said to be neutral if the number of input combinations for which its value is 1 is equal to the number of input combinations for which its value is 0. Compute the number of neutral switching functions of $n$ variables (for a given n).
asked
Nov 30, 2016
in
Digital Logic
makhdoom ghaya
803
views
gate1989
descriptive
digital-logic
boolean-algebra
7
votes
2
answers
24
GATE1989-4-ix
Provide short answers to the following questions: Explain the behaviour of the following logic circuit (Fig.4) with level input A and output B
Provide short answers to the following questions: Explain the behaviour of the following logic circuit (Fig.4) with level input A and output B
asked
Nov 30, 2016
in
Digital Logic
makhdoom ghaya
1.3k
views
gate1989
descriptive
digital-logic
circuit-output
2
votes
1
answer
25
GATE1989-4-viii
Provide short answers to the following questions: $P_{n} (t)$ is the probability of $n$ events occurring during a time interval $t$. How will you express $P_{0} (t + h)$ in terms of $P_{0} (h)$, if $P_{0} (t)$ has stationary independent increments? (Note: $P_{t} (t)$is the probability density function).
Provide short answers to the following questions: $P_{n} (t)$ is the probability of $n$ events occurring during a time interval $t$. How will you express $P_{0} (t + h)$ in terms of $P_{0} (h)$, if $P_{0} (t)$ has stationary independent increments? (Note: $P_{t} (t)$is the probability density function).
asked
Nov 30, 2016
in
Probability
makhdoom ghaya
410
views
gate1989
descriptive
probability
poisson-distribution
4
votes
2
answers
26
GATE1989-4-vii
Provide short answers to the following questions: In the graph shown above, the depth-first spanning tree edges are marked with a 'T'. Identify the forward, backward and cross edges.
Provide short answers to the following questions: In the graph shown above, the depth-first spanning tree edges are marked with a 'T'. Identify the forward, backward and cross edges.
asked
Nov 30, 2016
in
Graph Theory
makhdoom ghaya
813
views
gate1989
descriptive
graph-theory
spanning-tree
dfs
0
votes
0
answers
27
GATE1989-4-vi
Provide short answers to the following questions: Consider the definition of macro B, nested within the definition of a macro A. Can a call to macro B also appear within macro A? If not, why not? If yes, explain if there are any restrictions.
Provide short answers to the following questions: Consider the definition of macro B, nested within the definition of a macro A. Can a call to macro B also appear within macro A? If not, why not? If yes, explain if there are any restrictions.
asked
Nov 30, 2016
in
Compiler Design
makhdoom ghaya
198
views
gate1989
descriptive
compiler-design
macros
unsolved
1
vote
1
answer
28
GATE1989-4-v
Is the following code template for the if-then-else statement correct? if not, correct it. if expression then statement $1$ else statement $2$ Template: Code for expression (*result in $E, E > O$ indicates true *) Branch on $E > O$ to $L1$ Code for statement $1$ $L1$: Code for statement $2$
Is the following code template for the if-then-else statement correct? if not, correct it. if expression then statement $1$ else statement $2$ Template: Code for expression (*result in $E, E > O$ indicates true *) Branch on $E > O$ to $L1$ Code for statement $1$ $L1$: Code for statement $2$
asked
Nov 30, 2016
in
Compiler Design
makhdoom ghaya
899
views
descriptive
gate1989
compiler-design
intermediate-code
7
votes
3
answers
29
GATE1989-4-iii
Provide short answers to the following questions: Show that {NOR} is a functionally complete set of Boolean operations.
Provide short answers to the following questions: Show that {NOR} is a functionally complete set of Boolean operations.
asked
Nov 30, 2016
in
Digital Logic
makhdoom ghaya
736
views
gate1989
descriptive
digital-logic
functional-completeness
2
votes
1
answer
30
GATE1989-4-ii
Provide short answers to the following questions: Compute the postfix equivalent of the following infix arithmetic expression $a + b * c + d * e β f$ where $β$ represents exponentiation. Assume normal operator precedences.
Provide short answers to the following questions: Compute the postfix equivalent of the following infix arithmetic expression $a + b * c + d * e β f$ where $β$ represents exponentiation. Assume normal operator precedences.
asked
Nov 30, 2016
in
Compiler Design
makhdoom ghaya
760
views
gate1989
descriptive
compiler-design
infix-prefix
intermediate-code
Page:
1
2
next »
...