GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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.
Questions by Kathleen
User Kathleen
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Kathleen
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+7
votes
2
answers
1
GATE1996_27
A library relational database system uses the following schema USERS (User#, User Name, Home Town) BOOKS (Book#, Book Title, Author Name) ISSUED (Book#, User#, Date) Explain in one English sentence, what each of the following relational algebra queries ... BOOKS} \bowtie \sigma_{\text{Home Town=Delhi}} \left(\text{USERS} \bowtie \text{ISSUED}\right)\right)$
asked
Oct 10, 2014
in
Databases

396
views
gate1996
databases
relationalalgebra
normal
+2
votes
1
answer
2
GATE1996_26
A computer system has a three level memory hierarchy, with access time and hit ratios as shown below: Level 1 (Cache memory) Access time = 50 nsec/byte Size Hit Ratio 8 M byte 0.80 16 M byte 0.90 64 M byte 0.95 Level 2 (main ... access time of less than 100 nsec What is the average access time achieved using the chosen sizes of level 1 and level 2 memories?
asked
Oct 10, 2014
in
CO & Architecture

772
views
gate1996
co&architecture
cachememory
normal
+2
votes
4
answers
3
GATE1996_25
A hard disk is connected to a 50 MHz processor through a DMA controller. Assume that the initial setup of a DMA transfer takes 1000 clock cycles for the processor, and assume that the handling of the interrupt at DMA completion requires ... What fraction of the processor time is consumed by the disk, if the disk is actively transferring 100% of the time?
asked
Oct 10, 2014
in
CO & Architecture

929
views
gate1996
co&architecture
iohandling
dma
normal
+2
votes
2
answers
4
GATE1996_24
Consider the synchronous sequential circuit in the below figure Draw a state diagram, which is implemented by the circuit. Use the following names for the states corresponding to the values of flipflops as given below. Q1 Q2 Q3 State 0 0 0 ... 1 S$_7$ Given that the initial state of the circuit is S$_4$, identify the set of states, which are not reachable.
asked
Oct 10, 2014
in
Digital Logic

475
views
gate1996
digitallogic
circuitoutput
normal
+6
votes
2
answers
5
GATE1996_23
A file system with a onelevel directory structure is implemented on a disk with disk block size of $4K$ bytes. The disk is used as follows: Diskblock 0 File Allocation Table, consisting of one 8bit entry per data block, representing the ... 3 Datablock 2; etc. What is the maximum possible number of files? What is the maximum possible file size in blocks
asked
Oct 10, 2014
in
Operating System

899
views
gate1996
operatingsystem
disk
normal
filesystem
+5
votes
4
answers
6
GATE1996_22
A computer system uses the Banker’s Algorithm to deal with deadlocks. Its current state is shown in the table below, where P0, P1, P2 are processes, and R0, R1, R2 are resources types. Maximum Need Current Allocation Available R0 R1 R2 R0 ... can be in this state What will the system do on a request by process P0 for one unit of resource type R1?
asked
Oct 10, 2014
in
Operating System

455
views
gate1996
operatingsystem
resourceallocation
normal
+6
votes
1
answer
7
GATE1996_21
The concurrent programming constructs fork and join are as below: fork <label> which creates a new process executing from the specified label join <variable> which decrements the specified synchronization variable (by 1) and terminates the process if ... not 0. Show the precedence graph for S1, S2, S3, S4, and S5 of the concurrent program below.
asked
Oct 10, 2014
in
Operating System

630
views
gate1996
operatingsystem
processsynchronization
normal
+3
votes
2
answers
8
GATE1996_20
Consider the syntaxdirected translation schema (SDTS) shown below: $E\rightarrow E + E$ {print “+”} $E\rightarrow E * E$ {print “.”} $E\rightarrow id$ {print id.name} $E\rightarrow (E)$ An LRparser ... production. Draw the parse tree and write the translation for the sentence. $(a+b)*(c+d)$, using SDTS given above.
asked
Oct 10, 2014
in
Compiler Design

289
views
gate1996
compilerdesign
syntaxdirectedtranslation
normal
+2
votes
1
answer
9
GATE1996_19
Consider the following program in pseudoPascal syntax. What is printed by the program if parameter $a$ in procedure test1 is passed as callbyreference parameter callbyvalueresult parameter program Example (input, output) var b: integer; procedure test2: begin b:=10; end ... 2: ', a, b); end begin (*Example*) b:=3; test1(b); writeln('point3: ', b); end
asked
Oct 10, 2014
in
Programming

151
views
gate1996
programming
parameterpassing
normal
outofsyllabusnow
+4
votes
2
answers
10
GATE199618
Consider the following program that attempts to locate an element $x$ in an array $a[ ]$ using binary search. Assume $N > 1$. The program is erroneous. Under what conditions does the program fail? var i,j,k: integer; x: integer; a: array; [1..N] of integer ... if (a[k] = x) then writeln ('x is not in the array') else writeln ('x is not in the array') end;
asked
Oct 10, 2014
in
Algorithms

305
views
gate1996
algorithms
binarysearch
normal
+2
votes
2
answers
11
GATE1996_17
Let $G$ be the directed, weighted graph shown in below figure We are interested in the shortest paths from $A$. Output the sequence of vertices identified by the Dijkstra’s algorithm for single source shortest path when the algorithm is started ... vertices in the shortest path from $A$ to $E$ What is the cost of the shortest path from $A$ to $E$?
asked
Oct 10, 2014
in
Algorithms

384
views
gate1996
algorithms
graphalgorithms
shortestpath
normal
+3
votes
1
answer
12
GATE1996_16
A complete, undirected, weighted graph $G$ is given on the vertex $\{0, 1,\dots, n 1\}$ for any fixed ‘n’. Draw the minimum spanning tree of $G$ if the weight of the edge $(u, v)$ is $\mid uv\mid$ the weight of the edge $(u, v)$ is $u + v$
asked
Oct 10, 2014
in
Algorithms

236
views
gate1996
algorithms
graphalgorithms
spanningtree
normal
+3
votes
2
answers
13
GATE1996_15
Insert the characters of the string K R P C S N Y T J M into a hash table of size 10. Use the hash function $$h(x)=( ord (x) – ord ("a") + 1) \mod 10$$ and linear probing to resolve collisions. Which insertions cause collisions? Display the final hash table.
asked
Oct 10, 2014
in
DS

300
views
gate1996
datastructure
hashing
normal
+2
votes
1
answer
14
GATE1996_14
A two dimensional array $A[1..n][1..n]$ of integers is partially sorted if $\forall i, j\in [1..n1], A[i][j] < A[i][j+1] \text{ and } A[i][j] < A[i+1][j]$ Fill in the blanks: The smallest item in the array is at $A[i][j]$ where $i=__$ and $j= ... A[i+1][j] < A[i][j] then begin A[i][j]:=A[i+1][j]; i:=i+1; end else begin _____ end A[i][j]:= ____ end
asked
Oct 10, 2014
in
Algorithms

231
views
gate1996
algorithms
sorting
normal
+3
votes
1
answer
15
GATE1996_13
Let $Q=\left( \left\{q_1,q_2 \right\}, \left\{a,b\right \}, \left\{a,b,\bot \right\}, \delta, \bot, \phi \right)$ be a pushdown automaton accepting by empty stack for the language which is the set of all nonempty even palindromes over the set $\ ... delta(q_2,b,b) = \left\{(q_2, \epsilon)\right\}$ $\delta(q_2,\epsilon,\bot) = \left\{(q_2, \epsilon)\right\}$
asked
Oct 10, 2014
in
Theory of Computation

248
views
gate1996
theoryofcomputation
pda
normal
+4
votes
1
answer
16
GATE1996_12
Given below are the transition diagrams for two finite state machines $M_1$ and $M_2$ recognizing languages $L_1$ and $L_2$ respectively. Display the transition diagram for a machine that recognizes $L_1.L_2$, obtained from transition diagrams for ... by adding only $\varepsilon$ transitions and no new states. (Final states are enclosed in double circles).
asked
Oct 10, 2014
in
Theory of Computation

253
views
gate1996
theoryofcomputation
finiteautomata
normal
+5
votes
5
answers
17
GATE1996_11
Let $G$ be a contextfree grammar where $G=(\{S, A, B, C\}, \{a, b, d\}, P, S)$ with the productions in $P$ given below. $S \rightarrow ABAC$ $A \rightarrow aA \mid \varepsilon$ $B \rightarrow bB \mid \varepsilon$ $C ... \varepsilon$ productions and no unit productions. (A unit production is of the form $x \rightarrow y$, and $x$ and $y$ are non terminals).
asked
Oct 10, 2014
in
Compiler Design

407
views
gate1996
compilerdesign
grammar
normal
+1
vote
3
answers
18
GATE1996_10
Let $A = \begin{bmatrix} a_{11} && a_{12} \\ a_{21} && a_{22} \end{bmatrix} \text { and } B = \begin{bmatrix} b_{11} && b_{12} \\ b_{21} && b_{22} \end{bmatrix}$ be two matrices such that $AB=I$. ... } 1 && 0 \\ 1 && 1 \end{bmatrix}$ and $CD =I$. Express the elements of $D$ in terms of the elements of $B$.
asked
Oct 10, 2014
in
Linear Algebra

219
views
gate1996
linearalgebra
matrices
normal
+1
vote
0
answers
19
GATE1996_9
The Fibonacci sequence $\{f_1, f_2, f_3 \dots f_n\}$ is defined by the following recurrence: $$f_{n+2} = f_{n+1} + f_n, n \geq 1; f_2 =1:f_1=1$$ Prove by induction that every third element of the sequence is even.
asked
Oct 10, 2014
in
Set Theory & Algebra

97
views
gate1996
settheory&algebra
recurrence
proof
+5
votes
2
answers
20
GATE1996_8
Let $F$ be the collection of all functions $f: \{1, 2, 3\} \to \{1, 2, 3\}$. If $f$ and $g \in F$, define an equivalence relation $\sim$ by $f\sim g$ if and only if $f(3) = g(3)$. Find the number of equivalence classes defined by $\sim$. Find the number of elements in each equivalence class.
asked
Oct 10, 2014
in
Set Theory & Algebra

331
views
gate1996
settheory&algebra
relations
functions
normal
+4
votes
1
answer
21
GATE1996_7
A demand paged virtual memory system uses 16 bit virtual address, page size of 256 bytes, and has 1 Kbyte of main memory. LRU page replacement is implemented using list, whose current status (page number is decimal) is For each hexadecimal address in ... , 010D, 10FF, 11B0 indicate the new status of the list page faults, if any, and page replacements, if any.
asked
Oct 10, 2014
in
Operating System

595
views
gate1996
operatingsystem
virtualmemory
normal
0
votes
1
answer
22
GATE1996_6
An 8052 based system has an output port with address 00H. Consider the following assembly language program. ORG 0100H MVI A, 00H LXI H, 0105H OUT 00H INR A PCHL HLT What does the program do with respect to the output port $00H$ ? Show the waveforms at the three least significant bits of the port $00H$.
asked
Oct 9, 2014
in
CO & Architecture

140
views
gate1996
co&architecture
8085
outofsyllabusnow
+1
vote
2
answers
23
GATE1996_5
A logic network has two data inputs $A$ and $B$, and two control inputs $C_0$ and $C_1$. It implements the function $F$ according to the following table. $C_1$ $C_2$ $F$ 0 0 $\overline{A+B}$ 0 1 $A + B$ 1 0 $A \oplus B$ Implement the circuit ... one 4 to 1 Multiplexer, one 2input Exclusive OR gate, one 2input AND gate, one 2input OR gate and one Inverter.
asked
Oct 9, 2014
in
Digital Logic

323
views
gate1996
digitallogic
normal
+7
votes
2
answers
24
GATE1996_4
A binary search tree is used to locate the number 43. Which of the following probe sequences are possible and which are not? Explain. (a) 61 52 14 17 40 43 (b) 2 3 50 40 60 43 (c) 10 65 31 48 37 43 (d) 81 61 52 14 41 43 (e) 17 77 27 66 18 43
asked
Oct 9, 2014
in
DS

984
views
gate1996
datastructure
binarytree
normal
+6
votes
1
answer
25
GATE1996_3
Let $f$ be a function defined by $$f(x) = \begin{cases} x^2 &\text{ for }x \leq 1\\ ax^2+bx+c &\text{ for } 1 < x \leq 2 \\ x+d &\text{ for } x>2 \end{cases}$$ Find the values for the constants $a$, $b$, $c$ and $d$ so that $f$ is continuous and differentiable everywhere on the real line.
asked
Oct 9, 2014
in
Calculus

331
views
gate1996
calculus
continuity
differentiability
normal
+3
votes
2
answers
26
GATE1996_2.25
A micro program control unit is required to generate a total of 25 control signals. Assume that during any microinstruction, at most two control signals are active. Minimum number of bits required in the control word to generate the required control signals will be 2 2.5 10 12
asked
Oct 9, 2014
in
CO & Architecture

1.8k
views
gate1996
co&architecture
microprogramming
normal
+2
votes
3
answers
27
GATE1996_2.24
What is the equivalent Boolean expression in productofsums form for the Karnaugh map given in Fig $B\overline{D} + \overline{B}D$ $(B + \overline{C} +D) (\overline{B} + C + \overline{D})$ $(B + {D})(\overline{B} +\overline{ D})$ $(B + \overline{D})(\overline{B} + {D})$
asked
Oct 9, 2014
in
Digital Logic

435
views
gate1996
digitallogic
kmap
easy
+6
votes
2
answers
28
GATE1996_2.23
Consider the following state table for a sequential machine. The number of states in the minimized machine will be Input 0 1 Present State A D, 0 B, 1 B A, 0 C, 1 C A, 0 B, 1 D A, 1 C, 1 Next state, Output 4 3 2 1
asked
Oct 9, 2014
in
Theory of Computation

556
views
gate1996
theoryofcomputation
minimalstateautomata
normal
+3
votes
1
answer
29
GATE1996_2.22
Consider the circuit in figure. $f$ implements $\overline{A} \overline{B}C + \overline{A}B \overline{C} + ABC$ $A + B + C$ $A \oplus B \oplus C$ $AB + BC + CA$
asked
Oct 9, 2014
in
Digital Logic

528
views
gate1996
digitallogic
circuitoutput
easy
+3
votes
2
answers
30
GATE1996_2.21
Consider the circuit in Fig.2.21 which has a four bit binary number $b_3b_2b_1b_0$ as input and a five bit binary number, $d_4d_3d_2d_1d_0$ as output. Binary to Hex conversion Binary to BCD conversion Binary to grey code conversion Binary to radix12 conversion
asked
Oct 9, 2014
in
Digital Logic

702
views
gate1996
digitallogic
circuitoutput
normal
Page:
1
2
3
4
5
6
...
41
next »
23,355
questions
30,065
answers
67,365
comments
28,382
users