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
GATE 1993 Computer Science Questions and Solutions
Recent questions tagged gate1993
11
votes
1
answer
1
GATE CSE 1993 | Question: 24
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 $ \text{*'}.$ ... it is in $\text{3NF}$. If not, normalize the relations so that they are in $\text{3NF}$ (without proving).
go_editor
asked
in
Databases
Feb 5, 2018
by
go_editor
1.8k
views
gate1993
databases
sql
relational-calculus
normal
descriptive
32
votes
9
answers
2
GATE CSE 1993 | Question: 6-3
For the initial state of $000$, the function performed by the arrangement of the $\text{J-K}$ flip-flops in figure is: Shift Register $\text{Mod- 3}$ Counter $\text{Mod- 6}$ Counter $\text{Mod- 2}$ Counter None of the above
go_editor
asked
in
Digital Logic
Sep 20, 2015
by
go_editor
9.9k
views
gate1993
digital-logic
sequential-circuit
flip-flop
digital-counter
circuit-output
multiple-selects
16
votes
2
answers
3
GATE CSE 1993 | Question: 6.2
If the state machine described in figure should have a stable state, the restriction on the inputs is given by $a.b=1$ $a+b=1$ $\bar{a} + \bar{b} =0$ $\overline{a.b}=1$ $\overline{a+b} =1$
go_editor
asked
in
Digital Logic
Sep 20, 2015
by
go_editor
5.9k
views
gate1993
digital-logic
normal
circuit-output
sequential-circuit
26
votes
3
answers
4
GATE CSE 1993 | Question: 28
Let $\left(\{ p,q \},*\right)$ be a semigroup where $p*p=q$. Show that: $p*q=q*p$ and $q*q=q$
Kathleen
asked
in
Set Theory & Algebra
Sep 30, 2014
by
Kathleen
3.3k
views
gate1993
set-theory&algebra
group-theory
normal
descriptive
30
votes
4
answers
5
GATE CSE 1993 | Question: 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$.
Kathleen
asked
in
Theory of Computation
Sep 30, 2014
by
Kathleen
10.0k
views
gate1993
theory-of-computation
finite-automata
easy
descriptive
11
votes
2
answers
6
GATE CSE 1993 | Question: 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 precisely in a ... $b$ In the generated code for the body of procedure $P$, how will the addressing of formal parameters $x$ and $y$ differ?
Kathleen
asked
in
Compiler Design
Sep 30, 2014
by
Kathleen
2.4k
views
gate1993
compiler-design
parameter-passing
runtime-environment
normal
descriptive
7
votes
1
answer
7
GATE CSE 1993 | Question: 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 context-free grammar (CFG) for statements in ... CFG. Show the parse tree for the following statements: for j:=2 to 10 do begin x:=expr1; y:=expr2; end
Kathleen
asked
in
Compiler Design
Sep 30, 2014
by
Kathleen
1.2k
views
gate1993
compiler-design
parsing
normal
descriptive
20
votes
5
answers
8
GATE CSE 1993 | Question: 23
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*, ... name of students who got A grade in at least one course taught by teacher names Ramesh for the above relational database.
Kathleen
asked
in
Databases
Sep 30, 2014
by
Kathleen
2.7k
views
gate1993
databases
sql
relational-calculus
normal
descriptive
25
votes
4
answers
9
GATE CSE 1993 | Question: 22
Write a concurrent program using $\text{parbegin-parend}$ and semaphores to represent the precedence constraints of the statements $S_1$ to $S_6$, as shown in figure below.
Kathleen
asked
in
Operating System
Sep 30, 2014
by
Kathleen
4.5k
views
gate1993
operating-system
process-synchronization
normal
descriptive
14
votes
2
answers
10
GATE CSE 1993 | Question: 21
The following page addresses, in the given sequence, were generated by a program: $\text{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$ ... the page references for which page faults occur for the following page replacement algorithms. LRU FIFO Assume that the main memory is initially empty.
Kathleen
asked
in
Operating System
Sep 30, 2014
by
Kathleen
4.9k
views
gate1993
operating-system
page-replacement
normal
descriptive
0
votes
0
answers
11
GATE CSE 1993 | Question: 20
Kathleen
asked
in
CO and Architecture
Sep 30, 2014
by
Kathleen
470
views
gate1993
co-and-architecture
8085-microprocessor
out-of-gate-syllabus
19
votes
1
answer
12
GATE CSE 1993 | Question: 19
A control algorithm is implemented by the NAND – gate circuitry given in figure below, where $A$ and $B$ are state variable implemented by $D$ flip-flops, and $P$ is control input. Develop the state transition table for this controller.
Kathleen
asked
in
Digital Logic
Sep 30, 2014
by
Kathleen
2.4k
views
gate1993
digital-logic
sequential-circuit
flip-flop
circuit-output
normal
descriptive
14
votes
3
answers
13
GATE CSE 1993 | Question: 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.
Kathleen
asked
in
Mathematical Logic
Sep 30, 2014
by
Kathleen
2.3k
views
gate1993
mathematical-logic
normal
propositional-logic
proof
descriptive
35
votes
4
answers
14
GATE CSE 1993 | Question: 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?
Kathleen
asked
in
Set Theory & Algebra
Sep 30, 2014
by
Kathleen
6.0k
views
gate1993
set-theory&algebra
easy
set-theory
descriptive
19
votes
2
answers
15
GATE CSE 1993 | Question: 16
Prove by the principal of mathematical induction that for any binary tree, in which every non-leaf node has $2$-descendants, the number of leaves in the tree is one more than the number of non-leaf nodes.
Kathleen
asked
in
DS
Sep 30, 2014
by
Kathleen
2.2k
views
gate1993
data-structures
binary-tree
normal
descriptive
15
votes
1
answer
16
GATE CSE 1993 | Question: 15
Consider the recursive algorithm given below: procedure bubblesort (n); var i,j: index; temp : item; begin for i:=1 to n-1 do if A[i] > A[i+1] then begin temp := A[i]; A[i] := A[i+1]; A[i+1] := temp; end; bubblesort (n-1) ... executed when the algorithm is run with value $n$. Set up the recurrence relation by defining $a_n$ in terms of $a_{n-1}$. Solve for $a_n$.
Kathleen
asked
in
Algorithms
Sep 30, 2014
by
Kathleen
2.1k
views
gate1993
algorithms
recurrence-relation
normal
descriptive
35
votes
3
answers
17
GATE CSE 1993 | Question: 14
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 $16K$ records, compute the size of the data and index areas in terms of number blocks. How many levels of $\text{tree}$ do you have for the index?
Kathleen
asked
in
Databases
Sep 30, 2014
by
Kathleen
5.3k
views
gate1993
databases
indexing
normal
descriptive
11
votes
3
answers
18
GATE CSE 1993 | Question: 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^{\text{th}}$ node $(1 \leq j \leq n)$ in which $d_j$ is stored. A new data item $d$ stored ... insert $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.
Kathleen
asked
in
DS
Sep 30, 2014
by
Kathleen
2.8k
views
gate1993
data-structures
linked-list
normal
descriptive
23
votes
2
answers
19
GATE CSE 1993 | Question: 12
The following Pascal program segments finds the largest number in a two-dimensional integer array $A[0\dots n-1, 0\dots n-1]$ 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 answer ... A[i, j]>max then max:=A[i, j]; if |C| then j:=j+1; else begin j:=0; i:=|D| end end end
Kathleen
asked
in
DS
Sep 30, 2014
by
Kathleen
3.7k
views
gate1993
data-structures
array
normal
descriptive
47
votes
6
answers
20
GATE CSE 1993 | Question: 11
In the three-level memory hierarchy shown in the following table, $p_i$ denotes the probability that an access request will refer to $M_i$ ... a page swap is $T_i$. Calculate the average time $t_A$ required for a processor to read one word from this memory system.
Kathleen
asked
in
CO and Architecture
Sep 30, 2014
by
Kathleen
8.3k
views
gate1993
co-and-architecture
cache-memory
normal
descriptive
30
votes
2
answers
21
GATE CSE 1993 | Question: 10
The instruction format of a CPU is: $\text{Mode}$ and $\text{RegR}$ together specify the operand. $\text{RegR}$ specifies a CPU register and $\text{Mode}$ specifies an addressing mode. In particular, $\text{Mode}=2$ specifies that ... address of the operand? Assuming that is a non-jump instruction, what are the contents of PC after the execution of this instruction?
Kathleen
asked
in
CO and Architecture
Sep 30, 2014
by
Kathleen
5.4k
views
gate1993
co-and-architecture
addressing-modes
normal
descriptive
16
votes
1
answer
22
GATE CSE 1993 | Question: 9
Assume that only half adders are available in your laboratory. Show that any binary function can be implemented using half adders only.
Kathleen
asked
in
Digital Logic
Sep 30, 2014
by
Kathleen
2.0k
views
gate1993
digital-logic
combinational-circuit
adder
descriptive
39
votes
5
answers
23
GATE CSE 1993 | Question: 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)$
Kathleen
asked
in
Algorithms
Sep 30, 2014
by
Kathleen
10.1k
views
gate1993
algorithms
time-complexity
easy
25
votes
3
answers
24
GATE CSE 1993 | Question: 8.6
Let $A$ and $B$ be sets with cardinalities $m$ and $n$ respectively. The number of one-one mappings from $A$ to $B$, when $m < n$, is $m^n$ $^nP_m$ $^mC_n$ $^nC_m$ $^mP_n$
Kathleen
asked
in
Set Theory & Algebra
Sep 30, 2014
by
Kathleen
3.6k
views
gate1993
set-theory&algebra
functions
easy
18
votes
3
answers
25
GATE CSE 1993 | Question: 8.5
The less-than 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
Kathleen
asked
in
Set Theory & Algebra
Sep 30, 2014
by
Kathleen
7.7k
views
gate1993
set-theory&algebra
partial-order
easy
24
votes
2
answers
26
GATE CSE 1993 | Question: 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}$ $\left(2^n\right)^2$ $\left(2^2\right)^n$ None of the above
Kathleen
asked
in
Set Theory & Algebra
Sep 30, 2014
by
Kathleen
6.0k
views
gate1993
set-theory&algebra
easy
set-theory
29
votes
3
answers
27
GATE CSE 1993 | Question: 8.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 sets $S_i$ is a finite set not more than one of the sets $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
Kathleen
asked
in
Set Theory & Algebra
Sep 30, 2014
by
Kathleen
6.3k
views
gate1993
set-theory&algebra
normal
set-theory
22
votes
3
answers
28
GATE CSE 1993 | Question: 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
Kathleen
asked
in
Mathematical Logic
Sep 30, 2014
by
Kathleen
7.1k
views
gate1993
mathematical-logic
easy
propositional-logic
25
votes
2
answers
29
GATE CSE 1993 | Question: 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
Kathleen
asked
in
Graph Theory
Sep 30, 2014
by
Kathleen
8.0k
views
gate1993
graph-theory
graph-connectivity
easy
multiple-selects
25
votes
3
answers
30
GATE CSE 1993 | Question: 7.10
Assume that the following jobs are to be executed on a single processor system ... time (completion time) for job $p$ if scheduling is round robin with time slice $1$ $4$ $10$ $11$ $12$ None of the above
Kathleen
asked
in
Operating System
Sep 30, 2014
by
Kathleen
10.9k
views
gate1993
operating-system
process-scheduling
normal
Page:
1
2
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
My journey from being a MSc student to AIR 239 in GATE CSE 2023 and qualified UGC-NET JRF.
NEEPCO Recruitment 2023
GATE CSE 2023 Results
IIIT Banglore MTech 2023-24
IIIT-Delhi MTech 2023-24
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.5k)
Admissions
(653)
Exam Queries
(844)
Tier 1 Placement Questions
(17)
Job Queries
(76)
Projects
(9)
Unknown Category
(866)
Recent questions tagged gate1993
Recent Blog Comments
congrats pranab
Congratulations @Pranab Paul 10 🥳
sir give access to these tests at least mid May...
Was there interview for mtech as well?
Check CCMT website for previous year cutoff for...