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 gate1990
GATE 1990 Computer Science questions
+7
votes
3
answers
1
GATE19901ivb
A 32bit floatingpoint number is represented by a 7bit signed exponent, and a 24bit fractional mantissa. The base of the scale factor is 16, The range of the exponent is ___________, if the scale factor is represented in excess64 format.
asked
Feb 12, 2018
in
Digital Logic
by
jothee
Veteran
(
105k
points)

664
views
gate1990
descriptive
digitallogic
numberrepresentation
floatingpointrepresentation
+10
votes
2
answers
2
GATE19901viii
The condition for overflow in the addition of two $2's$ complement numbers in terms of the carry generated by the two most significant bits is ___________.
asked
Nov 27, 2016
in
Digital Logic
by
makhdoom ghaya
Boss
(
30.2k
points)

1k
views
gate1990
descriptive
digitallogic
numberrepresentation
+1
vote
2
answers
3
GATE199017c
Show that the elements of the lattice $(N, \leq)$, where $N$ is the set of positive intergers and $a \leq b$ if and only if $a$ divides $b$, satisfy the distributive property.
asked
Nov 27, 2016
in
Set Theory & Algebra
by
makhdoom ghaya
Boss
(
30.2k
points)

276
views
gate1990
descriptive
settheory&algebra
lattice
0
votes
0
answers
4
GATE199017b
Show, using resolution, that the following wellformed formula is valid for all interpretations: $\left(\forall x \forall y \left(f \left(x, y \right) \Leftarrow \neg y \left(y, x \right) = \left(\forall x \left(f \left(x, x \right)\right)$
asked
Nov 27, 2016
in
Mathematical Logic
by
makhdoom ghaya
Boss
(
30.2k
points)

183
views
gate1990
descriptive
firstorderlogic
badquestion
+16
votes
2
answers
5
GATE199017a
Express $T(n)$ in terms of the harmonic number $H_{n}= \sum_{t=1}^{n} 1/i, n \geq 1$, where $T(n)$ satisfies the recurrence relation, $T(n)=\frac{n+1}{n} T(n  1)+1$, for $n \geq \sum$ and $T(1) = 1$ What is the asymptotic behaviour of $T(n)$ as a function of $n$ ?
asked
Nov 27, 2016
in
Algorithms
by
makhdoom ghaya
Boss
(
30.2k
points)

904
views
gate1990
descriptive
algorithms
recurrence
0
votes
0
answers
6
GATE199016b
Consider the grammar: $G_{2}$: Para $\rightarrow$ Sentence RP/Sentence RP $\rightarrow$ b Sentence RP  b Sentence Sentence $\rightarrow$ Word b Sentence Word Word $\rightarrow$ letter *word  letter letter $\rightarrow$ id Where $id,,*,.b$ ar terminals ... how to use a stack algorithm to parse the following string$id*id.b id * id.$ The parse should generate a rightmost derivation.
asked
Nov 26, 2016
in
Compiler Design
by
makhdoom ghaya
Boss
(
30.2k
points)

189
views
gate1990
descriptive
compilerdesign
grammar
unsolved
+17
votes
1
answer
7
GATE199016a
Show that grammar $G1$ is ambiguous using parse trees: $G_{1}: S \rightarrow$ if S then S else S $S \rightarrow$ if S then S
asked
Nov 26, 2016
in
Compiler Design
by
makhdoom ghaya
Boss
(
30.2k
points)

1.1k
views
gate1990
descriptive
compilerdesign
grammar
+2
votes
0
answers
8
GATE199015b
Complete the following production rules which generate the language:$L= \left\{a^{n} b^{n} c^{n}\mid a, b, c \in \Sigma \right\}$ where variables $R$ and $Q$ are used to move back and forth over the current string generated $S \rightarrow aYc$ ... $Qc \rightarrow cQ$ $Q \rightarrow R'c$ $cR' \rightarrow ...$ $bR' \rightarrow ...$ $aR' \rightarrow a...$
asked
Nov 26, 2016
in
Theory of Computation
by
makhdoom ghaya
Boss
(
30.2k
points)

217
views
gate1990
descriptive
theoryofcomputation
grammar
contextsensitive
nongate
+13
votes
2
answers
9
GATE199015a
Is the language generated by the grammar $G$ regular? If so, give a regular expression for it, else prove otherwise G: $S \rightarrow aB$ $B \rightarrow bC$ $C \rightarrow xB$ $C \rightarrow c$
asked
Nov 26, 2016
in
Theory of Computation
by
makhdoom ghaya
Boss
(
30.2k
points)

783
views
gate1990
descriptive
theoryofcomputation
regularlanguages
regulargrammar
grammar
+1
vote
0
answers
10
GATE199014
The following algorithm (written in pseudopascal) work on an undirected graph G program Explore (G) procedure Visit (u) begin if Adj (u) is not empty {comment:Adj (u) is the list of edges incident to u} then begin Select an edge from Adj (u); ... edges, given that each vertex can be accessed and removed from LIST in constant time. Also show that all edges of the graph are traversed.
asked
Nov 26, 2016
in
Algorithms
by
makhdoom ghaya
Boss
(
30.2k
points)

243
views
gate1990
descriptive
graphalgorithms
unsolved
0
votes
1
answer
11
GATE199013b
Consider a hash table with chaining scheme for overflow handling: What is the worstcase timing complexity of inserting $n$ elements into such a table? For what type of instance does this hashing scheme take the worstcase time for insertion?
asked
Nov 26, 2016
in
Algorithms
by
makhdoom ghaya
Boss
(
30.2k
points)

337
views
gate1990
hashing
algorithms
+6
votes
2
answers
12
GATE199013a
Consider the heightbalanced tree $T_{t}$ with values stored at only the leaf nodes, shown in Fig.4. (i) Show how to merge to the tree, $T_{1}$ elements from tree $T_{2}$ shown in Fig.5 using node D of tree $T_{1}$. (ii) What is the time complexity of ... $T_{1}$ and $T_{2}$ are of height $h_{1}$ and $h_{2}$ respectively, assuming that rotation schemes are given. Give reasons.
asked
Nov 26, 2016
in
DS
by
makhdoom ghaya
Boss
(
30.2k
points)

740
views
gate1990
descriptive
datastructure
trees
+3
votes
1
answer
13
GATE199012b
Consider the following problem. Given $n$ positive integers $a_{1}, a_{2}\dots a_n,$ it is required to partition them in to two parts $A$ and $B$ such that $\sum_{i \in A} a_{i}  \sum_{i \in B} a_{i}$ is minimised Consider a greedy ... in that part whose sum in smaller at that step. Give an example with $n=5$ for which the solution produced by the greedy algorithm is not optimal.
asked
Nov 25, 2016
in
Algorithms
by
makhdoom ghaya
Boss
(
30.2k
points)

203
views
gate1990
descriptive
algorithms
algorithmdesigntechniques
0
votes
0
answers
14
GATE199012a
Consider the following instance of the $0 1$ Knapsack problem: $\max 6X_{1} + 11X_{2} + 16X_{3} + 21X_{4} + 26X_{5}$ Subject to $4X_{1} + 8X_{2} + 12X_{3} + 16X_{4} + 20 X_{5} < 32$ and $X_{i}=0$ or $1$ ... the nodes in the tree in the order in which they are expanded and for each node show the bound on the partial solutions and the decision which leads to that node.
asked
Nov 25, 2016
in
Algorithms
by
makhdoom ghaya
Boss
(
30.2k
points)

203
views
gate1990
descriptive
algorithms
branchandbound
unsolved
+4
votes
3
answers
15
GATE199011b
The following program computes values of a mathematical function $f(x)$. Determine the form of $f(x)$. main () { int m, n; float x, y, t; scanf ("%f%d", &x, &n); t = 1; y = 0; m = 1; do { t *= (x/m); y += t; } while (m++ < n); printf ("The value of y is %f", y); }
asked
Nov 25, 2016
in
Algorithms
by
makhdoom ghaya
Boss
(
30.2k
points)

386
views
gate1990
descriptive
algorithms
identifyfunction
0
votes
2
answers
16
GATE199011a
What does the following program output? program module (input, output); var a:array [1...5] of integer; i, j: integer; procedure unknown (var b: integer, var c: integer); var i:integer; begin for i := 1 to 5 do a[i] := i; b:= 0; c := 0 for i := 1 to 5 do write (a[i]); writeln(); a[3 ... b); b := 5; c := 6; end; begin i:=1; j:=3; unknown (a[i], a[j]); for i:=1 to 5 do write (a[i]); end;
asked
Nov 25, 2016
in
Compiler Design
by
makhdoom ghaya
Boss
(
30.2k
points)

274
views
gate1990
descriptive
compilerdesign
runtimeenvironments
parameterpassing
+8
votes
3
answers
17
GATE199010b
One giga bytes of data are to be organized as an indexedsequential file with a uniform blocking factor 8. Assuming a block size of 1 Kilo bytes and a block refrencing pointer size of $32$ bits, find out the number of levels of indexing that would be ... the size of the master index. The referencing capability (fanout ratio) per block of index storage may be considered to be $32$.
asked
Nov 24, 2016
in
Databases
by
makhdoom ghaya
Boss
(
30.2k
points)

940
views
gate1990
descriptive
databases
indexing
+14
votes
1
answer
18
GATE199010a
Consider the following relational database: employees (eno, ename, address, basicsalary) projects (pno, pname, nosofstaffsallotted) working (pno, eno, pjob) The queries regarding data in the above database are formulated below in SQL. Describe in ... *) FROM projects)) SELECT pname FROM projects WHERE pno IN (SELECT pno FROM projects MINUS SELECT DISTINCT pno FROM working);
asked
Nov 24, 2016
in
Databases
by
makhdoom ghaya
Boss
(
30.2k
points)

