The Gateway to Computer Science Excellence
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.
Recent questions tagged gate1993
GATE 1993 Computer Science Questions and Solutions
+2
votes
1
answer
1
GATE199324
The following relations are used to store data about students, courses, enrollment of students in courses and teachers of courses. Attributes for primary key in each relation are marked by *'. Students (rollno*, sname, saddr) courses (cno*, cname) ... , prove that it is in 3 NF. If not normalize, the relations so that they are in 3NF (without proving)?
asked
Feb 5
in
Databases
by
jothee
Veteran
(
112k
points)

140
views
gate1993
databases
sql
relationalcalculus
normal
+15
votes
9
answers
2
GATE199363
Multiple choices can be correct. Mark all of them. For the initial state of 000, the function performed by the arrangement of the JK flipflops in figure is: Shift Register Mod 3 Counter Mod 6 Counter Mod 2 Counter None of the above
asked
Sep 20, 2015
in
Digital Logic
by
jothee
Veteran
(
112k
points)

1.8k
views
gate1993
digitallogic
circuitoutput
normal
+5
votes
1
answer
3
GATE1993_6.2
If the state machine described in figure, should have a stable state, the restriction on the inputs given by $a.b=1$ $a+b=1$ $\bar{a} + \bar{b} =0$ $\overline{a.b}=1$ $\overline{a+b} =1$
asked
Sep 20, 2015
in
Digital Logic
by
jothee
Veteran
(
112k
points)

662
views
gate1993
digitallogic
normal
circuitoutput
+15
votes
3
answers
4
GATE1993_28
Let $\left(\{ p,q \},*\right)$ be a semigroup where $p*p=q$. Show that: $p*q=q*p$ and $q*q=q$
asked
Sep 30, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
69k
points)

617
views
gate1993
settheory&algebra
groups
normal
+18
votes
4
answers
5
GATE1993_27
Draw the state transition of a deterministic finite state automaton which accepts all strings from the alphabet $\{a,b\}$, such that no string has $3$ consecutive occurrences of the letter $b$.
asked
Sep 30, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
69k
points)

1.7k
views
gate1993
theoryofcomputation
finiteautomata
easy
+6
votes
2
answers
6
GATE1993_26
A stack is used to pass parameters to procedures in a procedure call. If a procedure $P$ has two parameters as described in procedure definition: procedure P (var x :integer; y: integer); and if $P$ is called by ; $P(a, b)$ State ... and $b$ In the generated code for the body of procedure $P$, how will the addressing of formal parameters $x$ and $y$ differ?
asked
Sep 30, 2014
in
Programming
by
Kathleen
Veteran
(
69k
points)

392
views
gate1993
programming
parameterpassing
normal
+2
votes
0
answers
7
GATE1993_25
A simple Pascal like language has only three statements. assignment statement e.g. x:=expression loop construct e.g. for i:=expression to expression do statement sequencing e.g. begin statement ;…; statement end Write a contextfree grammar (CFG) ... Show the parse tree for the following statements: for j:=2 to 10 do begin x:=expr1; y:=expr2; end
asked
Sep 30, 2014
in
Compiler Design
by
Kathleen
Veteran
(
69k
points)

224
views
gate1993
compilerdesign
parsing
normal
+14
votes
2
answers
8
GATE199323
The following relations are used to store data about students, courses, enrollment of students in courses and teachers of courses. Attributes for primary key in each relation are marked by *'. Students (rollno*, sname, saddr) courses (cno ... of students who got A grade in at least one course taught by teacher names Ramesh for the above relational database.
asked
Sep 30, 2014
in
Databases
by
Kathleen
Veteran
(
69k
points)

552
views
gate1993
databases
sql
relationalcalculus
normal
+12
votes
3
answers
9
GATE199322
Write a concurrent program using $\text{parbeginparend}$ and semaphores to represent the precedence constraints of the statements $S_1$ to $S_6$, as shown in figure below.
asked
Sep 30, 2014
in
Operating System
by
Kathleen
Veteran
(
69k
points)

836
views
gate1993
operatingsystem
processsynchronization
normal
+10
votes
1
answer
10
GATE199321
The following page addresses, in the given sequence, were generated by a program: 1 2 3 4 1 3 5 2 1 5 4 3 2 3 This program is run on a demand paged virtual memory system, with main memory size equal to 4 ... page references for which page faults occur for the following page replacement algorithms. LRU FIFO Assume that the main memory is initially empty
asked
Sep 30, 2014
in
Operating System
by
Kathleen
Veteran
(
69k
points)

443
views
gate1993
operatingsystem
pagereplacement
normal
0
votes
0
answers
11
GATE1993_20
asked
Sep 30, 2014
in
CO & Architecture
by
Kathleen
Veteran
(
69k
points)

