Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for gate1990
56
votes
7
answers
1
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?
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 m...
makhdoom ghaya
19.4k
views
makhdoom ghaya
asked
Nov 23, 2016
Operating System
gate1990
descriptive
operating-system
virtual-memory
+
–
35
votes
5
answers
2
GATE CSE 1990 | Question: 3-ii
Indicate which of the following statements are true: A relational database which is in $3$NF may still have undesirable data redundancy because there may exist: Transitive functional dependencies Non-trivial functional dependencies ... dependencies involving prime attributes only on the left-side. Non-trivial functional dependencies involving only prime attributes.
Indicate which of the following statements are true:A relational database which is in $3$NF may still have undesirable data redundancy because there may exist:Transitive ...
makhdoom ghaya
14.6k
views
makhdoom ghaya
asked
Nov 19, 2016
Databases
gate1990
normal
databases
database-normalization
multiple-selects
+
–
30
votes
6
answers
3
GATE CSE 1990 | Question: 3-x
Indicate which of the following well-formed formulae are valid: $\left(P\Rightarrow Q\right) {\wedge} \left(Q \Rightarrow R\right) \Rightarrow \left(P \Rightarrow R\right)$ ...
Indicate which of the following well-formed formulae are valid:$\left(P\Rightarrow Q\right) {\wedge} \left(Q \Rightarrow R\right) \Rightarrow \left(P \Rightarrow R\right)...
makhdoom ghaya
9.4k
views
makhdoom ghaya
asked
Nov 22, 2016
Mathematical Logic
gate1990
normal
mathematical-logic
propositional-logic
multiple-selects
+
–
40
votes
1
answer
4
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?
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$ eig...
makhdoom ghaya
28.7k
views
makhdoom ghaya
asked
Nov 23, 2016
CO and Architecture
gate1990
descriptive
co-and-architecture
cache-memory
+
–
21
votes
5
answers
5
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.
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...
makhdoom ghaya
6.4k
views
makhdoom ghaya
asked
Nov 23, 2016
Digital Logic
gate1990
descriptive
digital-logic
sequential-circuit
flip-flop
digital-counter
+
–
46
votes
2
answers
6
GATE CSE 1990 | Question: 3-vii
It is undecidable whether: An arbitrary Turing machine halts after $100$ steps. A Turing machine prints a specific letter. A Turing machine computes the products of two numbers None of the above.
It is undecidable whether:An arbitrary Turing machine halts after $100$ steps.A Turing machine prints a specific letter.A Turing machine computes the products of two numb...
makhdoom ghaya
12.7k
views
makhdoom ghaya
asked
Nov 22, 2016
Theory of Computation
gate1990
normal
theory-of-computation
decidability
multiple-selects
+
–
9
votes
3
answers
7
GATE CSE 1990 | Question: 4-iii
State whether the following statements are TRUE or FALSE with reason: The flags are affected when conditional CALL or JUMP instructions are executed.
State whether the following statements are TRUE or FALSE with reason:The flags are affected when conditional CALL or JUMP instructions are executed.
makhdoom ghaya
3.3k
views
makhdoom ghaya
asked
Nov 23, 2016
CO and Architecture
gate1990
true-false
co-and-architecture
instruction-execution
+
–
23
votes
6
answers
8
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.
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
4.6k
views
makhdoom ghaya
asked
Nov 23, 2016
Digital Logic
gate1990
descriptive
digital-logic
combinational-circuit
multiplexer
+
–
1
votes
1
answer
9
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.
Consider the grammar:$G_{2}$:Para $\rightarrow$ Sentence RP | SentenceRP $\rightarrow$ b Sentence RP | b SentenceSentence $\rightarrow$ Word b Sentence | WordWord $\right...
makhdoom ghaya
675
views
makhdoom ghaya
asked
Nov 26, 2016
Compiler Design
gate1990
descriptive
compiler-design
grammar
unsolved
+
–
27
votes
2
answers
10
GATE CSE 1990 | Question: 3-vi
Recursive languages are: A proper superset of context free languages. Always recognizable by pushdown automata. Also called type $0$ languages. Recognizable by Turing machines.
Recursive languages are:A proper superset of context free languages.Always recognizable by pushdown automata.Also called type $0$ languages.Recognizable by Turing machine...
makhdoom ghaya
16.9k
views
makhdoom ghaya
asked
Nov 22, 2016
Theory of Computation
gate1990
normal
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
multiple-selects
+
–
22
votes
5
answers
11
GATE CSE 1990 | Question: 3-iv
The total external path length, $\text{EPL},$ of a binary tree with $n$ external nodes is, $\text{EPL}= \displaystyle \sum_{w} I_w$, where $I_{w}$ is the path length of external node $w$), $\leq n^{2}$ always. $\geq n \log_{2} n$ always. Equal to $n^{2}$ always. $O(n)$ for some special trees.
The total external path length, $\text{EPL},$ of a binary tree with $n$ external nodes is, $\text{EPL}= \displaystyle \sum_{w} I_w$, where $I_{w}$ is the path length of e...
makhdoom ghaya
6.3k
views
makhdoom ghaya
asked
Nov 22, 2016
DS
gate1990
normal
data-structures
binary-tree
multiple-selects
+
–
19
votes
5
answers
12
GATE CSE 1990 | Question: 3-i
Choose the correct alternatives (More than one may be correct). Two NAND gates having open collector outputs are tied together as shown in below figure. The logic function $Y,$ implemented by the circuit is, $Y=ABC + DE$ $Y=\overline{ABC + DE}$ $Y=ABC.DE$ $Y=\overline{ABC.DE}$
Choose the correct alternatives (More than one may be correct).Two NAND gates having open collector outputs are tied together as shown in below figure.The logic function ...
makhdoom ghaya
7.4k
views
makhdoom ghaya
asked
Nov 19, 2016
Digital Logic
gate1990
normal
digital-logic
circuit-output
+
–
16
votes
2
answers
13
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.
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$ rp...
makhdoom ghaya
8.1k
views
makhdoom ghaya
asked
Nov 23, 2016
Operating System
gate1990
operating-system
disk
descriptive
+
–
16
votes
2
answers
14
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.
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 ...
makhdoom ghaya
5.6k
views
makhdoom ghaya
asked
Nov 24, 2016
Operating System
gate1990
descriptive
operating-system
disk-scheduling
+
–
26
votes
4
answers
15
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$.
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 refrencin...
makhdoom ghaya
6.5k
views
makhdoom ghaya
asked
Nov 24, 2016
Databases
gate1990
databases
indexing
descriptive
+
–
13
votes
2
answers
16
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.
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, $\displaystyl...
makhdoom ghaya
2.6k
views
makhdoom ghaya
asked
Nov 25, 2016
Algorithms
gate1990
descriptive
algorithms
algorithm-design-technique
+
–
12
votes
2
answers
17
GATE CSE 1990 | Question: 3-ix
The number of ways in which $5\; A's, 5\; B's$ and $5\; C's$ can be arranged in a row is: $15!/(5!)^{3}$ $15!$ $\left(\frac{15}{5}\right)$ $15!(5!3!)$.
The number of ways in which $5\; A's, 5\; B's$ and $5\; C's$ can be arranged in a row is:$15!/(5!)^{3}$$15!$$\left(\frac{15}{5}\right)$$15!(5!3!)$.
makhdoom ghaya
3.1k
views
makhdoom ghaya
asked
Nov 22, 2016
Combinatory
gate1990
normal
combinatory
+
–
14
votes
3
answers
18
GATE CSE 1990 | Question: 2-viii
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{|ll|ll|} \hline (a) & \text{A heap construction} & (p) & \ \Omega(n\log_{10}n) \\\hline (b) & \text{Construct...
makhdoom ghaya
5.1k
views
makhdoom ghaya
asked
Nov 19, 2016
DS
gate1990
match-the-following
data-structures
binary-heap
+
–
29
votes
3
answers
19
GATE CSE 1990 | Question: 2-ix
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{ll|ll} (a) & \text{Lexical analysis} & (p) & \text{DAG's} \\\hline (b) & \text{Code optimization} & (q) & \tex...
makhdoom ghaya
14.4k
views
makhdoom ghaya
asked
Nov 19, 2016
Compiler Design
gate1990
match-the-following
compiler-design
compilation-phases
+
–
27
votes
2
answers
20
GATE CSE 1990 | Question: 3-xi
A graph is planar if and only if, It does not contain a subgraph homeomorphic to $k_{5}$ and $k_{3, 3}$. It does not contain a subgraph isomorphic to $k_{5}$ and $k_{3, 3}$. It does not contain a subgraph isomorphic to $k_{5}$ or $k_{3, 3}$ It does not contain a subgraph homeomorphic to $k_{5}$ or $k_{3, 3}$.
A graph is planar if and only if,It does not contain a subgraph homeomorphic to $k_{5}$ and $k_{3, 3}$.It does not contain a subgraph isomorphic to $k_{5}$ and $k_{3, 3}$...
makhdoom ghaya
12.6k
views
makhdoom ghaya
asked
Nov 23, 2016
Graph Theory
gate1990
normal
graph-theory
graph-planarity
multiple-selects
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register