627
views
gate1990
descriptive
databases
sql
+10
votes
1
answer
19
GATE19909b
Assuming the current disk cylinder to be $50$ and the sequence for the cylinders to be $1, 36, 49, 65, 53, 12, 3, 20, 55, 16, 65$ and $78$ find the sequence of servicing using Shortest seek time first (SSTF) and Elevator disk scheduling policies.
asked
Nov 24, 2016
in
Operating System
by
makhdoom ghaya
Boss
(
30.2k
points)

636
views
gate1990
descriptive
operatingsystem
diskscheduling
+1
vote
0
answers
20
GATE19909a
Assume that an instruction testandset (TS) has been provided in a machine whose function is as follows: 'the left most bit of the one byte operand is checked and accordingly the condition code (CC) is set to $1$ or $0$. After checking and setting the condition code, implement a critical region using this instruction.
asked
Nov 24, 2016
in
Operating System
by
makhdoom ghaya
Boss
(
30.2k
points)

331
views
descriptive
gate1990
operatingsystem
processsynchronization
criticalsection
unsolved
+1
vote
1
answer
21
GATE19908b
State the Booth's algorithm for multiplication of two numbers. Draw a block diagram for the implementation of the Booth's algorithm for determining the product of two 8bit signed numbers.
asked
Nov 24, 2016
in
Digital Logic
by
makhdoom ghaya
Boss
(
30.2k
points)

