The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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
Recent questions tagged gate1995
0
votes
0
answers
1
GATE199517b
Consider a CRT display that has a text mode display format of $80×25$ characters with a $9×12$ character cell. What is the size of the video buffer RAM for the display to be used in monochrome (1 bit per pixel) graphics mode
asked
Jul 14
in
Computer Peripherals
by
Arjun
Veteran
(
423k
points)

81
views
gate1995
nongate
computerperipherals
descriptive
+5
votes
2
answers
2
GATE199525b
Determine the number of positive integers $(\leq 720)$ which are not divisible by any of $2,3$ or $5.$
asked
Jun 6
in
Set Theory & Algebra
by
Arjun
Veteran
(
423k
points)

286
views
gate1995
settheory&algebra
numericalanswers
sets
+2
votes
1
answer
3
GATE199515b
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
(
104k
points)

320
views
gate1995
digitallogic
kmap
normal
+19
votes
3
answers
4
GATE19956
What is the number of binary trees with $3$ nodes which when traversed in postorder give the sequence $A, B, C ?$ Draw all these binary trees.
asked
Oct 8, 2014
in
DS
by
Kathleen
Veteran
(
52.1k
points)

1.1k
views
gate1995
datastructure
binarytree
normal
+13
votes
3
answers
5
GATE199527
Consider the relation scheme.$\begin{array}{ll} \text{AUTHOR} & \text{(ANAME, INSTITUTION, ACITY, AGE)} \\\hline \text{PUBLISHER} & \text{(PNAME, PCITY)} \\\hline \text{BOOK} & \text{(TITLE, ANAME, PNAME)} \\ \end{array}$ ... book for the publisher 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
(
52.1k
points)

934
views
gate1995
databases
relationalalgebra
normal
+18
votes
5
answers
6
GATE199526
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
(
52.1k
points)

1.6k
views
gate1995
databases
databasenormalization
normal
+10
votes
1
answer
7
GATE199525a
Find the minimum value of $34x+2x^2$.
asked
Oct 8, 2014
in
Calculus
by
Kathleen
Veteran
(
52.1k
points)

769
views
gate1995
calculus
maximaminima
easy
+15
votes
2
answers
8
GATE199524
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
(
52.1k
points)

1.3k
views
gate1995
graphtheory
degreeofgraph
descriptive
+8
votes
2
answers
9
GATE199523
Prove using mathematical induction for $n \geq 5, 2^n > n^2$
asked
Oct 8, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
52.1k
points)

348
views
gate1995
settheory&algebra
proof
mathematicalinduction
descriptive
+9
votes
1
answer
10
GATE199522
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
(
52.1k
points)

1.2k
views
gate1995
algorithms
graphalgorithms
spanningtree
easy
+16
votes
4
answers
11
GATE199521
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
(
52.1k
points)

1.1k
views
gate1995
settheory&algebra
groups
normal
descriptive
proof
+13
votes
1
answer
12
GATE199520
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
(
52.1k
points)

3.4k
views
gate1995
operatingsystem
diskscheduling
normal
+19
votes
1
answer
13
GATE199519
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
(
52.1k
points)

1.3k
views
gate1995
operatingsystem
processsynchronization
normal
+11
votes
2
answers
14
GATE199518
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
(
52.1k
points)

675
views
gate1995
digitallogic
numberrepresentation
normal
+3
votes
1
answer
15
GATE199517a
An asynchronous serial communication controller that uses a startstop 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 stop bit. The transmission rate is $1200$ bits/ ... What is the complete bit stream that is transmitted for the string 0110101'? How many such string can be transmitted per second?
asked
Oct 8, 2014
in
Computer Networks
by
Kathleen
Veteran
(
52.1k
points)

593
views
gate1995
serialcommunication
normal
descriptive
0
votes
0
answers
16
GATE199516
asked
Oct 8, 2014
in
CO and Architecture
by
Kathleen
Veteran
(
52.1k
points)

224
views
gate1995
coandarchitecture
8085
outofsyllabusnow
+8
votes
2
answers
17
GATE199515a
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
(
52.1k
points)

773
views
gate1995
digitallogic
kmap
normal
descriptive
+28
votes
2
answers
18
GATE199514
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
(
52.1k
points)

4.1k
views
gate1995
operatingsystem
disks
normal
+11
votes
3
answers
19
GATE199513
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
(
52.1k
points)

1.1k
views
gate1995
mathematicallogic
propositionallogic
normal
descriptive
+11
votes
2
answers
20
GATE199512
Consider the following sequence of numbers:$92, 37, 52, 12, 11, 25$ Use Bubble sort 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
(
52.1k
points)

661
views
gate1995
algorithms
sorting
easy
+11
votes
2
answers
21
GATE199511
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
(
52.1k
points)

849
views
gate1995
theoryofcomputation
normal
decidability
0
votes
0
answers
22
GATE199510
asked
Oct 8, 2014
in
Non GATE
by
Kathleen
Veteran
(
52.1k
points)

132
views
gate1995
outofsyllabusnow
pascal
+16
votes
1
answer
23
GATE19959
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
(
52.1k
points)

1.4k
views
gate1995
compilerdesign
grammar
normal
+4
votes
1
answer
24
GATE19958
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
(
52.1k
points)

481
views
gate1995
compilerdesign
parsing
normal
+3
votes
3
answers
25
GATE19957
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
(
52.1k
points)

548
views
gate1995
normal
numbertheory
combinedquestion
+18
votes
2
answers
26
GATE19955
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
(
52.1k
points)

2k
views
gate1995
operatingsystem
memorymanagement
normal
+11
votes
3
answers
27
GATE19954
Consider the following Pascal function where $A$ and $B$ are nonzero 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(A1, B) + GET(A1, B1) 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
(
52.1k
points)

799
views
gate1995
algorithms
identifyfunction
normal
+13
votes
3
answers
28
GATE19953
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(AB); W :=AB Z :=A*B end;
asked
Oct 8, 2014
in
Programming
by
Kathleen
Veteran
(
52.1k
points)

976
views
gate1995
programming
identifyfunction
descriptive
+16
votes
1
answer
29
GATE19952.25
A computer system has a $4 \ K$ word cache organized in blocksetassociative 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 and Architecture
by
Kathleen
Veteran
(
52.1k
points)

2.5k
views
gate1995
coandarchitecture
cachememory
normal
+17
votes
4
answers
30
GATE19952.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
(
52.1k
points)

1.6k
views
gate1995
theoryofcomputation
easy
regularlanguages
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
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Minimal Deterministic Finite Automata
To be aware of fake GATE test series
Follow @csegate
Recent questions tagged gate1995
Recent Blog Comments
Sir can you please suggest some way like how can...
I think it's been refactored...
@ankitgupta.1729 options after JEST for...
@ankitgupta.1729 @arjun sir There is no...
@ankitgupta.1729 IISc accepts only...
50,651
questions
56,214
answers
194,170
comments
95,418
users