The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged gate2001
+6
votes
1
answer
1
GATE200111b
A sequential circuit takes an input stream of 0's and 1's and produces an output stream of 0's and 1's. Initially it replicates the input on its output until two consecutive 0's are encountered on the input. From then onward, it produces an output stream, ... be used to design the circuit. Give the minimized sumofproduct expression for J and K inputs of one of its state flipflops
asked
Feb 12, 2018
in
Digital Logic
by
jothee
Veteran
(
100k
points)

515
views
gate2001
digitallogic
normal
descriptive
flipflop
+5
votes
2
answers
2
GATE200121b
Consider a relation examinee (regno, name, score), where regno is the primary key to score is a real number. Write an SQL query to list the regno of examinees who have a score greater than the average score.
asked
Feb 8, 2018
in
Databases
by
jothee
Veteran
(
100k
points)

359
views
gate2001
databases
sql
normal
descriptive
–1
vote
1
answer
3
GATE200121c
Consider a relation $\text{examinee (regno, name, score)},$ where regno is the primary key to score is a real number. Suppose the relation $\text{appears (regno, centr_code)}$ specifies the center where an examinee appears. Write an SQL query to list the centr_code having an examinee of score greater than $80.$
asked
Feb 8, 2018
in
Databases
by
jothee
Veteran
(
100k
points)

197
views
gate2001
databases
sql
normal
descriptive
+15
votes
4
answers
4
ISRO200711, GATE20011.19
Consider a set of n tasks with known runtimes $r_1, r_2, \dots r_n$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput? Round Robin Shortest job first Highest response ratio next first come first served
asked
Jun 10, 2016
in
Operating System
by
jothee
Veteran
(
100k
points)

4.1k
views
isro2007
operatingsystem
processschedule
gate2001
+7
votes
2
answers
5
GATE200122
We wish to construct a $B^+$ tree with fanout (the number of pointers per node) equal to $3$ for the following set of key values: $80, 50, 10, 70, 30, 100, 90$ Assume that the tree is initially empty and the values are added in the order given. Show ... trees need not be shown. The key values $30$ and $10$ are now deleted from the tree in that order show the tree after each deletion.
asked
Sep 15, 2014
in
Databases
by
Kathleen
Veteran
(
52.1k
points)

790
views
gate2001
databases
btree
normal
descriptive
unsolved
+15
votes
2
answers
6
GATE200121a
Consider a relation examinee (regno, name, score), where regno is the primary key to score is a real number. Write a relational algebra using $( \Pi, \sigma, \rho, \times)$ to find the list of names which appear more than once in examinee.
asked
Sep 15, 2014
in
Databases
by
Kathleen
Veteran
(
52.1k
points)

987
views
gate2001
databases
sql
normal
descriptive
+27
votes
3
answers
7
GATE200120
Consider a disk with the $100$ tracks numbered from $0$ to $99$ rotating at $3000$ rpm. The number of sectors per track is $100$ and the time to move the head between two successive tracks is $0.2$ millisecond. Consider a set of disk requests to ... at track $0$ and the elevator algorithm is used to schedule disk requests, what is the worse case time to complete all the requests?
asked
Sep 15, 2014
in
Operating System
by
Kathleen
Veteran
(
52.1k
points)

2.7k
views
gate2001
operatingsystem
disks
normal
descriptive
+26
votes
3
answers
8
GATE200119
Two concurrent processes $P1$ and $P2$ want to use resources $R1$ and $R2$ in a mutually exclusive manner. Initially, $R1$ and $R2$ ... to deadlock. Exchange the statements $Q1$ and $Q3$ and statements $Q2$ and $Q4$. Is mutual exclusion guaranteed now? Can deadlock occur?
asked
Sep 15, 2014
in
Operating System
by
Kathleen
Veteran
(
52.1k
points)

