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 1990 Computer Science questions
Recent questions tagged gate1990
12
votes
4
answers
1
GATE CSE 1990 | Question: 1-iv-b
A $32$-bit floating-point number is represented by a $7$-bit signed exponent, and a $24$-bit fractional mantissa. The base of the scale factor is $16,$ The range of the exponent is ___________, if the scale factor is represented in excess-$64$ format.
go_editor
asked
in
Digital Logic
Feb 12, 2018
by
go_editor
3.1k
views
gate1990
digital-logic
number-representation
floating-point-representation
fill-in-the-blanks
16
votes
2
answers
2
GATE CSE 1990 | Question: 1-viii
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 ___________.
makhdoom ghaya
asked
in
Digital Logic
Nov 27, 2016
by
makhdoom ghaya
3.5k
views
gate1990
digital-logic
number-representation
fill-in-the-blanks
9
votes
2
answers
3
GATE CSE 1990 | Question: 17c
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.
makhdoom ghaya
asked
in
Set Theory & Algebra
Nov 27, 2016
by
makhdoom ghaya
1.4k
views
gate1990
descriptive
set-theory&algebra
lattice
0
votes
0
answers
4
GATE CSE 1990 | Question: 17b
Show, using resolution, that the following well-formed 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)$
makhdoom ghaya
asked
in
Mathematical Logic
Nov 27, 2016
by
makhdoom ghaya
364
views
gate1990
descriptive
first-order-logic
bad-question
24
votes
2
answers
5
GATE CSE 1990 | Question: 17a
Express $T(n)$ in terms of the harmonic number $\displaystyle H_{n}= \sum_{i=1}^{n} \frac{1}{i},\quad 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$ ?
makhdoom ghaya
asked
in
Algorithms
Nov 27, 2016
by
makhdoom ghaya
3.3k
views
gate1990
descriptive
algorithms
recurrence-relation
1
vote
0
answers
6
GATE CSE 1990 | Question: 16b
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$ ... to use a stack algorithm to parse the following string$id*id\;b\; id * id$ The parse should generate a rightmost derivation.
makhdoom ghaya
asked
in
Compiler Design
Nov 26, 2016
by
makhdoom ghaya
475
views
gate1990
descriptive
compiler-design
grammar
unsolved
23
votes
1
answer
7
GATE CSE 1990 | Question: 16a
Show that grammar $G_1$ is ambiguous using parse trees: $G_{1}: S \rightarrow$ if $S$ then $S$ else $S$ $S \rightarrow$ if $S$ then $S$
makhdoom ghaya
asked
in
Compiler Design
Nov 26, 2016
by
makhdoom ghaya
5.9k
views
gate1990
descriptive
compiler-design
grammar
3
votes
0
answers
8
GATE CSE 1990 | Question: 15b
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...$
makhdoom ghaya
asked
in
Theory of Computation
Nov 26, 2016
by
makhdoom ghaya
491
views
gate1990
descriptive
theory-of-computation
grammar
context-sensitive
out-of-gate-syllabus
19
votes
2
answers
9
GATE CSE 1990 | Question: 15a
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$
makhdoom ghaya
asked
in
Theory of Computation
Nov 26, 2016
by
makhdoom ghaya
2.3k
views
gate1990
descriptive
theory-of-computation
regular-language
regular-grammar
1
vote
0
answers
10
GATE CSE 1990 | Question: 14
The following algorithm (written in pseudo-pascal) 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 ... that each vertex can be accessed and removed from LIST in constant time. Also, show that all edges of the graph are traversed.
makhdoom ghaya
asked
in
Algorithms
Nov 26, 2016
by
makhdoom ghaya
510
views
gate1990
descriptive
graph-algorithms
unsolved
7
votes
1
answer
11
GATE CSE 1990 | Question: 13b
Consider a hash table with chaining scheme for overflow handling: What is the worst-case timing complexity of inserting $n$ elements into such a table? For what type of instance does this hashing scheme take the worst-case time for insertion?
makhdoom ghaya
asked
in
Algorithms
Nov 26, 2016
by
makhdoom ghaya
1.8k
views
gate1990
hashing
algorithms
descriptive
11
votes
2
answers
12
GATE CSE 1990 | Question: 13a
Consider the height-balanced 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 ... where $T_{1}$ and $T_{2}$ are of height $h_{1}$ and $h_{2}$ respectively, assuming that rotation schemes are given. Give reasons.
makhdoom ghaya
asked
in
DS
Nov 26, 2016
by
makhdoom ghaya
2.8k
views
gate1990
data-structures
tree
descriptive
11
votes
2
answers
13
GATE CSE 1990 | Question: 12b
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$ ... 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.
makhdoom ghaya
asked
in
Algorithms
Nov 25, 2016
by
makhdoom ghaya
1.8k
views
gate1990
descriptive
algorithms
algorithm-design-techniques
1
vote
0
answers
14
GATE CSE 1990 | Question: 12a
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$ ... 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.
makhdoom ghaya
asked
in
Algorithms
Nov 25, 2016
by
makhdoom ghaya
728
views
gate1990
descriptive
algorithms
branch-and-bound
unsolved
11
votes
3
answers
15
GATE CSE 1990 | Question: 11b
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); }
makhdoom ghaya
asked
in
Algorithms
Nov 25, 2016
by
makhdoom ghaya
1.6k
views
gate1990
descriptive
algorithms
identify-function
4
votes
2
answers
16
GATE CSE 1990 | Question: 11a
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]); ... 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;
makhdoom ghaya
asked
in
Compiler Design
Nov 25, 2016
by
makhdoom ghaya
1.2k
views
gate1990
descriptive
compiler-design
runtime-environment
parameter-passing
20
votes
4
answers
17
GATE CSE 1990 | Question: 10b
One giga bytes of data are to be organized as an indexed-sequential 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 ... size of the master index. The referencing capability (fanout ratio) per block of index storage may be considered to be $32$.
makhdoom ghaya
asked
in
Databases
Nov 24, 2016
by
makhdoom ghaya
4.7k
views
gate1990
databases
indexing
descriptive
21
votes
1
answer
18
GATE CSE 1990 | Question: 10-a
Consider the following relational database: employees (eno, ename, address, basic-salary) projects (pno, pname, nos-of-staffs-allotted) working (pno, eno, pjob) The queries regarding data in the above database are formulated below in SQL. ... FROM projects)) SELECT pname FROM projects WHERE pno IN (SELECT pno FROM projects MINUS SELECT DISTINCT pno FROM working);
makhdoom ghaya
asked
in
Databases
Nov 24, 2016
by
makhdoom ghaya
2.0k
views
gate1990
descriptive
databases
sql
16
votes
2
answers
19
GATE CSE 1990 | Question: 9b
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.
makhdoom ghaya
asked
in
Operating System
Nov 24, 2016
by
makhdoom ghaya
4.0k
views
gate1990
descriptive
operating-system
disk-scheduling
2
votes
0
answers
20
GATE CSE 1990 | Question: 9a
Assume that an instruction test-and-set (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.
makhdoom ghaya
asked
in
Operating System
Nov 24, 2016
by
makhdoom ghaya
656
views
descriptive
gate1990
operating-system
process-synchronization
critical-section
unsolved
5
votes
1
answer
21
GATE CSE 1990 | Question: 8b
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 $8$-bit signed numbers.
makhdoom ghaya
asked
in
Digital Logic
Nov 24, 2016
by
makhdoom ghaya
2.3k
views
gate1990
descriptive
digital-logic
booths-algorithm
7
votes
1
answer
22
GATE CSE 1990 | Question: 8a
A single bus CPU consists of four general purpose register, namely, $R0, \ldots, R3, \text{ALU}, \text{MAR}, \text{MDR}, \text{PC}, \text{SP}$ and $\text{IR}$ (Instruction Register). Assuming suitable microinstructions, write a microroutine for the instruction, $\text{ADD }R0, R1$.
makhdoom ghaya
asked
in
CO and Architecture
Nov 24, 2016
by
makhdoom ghaya
1.4k
views
gate1990
descriptive
co-and-architecture
data-path
16
votes
2
answers
23
GATE CSE 1990 | Question: 7-c
A certain moving arm disk-storage 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.
makhdoom ghaya
asked
in
Operating System
Nov 24, 2016
by
makhdoom ghaya
6.1k
views
gate1990
operating-system
disk
descriptive
54
votes
7
answers
24
GATE CSE 1990 | Question: 7-b
In a two-level 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?
makhdoom ghaya
asked
in
Operating System
Nov 24, 2016
by
makhdoom ghaya
14.5k
views
gate1990
descriptive
operating-system
virtual-memory
37
votes
1
answer
25
GATE CSE 1990 | Question: 7a
A block-set 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?
makhdoom ghaya
asked
in
CO and Architecture
Nov 24, 2016
by
makhdoom ghaya
21.9k
views
gate1990
descriptive
co-and-architecture
cache-memory
20
votes
4
answers
26
GATE CSE 1990 | Question: 5-c
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.
makhdoom ghaya
asked
in
Digital Logic
Nov 24, 2016
by
makhdoom ghaya
4.6k
views
gate1990
descriptive
digital-logic
sequential-circuit
flip-flop
digital-counter
22
votes
6
answers
27
GATE CSE 1990 | Question: 5-b
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.
makhdoom ghaya
asked
in
Digital Logic
Nov 24, 2016
by
makhdoom ghaya
3.4k
views
gate1990
descriptive
digital-logic
combinational-circuit
multiplexer
20
votes
3
answers
28
GATE CSE 1990 | Question: 5-a
Find the minimum product of sums of the following expression $f=ABC + \overline{A}\;\;\overline{B}\;\;\overline{C}$
makhdoom ghaya
asked
in
Digital Logic
Nov 24, 2016
by
makhdoom ghaya
4.4k
views
gate1990
digital-logic
boolean-algebra
min-product-of-sums
canonical-normal-form
descriptive
15
votes
2
answers
29
GATE CSE 1990 | Question: 4-v
State whether the following statements are TRUE or FALSE with reason: The Link-load-and-go loading scheme required less storage space than the link-and-go loading scheme.
makhdoom ghaya
asked
in
Compiler Design
Nov 24, 2016
by
makhdoom ghaya
3.8k
views
gate1990
true-false
compiler-design
runtime-environment
4
votes
0
answers
30
GATE CSE 1990 | Question: 4-iv
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.
makhdoom ghaya
asked
in
CO and Architecture
Nov 24, 2016
by
makhdoom ghaya
2.5k
views
gate1990
true-false
co-and-architecture
cache-memory
memory-interfacing
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 gate1990
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...