263
views
gate1990
descriptive
digitallogic
boothsalgorithm
+2
votes
1
answer
22
GATE19908a
A single bus CPU consists of four general purpose register, namely, $R0 ....... R3, ALU, MAR, MDR, PC, SP$ and $IR$ (Instruction Register). Assuming suitable microinstructions, write a microroutine for the instruction, $ADD R0, R1$
asked
Nov 24, 2016
in
CO and Architecture
by
makhdoom ghaya
Boss
(
30.2k
points)

343
views
gate1990
descriptive
coandarchitecture
microprogramming
+7
votes
1
answer
23
GATE19907c
A certain moving arm diskstorage device has the following specifications: Number of tracks per surface=$404$ Track storage capacity=$130030$ bytes. Disk speed=$3600$ rpm Average seek time=$30$ m secs. Estimate the average latency, the disk storage capacity and the data transfer rate.
asked
Nov 24, 2016
in
Operating System
by
makhdoom ghaya
Boss
(
30.2k
points)

1.5k
views
descriptive
operatingsystem
disks
gate1990
+33
votes
5
answers
24
GATE19907b
In a twolevel virtual memory, the memory access time for main memory, $t_{M}=10^{8}$ sec, and the memory access time for the secondary memory, $t_D=10^{3}$ sec. What must be the hit ratio, $H$ such that the access efficiency is within $80$ percent of its maximum value?
asked
Nov 24, 2016
in
Operating System
by
makhdoom ghaya
Boss
(
30.2k
points)