1.6k
views
gate2001
operatingsystem
resourceallocation
normal
descriptive
+14
votes
2
answers
9
GATE200118
Remove leftrecursion from the following grammar: $S \rightarrow Sa \mid Sb \mid a \mid b$ Consider the following grammar: $S \rightarrow aSbS\mid bSaS \mid ∊$ Construct all possible parse trees for the string abab. Is the grammar ambiguous?
asked
Sep 15, 2014
in
Compiler Design
by
Kathleen
Veteran
(
52.1k
points)

1k
views
gate2001
compilerdesign
grammar
descriptive
+5
votes
1
answer
10
GATE200117
The syntax of the repeatuntil statement is given by the following grammar $S \rightarrow\text{ repeat }S_1\text{ until }E$ where E stands for expressions, $S$ and $S_1$ stand for statements. The nonterminals $S$ and $S_1$ have an attribute code that ... a statement. Use the operator '\\' to concatenate two strings and the function gen(s) to generate a line containing the string s.
asked
Sep 15, 2014
in
Compiler Design
by
Kathleen
Veteran
(
52.1k
points)

440
views
gate2001
compilerdesign
syntaxdirectedtranslation
normal
descriptive
+16
votes
2
answers
11
GATE200116
Consider the following grammar with terminal alphabet $\Sigma =\{a,(,),+,* \}$ and start symbol $E$. The production rules of the grammar are: $ E \rightarrow aA$ $ E \rightarrow (E)$ $A \rightarrow +E$ $A \rightarrow *E$ $A \rightarrow \epsilon $ Compute the FIRST and FOLLOW sets for $E$ and $A$. Complete the LL(1) parse table for the grammar.
asked
Sep 15, 2014
in
Compiler Design
by
Kathleen
Veteran
(
52.1k
points)

755
views
gate2001
compilerdesign
parsing
normal
+16
votes
2
answers
12
GATE200115
Consider a weighted undirected graph with vertex set $V = \{ n1, n2, n3, n4, n5, n6 \} $ and edge set $E = \{(n1,n2,2), (n1,n3,8), (n1,n6,3), (n2,n4,4), (n2,n5,12), (n3,n4,7), (n4,n5,9), (n4,n6,4)\}$. ... unique over all possible minimum spanning trees of a graph? Is the maximum among the edge weights of a minimum spanning tree unique over all possible minimum spanning tree of a graph?
asked
Sep 15, 2014
in
Algorithms
by
Kathleen
Veteran
(
52.1k
points)

1.2k
views
gate2001
algorithms
spanningtree
normal
descriptive
+22
votes
3
answers
13
GATE200114
Insert the following keys one by one into a binary search tree in the order specified.$15, 32, 20, 9, 3, 25, 12, 1$Show the final binary search tree after the insertions. Draw the binary search tree after deleting $15$ from it. Complete the statements $S1$, $S2$ ... return 0; x = depth (t > left); S1: ___________; S2: if (x > y) return __________; S3: else return _______; }
asked
Sep 15, 2014
in
DS
by
Kathleen
Veteran
(
52.1k
points)

1.2k
views
gate2001
datastructure
binarysearchtree
normal
descriptive
+17
votes
2
answers
14
GATE200113
Consider the following C program: void abc(char*s) { if(s[0]=='\0')return; abc(s+1); abc(s+1); printf("%c",s[0]); } main() { abc("123"); } What will be the output of the program? If $abc(s)$ is called with a nullterminated string $s$ of length $n$ characters (not counting the null ('\0') character), how many characters will be printed by $abc(s)$?
asked
Sep 15, 2014
in
Programming
by
Kathleen
Veteran
(
52.1k
points)

2k
views
gate2001
programming
recursion
normal
descriptive
+26
votes
2
answers
15
GATE200112
Consider a $5$stage pipeline  IF (Instruction Fetch), ID (Instruction Decode and register read), EX (Execute), MEM (memory), and WB (Write Back). All (memory or register) reads take place in the second phase of a clock cycle and all ... Show all data dependencies between the four instructions. Identify the data hazards. Can all hazards be avoided by forwarding in this case.
asked
Sep 15, 2014
in
CO and Architecture
by
Kathleen
Veteran
(
52.1k
points)

