The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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 gate1995
+2
votes
1
answer
1
GATE1995-15-b
What is the equivalent minimal Boolean expression (in sum of products form) for the Karnaugh map given below?
asked
Feb 12, 2018
in
Digital Logic
by
jothee
Veteran
(
115k
points)
|
211
views
gate1995
digital-logic
k-map
normal
+17
votes
3
answers
2
GATE1995-6
What is the number of binary trees with $3$ nodes which when traversed in post-order give the sequence $A, B, C ?$ Draw all these binary trees.
asked
Oct 8, 2014
in
DS
by
Kathleen
Veteran
(
59.9k
points)
|
935
views
gate1995
data-structure
binary-tree
normal
+13
votes
3
answers
3
GATE1995-27
Consider the relation scheme. AUTHOR (ANAME, INSTITUTION, ACITY, AGE) PUBLISHER (PNAME, PCITY) BOOK (TITLE, ANAME, PNAME) Express the following queries using (one or more of) SELECT, PROJECT, JOIN and DIVIDE operations. Get the names of all publishers ... with PNAME='TECHNICAL PUBLISHERS'. Get the names of all authors who have published a book for any publisher located in Madras
asked
Oct 8, 2014
in
Databases
by
Kathleen
Veteran
(
59.9k
points)
|
798
views
gate1995
databases
relational-algebra
normal
+17
votes
5
answers
4
GATE1995-26
Consider the relation scheme $R(A, B, C)$ with the following functional dependencies: $A, B → C,$ $C → A$ Show that the scheme R is in $3NF$ but not in $\text{BCNF}$. Determine the minimal keys of relation $R$.
asked
Oct 8, 2014
in
Databases
by
Kathleen
Veteran
(
59.9k
points)
|
1.4k
views
gate1995
databases
database-normalization
normal
+10
votes
1
answer
5
GATE1995-25
Find the minimum value of $3-4x+2x^2$. Determine the number of positive integers $(< 720)$ which are not divisible by any of $2, 3$ or $5.$
asked
Oct 8, 2014
in
Calculus
by
Kathleen
Veteran
(
59.9k
points)
|
663
views
gate1995
calculus
normal
maxima-minima
combined-question
+14
votes
2
answers
6
GATE1995-24
Prove that in finite graph, the number of vertices of odd degree is always even.
asked
Oct 8, 2014
in
Graph Theory
by
Kathleen
Veteran
(
59.9k
points)
|
1.1k
views
gate1995
graph-theory
degree-of-graph
descriptive
+8
votes
2
answers
7
GATE1995-23
Prove using mathematical induction for $n \geq 5, 2^n > n^2$
asked
Oct 8, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
59.9k
points)
|
305
views
gate1995
set-theory&algebra
proof
mathematical-induction
descriptive
+8
votes
1
answer
8
GATE1995-22
How many minimum spanning trees does the following graph have? Draw them. (Weights are assigned to edges).
asked
Oct 8, 2014
in
Algorithms
by
Kathleen
Veteran
(
59.9k
points)
|
1k
views
gate1995
algorithms
graph-algorithms
spanning-tree
easy
+14
votes
4
answers
9
GATE1995-21
Let $G_1$ and $G_2$ be subgroups of a group $G$. Show that $G_1 \cap G_2$ is also a subgroup of $G$. Is $G_1 \cup G_2$ always a subgroup of $G$?.
asked
Oct 8, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
59.9k
points)
|
933
views
gate1995
set-theory&algebra
groups
normal
descriptive
proof
+13
votes
1
answer
10
GATE1995-20
The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is currently serving a request at track $55$. If the queue of requests kept in FIFO order is $10, 70, 75, 23, 65$ which of the two disk scheduling algorithms FCFS (First Come First Served) and SSTF (Shortest Seek Time First) will require less head movement? Find the head movement for each of the algorithms.
asked
Oct 8, 2014
in
Operating System
by
Kathleen
Veteran
(
59.9k
points)
|
2.4k
views
gate1995
operating-system
disk-scheduling
normal
+16
votes
1
answer
11
GATE1995-19
Consider the following program segment for concurrent processing using semaphore operators $P$ and $V$ for synchronization. Draw the precedence graph for the statements $S_1$ to $S_9$. var a,b,c,d,e,f,g,h,i,j,k : semaphore; begin cobegin begin S1; V(a); V(b) end; begin P(a); S2; V(c); V(d) ... begin P(g); S6; V(i) end; begin P(h); P(i); S8; V(j) end; begin P(j); P(k); S9 end; coend end;
asked
Oct 8, 2014
in
Operating System
by
Kathleen
Veteran
(
59.9k
points)
|
1.1k
views
gate1995
operating-system
process-synchronization
normal
+9
votes
2
answers
12
GATE1995-18
The following is an incomplete Pascal function to convert a given decimal integer (in the range $-8$ to $+7$) into a binary integer in $2's$ complement representation. Determine the expressions $A, B, C$ that complete program. function TWOSCOMP (N:integer):integer; var ... ;0 do begin REM:=N mod 2; BIANRY:=BINARY + B*EXPONENT; EXPONENT:=EXPONENT*10; N:=C end TWOSCOMP:=BINARY end end;
asked
Oct 8, 2014
in
Digital Logic
by
Kathleen
Veteran
(
59.9k
points)
|
581
views
gate1995
digital-logic
number-representation
normal
+3
votes
1
answer
13
GATE1995-17
An asynchronous serial communication controller that uses a start-stop scheme for controlling the serial I/O of a system is programmed for a string of length seven bits, one parity bit (odd parity) and one step bit. The transmission rate is $1200$ bits/second. What is ... What is the size of the video buffer RAM for the display to be used in monochrome ($1$ bit per pixel) graphics mode?
asked
Oct 8, 2014
in
Operating System
by
Kathleen
Veteran
(
59.9k
points)
|
538
views
gate1995
operating-system
io-handling
normal
0
votes
0
answers
14
GATE1995-16
asked
Oct 8, 2014
in
CO & Architecture
by
Kathleen
Veteran
(
59.9k
points)
|
202
views
gate1995
co-and-architecture
8085
out-of-syllabus-now
+8
votes
3
answers
15
GATE1995-15-a
Implement a circuit having the following output expression using an inverter and a nand gate $Z=\overline{A} + \overline{B} +C$
asked
Oct 8, 2014
in
Digital Logic
by
Kathleen
Veteran
(
59.9k
points)
|
642
views
gate1995
digital-logic
k-map
normal
+25
votes
3
answers
16
GATE1995-14
If the overhead for formatting a disk is $96$ bytes for a $4000$ byte sector, Compute the unformatted capacity of the disk for the following parameters: Number of surfaces: $8$ Outer diameter of the disk: $12$ ... $360$ rpm, determine the effective data transfer rate which is defined as the number of bytes transferred per second between disk and memory.
asked
Oct 8, 2014
in
Operating System
by
Kathleen
Veteran
(
59.9k
points)
|
3.5k
views
gate1995
operating-system
disks
normal
+11
votes
3
answers
17
GATE1995-13
Obtain the principal (canonical) conjunctive normal form of the propositional formula $(p \wedge q) \vee (\neg q \wedge r)$ where $\wedge$ is logical and, $\vee$ is inclusive or and $\neg$ is negation.
asked
Oct 8, 2014
in
Mathematical Logic
by
Kathleen
Veteran
(
59.9k
points)
|
914
views
gate1995
mathematical-logic
propositional-logic
normal
descriptive
+11
votes
2
answers
18
GATE1995-12
Consider the following sequence of numbers: $92, 37, 52, 12, 11, 25$ Use bubblesort to arrange the sequence in ascending order. Give the sequence at the end of each of the first five passes.
asked
Oct 8, 2014
in
Algorithms
by
Kathleen
Veteran
(
59.9k
points)
|
558
views
gate1995
algorithms
sorting
easy
+10
votes
2
answers
19
GATE1995-11
Let $L$ be a language over $\Sigma$ i.e., $L\subseteq \Sigma^*$. Suppose $L$ satisfies the two conditions given below. $L$ is in NP and For every $n$, there is exactly one string of length $n$ that belongs to $L$. Let $L^c$ be the complement of $L$ over $\Sigma^*$. Show that $L^c$ is also in NP.
asked
Oct 8, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
59.9k
points)
|
713
views
gate1995
theory-of-computation
normal
decidability
0
votes
0
answers
20
GATE1995-10
asked
Oct 8, 2014
in
Non GATE
by
Kathleen
Veteran
(
59.9k
points)
|
119
views
gate1995
out-of-syllabus-now
pascal
+16
votes
1
answer
21
GATE1995-9
Translate the arithmetic expression $a^*-(b+c)$ into syntax tree. A grammar is said to have cycles if it is the case that $A \Rightarrow^+ A$ Show that no grammar that has cycles can be LL(1).
asked
Oct 8, 2014
in
Compiler Design
by
Kathleen
Veteran
(
59.9k
points)
|
1.2k
views
gate1995
compiler-design
grammar
normal
+3
votes
0
answers
22
GATE1995-8
Construct the LL(1) table for the following grammar. $Expr \rightarrow \_Expr$ $Expr \rightarrow (Expr)$ $Expr \rightarrow Var\; ExprTail$ $ExprTail \rightarrow \_Expr$ $Expr \rightarrow \lambda$ $Var \rightarrow Id\; VarTail$ $VarTail \rightarrow (Expr)$ $VarTail \rightarrow \lambda$ $Goal \rightarrow Expr$
asked
Oct 8, 2014
in
Compiler Design
by
Kathleen
Veteran
(
59.9k
points)
|
341
views
gate1995
compiler-design
parsing
normal
+3
votes
3
answers
23
GATE1995-7
Determine the number of divisors of $600.$ Compute without using power series expansion $\lim_{x \to 0} \frac{\sin x}{x}$
asked
Oct 8, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
59.9k
points)
|
501
views
gate1995
normal
number-theory
combined-question
+15
votes
2
answers
24
GATE1995-5
A computer installation has 1000k of main memory. The jobs arrive and finish in the following sequences. Job 1 requiring 200k arrives Job 2 requiring 350k arrives Job 3 requiring 300k arrives Job 1 finishes Job 4 requiring 120k arrives Job 5 ... 80k arrives Draw the memory allocation table using Best Fit and First Fit algorithms Which algorithm performs better for this sequence?
asked
Oct 8, 2014
in
Operating System
by
Kathleen
Veteran
(
59.9k
points)
|
1.7k
views
gate1995
operating-system
memory-management
normal
+8
votes
3
answers
25
GATE1995-4
Consider the following Pascal function where $A$ and $B$ are non-zero positive integers. What is the value of $GET(3, 2)$? function GET(A,B:integer): integer; begin if B=0 then GET:= 1 else if A < B then GET:= 0 else GET:= GET(A-1, B) + GET(A-1, B-1) end; The Pascal procedure given for ... to N - 1 do for J:=1 to N do begin TMP:= A[I, J]; A[I, J]:= A[J, I]; A[J, I]:= TMP end end;
asked
Oct 8, 2014
in
Algorithms
by
Kathleen
Veteran
(
59.9k
points)
|
677
views
gate1995
algorithms
identify-function
normal
+13
votes
3
answers
26
GATE1995-3
Consider the following high level programming segment. Give the contents of the memory locations for variables $W, X, Y$ and $Z$ after the execution of the program segment. The values of the variables $A$ and $B$ are $5CH$ and $92H$, respectively. Also indicate error conditions if any. var A ... , (each integer is represented by two bytes) begin X :=A+B Y :=abs(A-B); W :=A-B Z :=A*B end;
asked
Oct 8, 2014
in
Programming
by
Kathleen
Veteran
(
59.9k
points)
|
814
views
gate1995
programming
normal
identify-function
+13
votes
1
answer
27
GATE1995-2.25
A computer system has a $4 \ K$ word cache organized in block-set-associative manner with $4$ blocks per set, $64$ words per block. The number of bits in the SET and WORD fields of the main memory address format is: $15, 40$ $6, 4$ $7, 2$ $4, 6$
asked
Oct 8, 2014
in
CO & Architecture
by
Kathleen
Veteran
(
59.9k
points)
|
2.2k
views
gate1995
co-and-architecture
cache-memory
normal
+14
votes
3
answers
28
GATE1995-2.24
Let $\Sigma=\left\{0,1\right\}, L = \Sigma^*$ and $R=\left\{0^n1^n \mid n > 0\right\} $ then the languages $L \cup R$ and $R$ are respectively regular, regular not regular, regular regular, not regular not regular, not regular
asked
Oct 8, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
59.9k
points)
|
1.3k
views
gate1995
theory-of-computation
easy
regular-languages
+23
votes
3
answers
29
GATE1995-2.23
A finite state machine with the following state table has a single input $x$ and a single out $z$. present state next state, $z$ $x=1$ $x=0$ $A$ $D, 0$ $B, 0$ $B$ $B, 1$ $C, 1$ $C$ $B, 0$ $D, 1$ $D$ $B, 1$ $C, 0$ If the initial state is unknown, then the shortest input sequence to reach the final state C is: $01$ $10$ $101$ $110$
asked
Oct 8, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
59.9k
points)
|
2k
views
gate1995
theory-of-computation
finite-automata
normal
+14
votes
2
answers
30
GATE1995-2.22
Which of the following statements is true? As the number of entries in a hash table increases, the number of collisions increases. Recursive programs are efficient The worst case complexity for Quicksort is $O(n^2)$ Binary search using a linear linked list is efficient I and II II and III I and IV I and III
asked
Oct 8, 2014
in
DS
by
Kathleen
Veteran
(
59.9k
points)
|
1.8k
views
gate1995
data-structure
linked-lists
hashing
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
Challenge to GATE keys: Question 26, If you also want to challenge the same, as I did!
How to follow Standard Textbooks?
Gate contest link is now open
Official keys are out now.
JEST 2019 MEMORY BASED QUESTION PAPER
Follow @csegate
Recent questions tagged gate1995
Recent Blog Comments
Given $C$ program is not
@prashant jha 1 😝😝 @mohit kumar55,...
just tell me one thing In gate 2017 cse foo...
47,922
questions
52,324
answers
182,349
comments
67,780
users