5.3k
views
gate1990
descriptive
operatingsystem
virtualmemory
+22
votes
1
answer
25
GATE19907a
A blockset associative cache memory consists of $128$ blocks divided into four block sets. The main memory consists of $16, 384$ blocks and each block contains $256$ eight bit words. How many bits are required for addressing the main memory? How many bits are needed to represent the TAG, SET and WORD fields?
asked
Nov 24, 2016
in
CO and Architecture
by
makhdoom ghaya
Boss
(
30.2k
points)

3.7k
views
gate1990
descriptive
coandarchitecture
cachememory
+11
votes
4
answers
26
GATE19905c
For the synchronous counter shown in Fig.3, write the truth table of $Q_{0}, Q_{1}$,and $Q_{2}$ after each pulse, starting from $Q_{0}=Q_{1}=Q_{2}=0$ and determine the counting sequence and also the modulus of the counter.
asked
Nov 24, 2016
in
Digital Logic
by
makhdoom ghaya
Boss
(
30.2k
points)

1k
views
gate1990
descriptive
digitallogic
flipflop
+10
votes
4
answers
27
GATE19905b
Show with the help of a block diagram how the Boolean function : $f=AB+BC+CA$ can be realised using only a $4:1$ multiplexer.
asked
Nov 24, 2016
in
Digital Logic
by
makhdoom ghaya
Boss
(
30.2k
points)

693
views
gate1990
descriptive
digitallogic
multiplexer
+15
votes
3
answers
28
GATE19905a
Find the minimum product of sums of the following expression $f=ABC + \bar{A}\bar{B}\bar{C}$
asked
Nov 24, 2016
in
Digital Logic
by
makhdoom ghaya
Boss
(
30.2k
points)

1.1k
views
gate1990
digitallogic
canonicalnormalform
descriptive
+7
votes
2
answers
29
GATE19904v
State whether the following statements are TRUE or FALSE with reason: The Linkloadandgo loading scheme required less storage space than the linkandgo loading scheme.
asked
Nov 24, 2016
in
Compiler Design
by
makhdoom ghaya
Boss
(
30.2k
points)

1.3k
views
gate1990
truefalse
compilerdesign
runtimeenvironments
+4
votes
0
answers
30
GATE19904iv
State whether the following statements are TRUE or FALSE with reason: Transferring data in blocks from the main memory to the cache memory enables an interleaved main memory unit to operate at its maximum speed.
asked
Nov 24, 2016
in
CO and Architecture
by
makhdoom ghaya
Boss
(
30.2k
points)

804
views
gate1990
truefalse
coandarchitecture
cachememory
memoryinterfacing
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
ECIL Interview Experience
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
Follow @csegate
Recent questions tagged gate1990
Recent Blog Comments
@`JEET No brother, I don't have. These points I...
Brother post after $\mathbf 1$ year?
Congratulations :)
Lakshman Patel RJIT Do you have such notes...
Great work sir
50,645
questions
56,567
answers
195,749
comments
101,708
users