3.3k
views
gate2001
coandarchitecture
pipelining
normal
descriptive
+14
votes
1
answer
16
GATE200111a
A sequential circuit takes an input stream of 0's and 1's and produces an output stream of 0's and 1's. Initially it replicates the input on its output until two consecutive 0's are encountered on the input. From then onward, it produces an output ... desired output 10110010110100 011 JK masterslave flipflops are to be used to design the circuit. Give the state transition diagram
asked
Sep 15, 2014
in
Digital Logic
by
Kathleen
Veteran
(
52.1k
points)

1k
views
gate2001
digitallogic
normal
descriptive
flipflop
+14
votes
5
answers
17
GATE200110
Is the $3\text{variable}$ function $f= \Sigma(0,1,2,4)$ its selfdual? Justify your answer. Give a minimal productofsum form of the $b$ output of the following $\text{excess3}$ to $\text{BCD}$ converter.
asked
Sep 15, 2014
in
Digital Logic
by
Kathleen
Veteran
(
52.1k
points)

1.1k
views
gate2001
digitallogic
normal
descriptive
minsumofproductsform
+14
votes
2
answers
18
GATE20019
A CPU has $32bit$ memory address and a $256 \ KB$ cache memory. The cache is organized as a $4way$ set associative cache with cache block size of $16$ bytes. What is the number of sets in the cache? What is the size (in bits) of the tag ... bits are required to find the byte offset within a cache block? What is the total amount of extra memory (in bytes) required for the tag bits?
asked
Sep 15, 2014
in
CO and Architecture
by
Kathleen
Veteran
(
52.1k
points)

3.1k
views
gate2001
coandarchitecture
cachememory
normal
descriptive
+27
votes
3
answers
19
GATE20018
Consider a disk with the following specifications: 20 surfaces, 1000 tracks/surface, 16 sectors/track, data density 1 KB/sector, rotation speed 3000 rpm. The operating system initiates the transfer between the disk and the memory sectorwise. Once the head has been ... transfer? What is the maximum percentage of time the CPU is held up for this disk I/O for cyclestealing DMA transfer?
asked
Sep 15, 2014
in
Operating System
by
Kathleen
Veteran
(
52.1k
points)

3.2k
views
gate2001
operatingsystem
disks
normal
descriptive
+18
votes
2
answers
20
GATE20017
Let a decision problem $X$ be defined as follows: $X$: Given a Turing machine $M$ over $\Sigma$ and any word $w \in \Sigma$, does $M$ loop forever on $w$? You may assume that the halting problem of Turing machine is undecidable but partially decidable. Show that $X$ is undecidable Show that $X$ is not even partially decidable
asked
Sep 15, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.1k
points)

1.2k
views
gate2001
theoryofcomputation
decidability
turingmachine
easy
descriptive
+14
votes
2
answers
21
GATE20016
Give a deterministic PDA for the language $L=\{a^ncb^{2n} \mid n \geq 1\}$ over the alphabet $\Sigma = \{a,b,c\}$. Specify the acceptance state.
asked
Sep 15, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.1k
points)

647
views
gate2001
theoryofcomputation
normal
pushdownautomata
+22
votes
2
answers
22
GATE20015
Construct DFA's for the following languages: $L=\left\{w \mid w \in \{a,b\}^*, \text{ w has baab as a substring } \right\}$ $L=\left\{w \mid w \in \{a,b\}^*, \text{ w has an odd number of a's and an odd number of b's } \right\} $
asked
Sep 15, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.1k
points)

1k
views
gate2001
theoryofcomputation
easy
descriptive
finiteautomata
normal
+1
vote
1
answer
23
GATE20014
Consider the function $h: N \times N \rightarrow N$ so that $h(a,b) = (2a +1)2^b  1$, where $N=\{0,1,2,3,\dots\}$ is the set of natural numbers. Prove that the function $h$ is an injection (oneone). Prove that it is also a Surjection (onto)
asked
Sep 15, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
52.1k
points)