153
views
gate1993
coandarchitecture
8085
outofsyllabusnow
+6
votes
1
answer
12
GATE199319
A control algorithm is implemented by the NAND – gate circuitry given in figure below, where $A$ and $B$ are state variable implemented by $D$ flipflops, and $P$ is control input. Develop the state transition table for this controller.
asked
Sep 30, 2014
in
Digital Logic
by
Kathleen
Veteran
(
69k
points)

499
views
gate1993
digitallogic
circuitoutput
normal
descriptive
+5
votes
3
answers
13
GATE1993_18
Show that proposition $C$ is a logical consequence of the formula $$A\wedge \left(A \to \left(B \vee C\right)\right) \wedge \left( B \to \neg A\right)$$ using truth tables.
asked
Sep 30, 2014
in
Mathematical Logic
by
Kathleen
Veteran
(
69k
points)

482
views
gate1993
mathematicallogic
normal
propositionallogic
+11
votes
3
answers
14
GATE1993_17
Out of a group of 21 persons, 9 eat vegetables, 10 eat fish and 7 eat eggs. 5 persons eat all three. How many persons eat at least two out of the three dishes?
asked
Sep 30, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
69k
points)

880
views
gate1993
settheory&algebra
easy
sets
+11
votes
2
answers
15
GATE1993_16
Prove by the principal of mathematical induction that for any binary tree, in which every nonleaf node has $2$descendants, the number of leaves in the tree is one more than the number of nonleaf nodes.
asked
Sep 30, 2014
in
DS
by
Kathleen
Veteran
(
69k
points)

325
views
gate1993
datastructure
binarytree
normal
+8
votes
1
answer
16
GATE1993_15
Consider the recursive algorithm given below: procedure bubblesort (n); var i,j: index; temp : item; begin for i:=1 to n1 do if A[i] > A[i+1] then begin temp := A[i]; A[i] := A[i+1]; A[i+1] := temp; end; ... gets executed when the algorithm is run with value $n$. Set up the recurrence relation by defining $a_n$ in terms of $a_{n1}$. Solve for $a_n$.
asked
Sep 30, 2014
in
Algorithms
by
Kathleen
Veteran
(
69k
points)

324
views
gate1993
algorithms
recurrence
normal
+17
votes
3
answers
17
GATE199314
An $\text{ISAM}$ (indexed sequential) file consists of records of size $64$ $bytes$ each, including key field of size $14$ $bytes$. An address of a disk block takes $2$ $bytes$. If the disk block size is $512$ $bytes$ and there are $16$ $K$ ... data and index areas in terms of number blocks. How many levels of $\text{tree}$ do you have for the index?
asked
Sep 30, 2014
in
Databases
by
Kathleen
Veteran
(
69k
points)

765
views
gate1993
databases
indexing
normal
+7
votes
2
answers
18
GATE1993_13
Consider a singly linked list having $n$ nodes. The data items $d_1, d_2, \dots d_n$ are stored in these $n$ nodes. Let $X$ be a pointer to the $j^{th}$ node $(1 \leq j \leq n)$ in which $d_j$ is stored. A new data item $d$ stored in ... $d$ into the list to obtain a list having items $d_1, d_2, \dots, d_{j}, d,\dots, d_n$ in order without using the header.
asked
Sep 30, 2014
in
DS
by
Kathleen
Veteran
(
69k
points)

437
views
gate1993
datastructure
linkedlists
normal
+6
votes
2
answers
19
GATE199312
The following Pascal program segments finds the largest number in a twodimensional integer array $A[0\dots n1, 0\dots n1]$ using a single loop. Fill up the boxes to complete the program and write against $\fbox{A}, \fbox{B}, \fbox{C} \text{ and } \fbox{D}$ in your ... i, j]>max then max:=A[i, j]; if C then j:=j+1; else begin j:=0; i:=D end end end
asked
Sep 30, 2014
in
DS
by
Kathleen
Veteran
(
69k
points)

