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
Filter
User Kathleen
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Kathleen
35
votes
2
answers
1
GATE CSE 1996 | Question: 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 is ...
asked
in
Databases
Oct 9, 2014
5.3k
views
gate1996
databases
relational-algebra
descriptive
36
votes
5
answers
2
GATE CSE 1996 | Question: 26
A computer system has a three-level memory hierarchy, with access time and hit ratios as shown below: ... of less than $100 nsec$? What is the average access time achieved using the chosen sizes of level $1$ and level $2$ memories?
asked
in
CO and Architecture
Oct 9, 2014
15.1k
views
gate1996
co-and-architecture
cache-memory
normal
33
votes
4
answers
3
GATE CSE 1996 | Question: 25
A hard disk is connected to a $50$ MHz processor through a DMA controller. Assume that the initial set-up of a DMA transfer takes $1000$ clock cycles for the processor, and assume that the handling of the interrupt at DMA completion requires $500$ ... What fraction of the processor time is consumed by the disk, if the disk is actively transferring $100\%$ of the time?
asked
in
CO and Architecture
Oct 9, 2014
10.2k
views
gate1996
co-and-architecture
io-handling
dma
numerical-answers
normal
18
votes
2
answers
4
GATE CSE 1996 | Question: 24-a
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 flip-flops as given below. ... $} \\\hline \end{array}$
asked
in
Digital Logic
Oct 9, 2014
6.4k
views
gate1996
digital-logic
circuit-output
normal
descriptive
38
votes
2
answers
5
GATE CSE 1996 | Question: 23
A file system with a one-level directory structure is implemented on a disk with disk block size of $4K$ ... What is the maximum possible number of files? What is the maximum possible file size in blocks
asked
in
Operating System
Oct 9, 2014
9.8k
views
gate1996
operating-system
disk
normal
file-system
descriptive
22
votes
3
answers
6
GATE CSE 1996 | Question: 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$ ... the system can be in this state What will the system do on a request by process $P0$ for one unit of resource type $R1$?
asked
in
Operating System
Oct 9, 2014
8.9k
views
gate1996
operating-system
resource-allocation
normal
descriptive
34
votes
1
answer
7
GATE CSE 1996 | Question: 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 the new value is not $0$. Show ... $N$ $S3$ $L2$ : join $M$ $S5$ $L3:S2$ Goto $L1$ $L4:S4$ Goto $L2$ Next:
asked
in
Operating System
Oct 9, 2014
6.2k
views
gate1996
operating-system
process-synchronization
normal
descriptive
18
votes
2
answers
8
GATE CSE 1996 | Question: 20
Consider the syntax-directed 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 LR-parser executes the actions associated with ... corresponding production. Draw the parse tree and write the translation for the sentence. $(a+b)*(c+d)$, using SDTS given above.
asked
in
Compiler Design
Oct 9, 2014
3.4k
views
gate1996
compiler-design
syntax-directed-translation
normal
descriptive
3
votes
1
answer
9
GATE CSE 1996 | Question: 19
Consider the following program in pseudo-Pascal syntax. What is printed by the program if parameter $a$ in procedure $\text{test1}$ is passed as call-by-reference parameter call-by-value-result parameter program Example (input, output) var b: integer; procedure test2: begin b ... ', a, b); end begin (*Example*) b:=3; test1(b); writeln('point3: ', b); end
asked
in
Programming in C
Oct 9, 2014
1.5k
views
gate1996
programming
parameter-passing
normal
out-of-syllabus-now
24
votes
2
answers
10
GATE CSE 1996 | Question: 18
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 ... ; if (a[k] = x) then writeln ('x is in the array') else writeln ('x is not in the array') end;
asked
in
Algorithms
Oct 9, 2014
3.5k
views
gate1996
algorithms
searching
normal
descriptive
25
votes
7
answers
11
GATE CSE 1996 | Question: 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 at node $A$ Write down ... vertices in the shortest path from $A$ to $E$ What is the cost of the shortest path from $A$ to $E$?
asked
in
Algorithms
Oct 9, 2014
7.5k
views
gate1996
algorithms
graph-algorithm
normal
dijkstras-algorithm
descriptive
26
votes
1
answer
12
GATE CSE 1996 | Question: 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 u-v\mid$ the weight of the edge $(u, v)$ is $u + v$
asked
in
Algorithms
Oct 9, 2014
5.1k
views
gate1996
algorithms
graph-algorithms
spanning-tree
normal
descriptive
24
votes
4
answers
13
GATE CSE 1996 | Question: 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 (\text{“}a\text{”}) + 1) \mod 10$ and linear probing to resolve collisions. Which insertions cause collisions? Display the final hash table.
asked
in
DS
Oct 9, 2014
6.2k
views
gate1996
data-structures
hashing
normal
descriptive
35
votes
2
answers
14
GATE CSE 1996 | Question: 14
A two dimensional array $A[1..n][1..n]$ of integers is partially sorted if $\forall i, j\in [1..n-1], A[i][j] < A[i][j+1] \text{ and } A[i][j] < A[i+1][j]$ The smallest item in the array is at $A[i][j]$ where $i=\_\_$ and $j=\_\_$. The smallest ... if 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
in
Algorithms
Oct 9, 2014
5.7k
views
gate1996
algorithms
sorting
normal
descriptive
17
votes
2
answers
15
GATE CSE 1996 | Question: 13
Let $Q=\left( \left\{q_1,q_2 \right\}, \left\{a,b\right \}, \left\{a,b,\bot \right\}, \delta, \bot, \phi \right)$ ... $\delta(q_2,b,b) = \left\{(q_2, \epsilon)\right\}$ $\delta(q_2,\epsilon,\bot) = \left\{(q_2, \epsilon)\right\}$
asked
in
Theory of Computation
Oct 9, 2014
5.6k
views
gate1996
theory-of-computation
pushdown-automata
normal
descriptive
40
votes
1
answer
16
GATE CSE 1996 | Question: 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 $M_1$ ... $\varepsilon$ transitions and no new states. (Final states are enclosed in double circles).
asked
in
Theory of Computation
Oct 9, 2014
8.4k
views
gate1996
theory-of-computation
finite-automata
normal
descriptive
34
votes
5
answers
17
GATE CSE 1996 | Question: 11
Let $G$ be a context-free 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$ ... $\varepsilon$ productions and no unit productions. (A unit production is of the form $x \rightarrow y$, and $x$ and $y$ are non terminals).
asked
in
Compiler Design
Oct 9, 2014
7.6k
views
gate1996
compiler-design
grammar
normal
descriptive
14
votes
4
answers
18
GATE CSE 1996 | Question: 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$ ... $CD =I$. Express the elements of $D$ in terms of the elements of $B$.
asked
in
Linear Algebra
Oct 9, 2014
4.0k
views
gate1996
linear-algebra
matrix
normal
descriptive
6
votes
1
answer
19
GATE CSE 1996 | Question: 9
The Fibonacci sequence $\{f_1, f_2, f_3 \ldots 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
in
Combinatory
Oct 9, 2014
1.3k
views
gate1996
recurrence-relation
proof
descriptive
41
votes
5
answers
20
GATE CSE 1996 | Question: 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
in
Set Theory & Algebra
Oct 9, 2014
6.0k
views
gate1996
set-theory&algebra
relations
functions
normal
descriptive
Page:
1
2
3
4
5
6
...
61
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...