380
views
gate2001
functions
settheory&algebra
normal
descriptive
+2
votes
2
answers
24
GATE20013
Prove that powerset $(A \cap B) = \text{powerset}(A) \cap \text{powerset}(B)$ Let $sum(n) = 0 + 1 + 2 + ..... + n$ for all natural numbers n. Give an induction proof to show that the following equation is true for all natural numbers $m$ and $n$: $sum(m+n) = sum(m) + sum(n) + mn$
asked
Sep 15, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
52.1k
points)

467
views
gate2001
settheory&algebra
normal
sets
descriptive
+37
votes
5
answers
25
GATE20012.25
Consider a relation geq which represents "greater than or equal to", that is, $(x,y) \in $ geq only if $y \geq x$. create table geq ( ib integer not null, ub integer not null, primary key ib, foreign key (ub) references geq on delete cascade ); Which of the ... tuple (z,w) with z > x is deleted A tuple (z,w) with w < x is deleted The deletion of (x,y) is prohibited
asked
Sep 15, 2014
in
Databases
by
Kathleen
Veteran
(
52.1k
points)

2.7k
views
gate2001
databases
sql
normal
+21
votes
2
answers
26
GATE20012.24
Which of the rational calculus expression is not safe? $\left\{t \mid \exists u \in R_1\left(t[A] = u[A]\right) \land \neg \exists s \in R_2 \left(t[A] = s[A]\right)\right\}$ ... $\left\{t \mid \exists u \in R_1\left(t[A]=u[A]\right) \land \exists s \in R_2 \left(t[A] = s[A]\right)\right\}$
asked
Sep 15, 2014
in
Databases
by
Kathleen
Veteran
(
52.1k
points)

2.2k
views
gate2001
relationalcalculus
normal
databases
+70
votes
4
answers
27
GATE20012.23
$R(A,B,C,D)$ is a relation. Which of the following does not have a lossless join, dependency preserving $BCNF$ decomposition? $A \rightarrow B, B \rightarrow CD$ $A \rightarrow B, B \rightarrow C, C \rightarrow D$ $ AB \rightarrow C, C \rightarrow AD$ $A \rightarrow BCD$
asked
Sep 15, 2014
in
Databases
by
Kathleen
Veteran
(
52.1k
points)

10.8k
views
gate2001
databases
databasenormalization
normal
+32
votes
3
answers
28
GATE20012.22
Consider Peterson's algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below. repeat flag[i] = true; turn = j; while (P) do noop; Enter critical section, perform actions, then exit critical section Flag[i] = false; Perform other ... = i flag[j] = true and turn = j flag[i] = true and turn = j flag[i] = true and turn = i
asked
Sep 15, 2014
in
Operating System
by
Kathleen
Veteran
(
52.1k
points)

4.2k
views
gate2001
operatingsystem
processsynchronization
normal
+22
votes
3
answers
29
GATE20012.21
Consider a machine with $64$ MB physical memory and a $32$bit virtual address space. If the page size s $4$ KB, what is the approximate size of the page table? $\text{16 MB}$ $\text{8 MB}$ $\text{2 MB}$ $\text{24 MB}$
asked
Sep 15, 2014
in
Operating System
by
Kathleen
Veteran
(
52.1k
points)

8.7k
views
gate2001
operatingsystem
virtualmemory
normal
+39
votes
4
answers
30
GATE20012.20
Which of the following does not interrupt a running process? A device Timer Scheduler process Power failure
asked
Sep 15, 2014
in
Operating System
by
Kathleen
Veteran
(
52.1k
points)

4.7k
views
gate2001
operatingsystem
easy
process
Page:
1
2
3
next »
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
Minimum Number of States in a DFA accepting a binary number divisible by 'n'
GATE 2020 Application Form Opened!
My GATE Preparation Journey
ISI MTECH CS 2019 INTERVIEW EXPERIENCE
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
Follow @csegate
Recent questions tagged gate2001
Recent Blog Comments
Feedback for next edition (if ever there's...
Is go book still available,I want to buy it
will pdfs be uploaded ?
50,092
questions
55,256
answers
190,786
comments
86,054
users