538
views
gate1993
datastructure
arrays
normal
+19
votes
5
answers
20
GATE199311
In the threelevel memory hierarchy shown in the following table, $p_i$ denotes the probability that an access request will refer to $M_i$. Hierarchy Level $(M_i)$ Access Time $(t_i)$ Probability of access $(p_i)$ Page Transfer Time $( ... page swap is $T_i$. Calculate the average time $t_A$ required for a processor to read one word from this memory system.
asked
Sep 30, 2014
in
CO & Architecture
by
Kathleen
Veteran
(
69k
points)

1.3k
views
gate1993
coandarchitecture
cachememory
normal
+11
votes
2
answers
21
GATE1993_10
The instruction format of a CPU is: OP CODE MODE RegR _____one memory word___ Mode and RegR together specify the operand. RegR specifies a CPU register and Mode specifies an addressing mode. In particular, Mode = 2 specifies that & ... operand? Assuming that is a nonjump instruction, what are the contents of PC after the execution of this instruction?
asked
Sep 30, 2014
in
CO & Architecture
by
Kathleen
Veteran
(
69k
points)

876
views
gate1993
coandarchitecture
addressingmodes
normal
+6
votes
1
answer
22
GATE19939
Assume that only half adders are available in your laboratory. Show that any binary function can be implemented using half adders only.
asked
Sep 30, 2014
in
Digital Logic
by
Kathleen
Veteran
(
69k
points)

287
views
gate1993
digitallogic
halfadder
+17
votes
3
answers
23
GATE1993_8.7
$\displaystyle \sum_{1\leq k\leq n} O(n)$, where $O(n)$ stands for order $n$ is: $O(n)$ $O(n^2)$ $O(n^3)$ $O(3n^2)$ $O(1.5n^2)$
asked
Sep 30, 2014
in
Algorithms
by
Kathleen
Veteran
(
69k
points)

671
views
gate1993
algorithms
timecomplexity
easy
+9
votes
3
answers
24
GATE1993_8.6
Let $A$ and $B$ be sets with cardinalities $m$ and $n$ respectively. The number of oneone mappings from $A$ to $B$, when $m < n$, is $m^n$ $^nP_m$ $^mC_n$ $^nC_m$ $^mP_n$
asked
Sep 30, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
69k
points)

466
views
gate1993
settheory&algebra
functions
easy
+10
votes
3
answers
25
GATE1993_8.5
The lessthan relation, <, on reals is a partial ordering since it is asymmetric and reflexive a partial ordering since it is antisymmetric and reflexive not a partial ordering because it is not asymmetric and not reflexive not a partial ordering because it is not antisymmetric and reflexive none of the above
asked
Sep 30, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
69k
points)

672
views
gate1993
settheory&algebra
partialorder
easy
+11
votes
2
answers
26
GATE1993_8.4
Let A be a finite set of size n. The number of elements in the power set of $A\times A$ is: $2^{2^n}$ $2^{n^2}$ $(2^n)^2$ $(2^2)^n$ None of the above
asked
Sep 30, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
69k
points)

696
views
gate1993
settheory&algebra
easy
sets
+13
votes
3
answers
27
GATE19938.3
Let $S$ be an infinite set and $S_1 \dots , S_n$ be sets such that $S_1 \cup S_2 \cup \dots \cup S_n = S$. Then at least one of the set $S_i$ is a finite set not more than one of the set $S_i$ can be finite at least one of the sets $S_i$ is an infinite not more than one of the sets $S_i$ can be infinite None of the above
asked
Sep 30, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
69k
points)

732
views
gate1993
settheory&algebra
normal
sets
+11
votes
4
answers
28
GATE1993_8.2
The proposition $p \wedge (\sim p \vee q)$ is: a tautology logically equivalent to $p \wedge q$ logically equivalent to $p \vee q$ a contradiction none of the above
asked
Sep 30, 2014
in
Mathematical Logic
by
Kathleen
Veteran
(
69k
points)

555
views
gate1993
mathematicallogic
easy
propositionallogic
+11
votes
2
answers
29
GATE1993_8.1
Consider a simple connected graph $G$ with $n$ vertices and $n$ edges $(n > 2)$. Then, which of the following statements are true? $G$ has no cycles The graph obtained by removing any edge from $G$ is not connected $G$ has at least one cycle The graph obtained by removing any two edges from $G$ is not connected None of the above
asked
Sep 30, 2014
in
Graph Theory
by
Kathleen
Veteran
(
69k
points)

961
views
gate1993
graphtheory
graphconnectivity
easy
+12
votes
3
answers
30
GATE19937.10
Assume that the following jobs are to be executed on a single processor system Job Id CPU Burst Time p 4 q 1 r 8 s 1 t 2 The jobs are assumed to have arrived at time $0^+$ and in the order $p,q,r,s,t$. Calculate the departure time (completion time) for job $p$ if scheduling is round robin with time slice $1$ 4 10 11 12 None of the above
asked
Sep 30, 2014
in
Operating System
by
Kathleen
Veteran
(
69k
points)

994
views
gate1993
operatingsystem
processschedule
normal
Page:
1
2
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
Applying to NUS
THANK U GO !!
need advice
A journey with GO from Air: 2494 to Air: 223
Thanks to GATE Overflow.
Follow @csegate
Gatecse
Recent questions tagged gate1993
Recent Blog Comments
Congrats Bro :D
Thank You @gauravkc, @hacker16, @Sukannya ...
Congratulations Brother :) You've made it! ECE to ...
I am also thinking of applying to the same ...
34,215
questions
40,896
answers
116,103
comments
39,804
users