Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
GATE 1999 Computer Science questions and solutions
Recent questions tagged gate1999
22
votes
2
answers
31
GATE CSE 1999 | Question: 2.17
Zero has two representations in Sign-magnitude $2's$ complement $1's$ complement None of the above
Zero has two representations inSign-magnitude$2's$ complement$1's$ complementNone of the above
Kathleen
7.3k
views
Kathleen
asked
Sep 23, 2014
Digital Logic
gate1999
digital-logic
number-representation
easy
multiple-selects
+
–
41
votes
6
answers
32
GATE CSE 1999 | Question: 2.16
The number of full and half-adders required to add $16$-bit numbers is $8$ half-adders, $8$ full-adders $1$ half-adder, $15$ full-adders $16$ half-adders, $0$ full-adders $4$ half-adders, $12$ full-adders
The number of full and half-adders required to add $16$-bit numbers is$8$ half-adders, $8$ full-adders$1$ half-adder, $15$ full-adders$16$ half-adders, $0$ full-adders$4$...
Kathleen
22.2k
views
Kathleen
asked
Sep 23, 2014
Digital Logic
gate1999
digital-logic
normal
adder
+
–
28
votes
2
answers
33
GATE CSE 1999 | Question: 2.15
A grammar that is both left and right recursive for a non-terminal, is Ambiguous Unambiguous Information is not sufficient to decide whether it is ambiguous or unambiguous None of the above
A grammar that is both left and right recursive for a non-terminal, isAmbiguousUnambiguousInformation is not sufficient to decide whether it is ambiguous or unambiguousNo...
Kathleen
9.6k
views
Kathleen
asked
Sep 23, 2014
Compiler Design
gate1999
compiler-design
grammar
normal
+
–
5
votes
4
answers
34
GATE CSE 1999 | Question: 2.14
The number of tokens in the FORTRAN statement DO 10 I = 1.25 is 3 4 5 None of the above
The number of tokens in the FORTRAN statement DO 10 I = 1.25 is345None of the above
Kathleen
6.8k
views
Kathleen
asked
Sep 23, 2014
Compiler Design
gate1999
fortran
out-of-syllabus-now
+
–
6
votes
2
answers
35
GATE CSE 1999 | Question: 2.13
Consider the following program in a language that has dynamic scooping: var x: real; procedure show: begin print(x);end; procedure small; var x: real; begin x: = 0.125; show; end; begin x:=0.25 show; small end. Then the output of the program is: 0.125 0.125 0.25 0.25 0.25 0.125 0.125 0.25
Consider the following program in a language that has dynamic scooping:var x: real; procedure show: begin print(x);end; procedure small; var x: real; begin x: = 0.125; sh...
Kathleen
5.7k
views
Kathleen
asked
Sep 23, 2014
Programming in C
gate1999
programming
variable-binding
normal
out-of-syllabus-now
+
–
75
votes
3
answers
36
GATE CSE 1999 | Question: 2.12
Which of the following actions is/are typically not performed by the operating system when switching context from process $A$ to process $B$? Saving current register values and restoring saved register values for process $B$. Changing address translation tables. Swapping out the memory image of process $A$ to the disk. Invalidating the translation look-aside buffer.
Which of the following actions is/are typically not performed by the operating system when switching context from process $A$ to process $B$?Saving current register value...
Kathleen
27.4k
views
Kathleen
asked
Sep 23, 2014
Operating System
gate1999
operating-system
context-switch
normal
+
–
41
votes
4
answers
37
GATE CSE 1999 | Question: 2.11
Which of the following is/are advantage(s) of virtual memory? Faster access to memory on an average. Processes can be given protected address spaces. Linker can assign addresses independent of where the program will be loaded in physical memory. Program larger than the physical memory size can be run.
Which of the following is/are advantage(s) of virtual memory?Faster access to memory on an average.Processes can be given protected address spaces.Linker can assign addre...
Kathleen
13.7k
views
Kathleen
asked
Sep 23, 2014
Operating System
gate1999
operating-system
virtual-memory
easy
+
–
36
votes
3
answers
38
GATE CSE 1999 | Question: 2.10
A multi-user, multi-processing operating system cannot be implemented on hardware that does not support Address translation DMA for disk transfer At least two modes of CPU execution (privileged and non-privileged) Demand paging
A multi-user, multi-processing operating system cannot be implemented on hardware that does not supportAddress translationDMA for disk transferAt least two modes of CPU e...
Kathleen
12.6k
views
Kathleen
asked
Sep 23, 2014
Operating System
gate1999
operating-system
normal
virtual-memory
+
–
37
votes
5
answers
39
GATE CSE 1999 | Question: 2.9
Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function? XOR gates, NOT gates $2$ to $1$ multiplexers AND gates, XOR gates Three-input gates that output $(A.B) + C$ for the inputs $A, B$ and $C$.
Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function?XOR gates, NOT gates$2$ to $1$ multiplexersAND gates, XOR gatesT...
Kathleen
15.0k
views
Kathleen
asked
Sep 23, 2014
Digital Logic
gate1999
digital-logic
normal
functional-completeness
multiple-selects
+
–
32
votes
3
answers
40
GATE CSE 1999 | Question: 2.8
Consider the circuit shown below. In a certain steady state, the line $Y$ is at $'1'$. What are the possible values of $A, B$ and $C$ in this state? $A=0, B=0, C=1$ $A=0, B=1, C=1$ $A=1, B=0, C=1$ $A=1, B=1, C=1$
Consider the circuit shown below. In a certain steady state, the line $Y$ is at $'1'$. What are the possible values of $A, B$ and $C$ in this state?$A=0, B=0, C=1$$A=0, B...
Kathleen
7.4k
views
Kathleen
asked
Sep 23, 2014
Digital Logic
gate1999
digital-logic
circuit-output
normal
+
–
69
votes
11
answers
41
GATE CSE 1999 | Question: 2.7, UGCNET-June2014-III: 25
Consider the schema $R=(S,T, U, V)$ and the dependencies $S \rightarrow T, T \rightarrow U, U \rightarrow V$ and $V \rightarrow S$. Let $R = (R1\text{ and } R2)$ be a decomposition such that $R1 \cap R2 \neq \phi$. The decomposition ... but not $\textsf{3NF}$ in $\textsf{3NF}$ but not in $\textsf{2NF}$ in both $\textsf{2NF}$ and $\textsf{3NF}$
Consider the schema $R=(S,T, U, V)$ and the dependencies $S \rightarrow T, T \rightarrow U, U \rightarrow V$ and $V \rightarrow S$. Let $R = (R1\text{ and } R2)$ be a dec...
Kathleen
27.0k
views
Kathleen
asked
Sep 23, 2014
Databases
gate1999
databases
database-normalization
normal
ugcnetjune2014iii
+
–
53
votes
3
answers
42
GATE CSE 1999 | Question: 2.6
For the schedule given below, which of the following is correct: ... schedule is not serializable but can occur in a scheme using 2PL protocol This schedule is not serializable and cannot occur in a scheme using 2PL protocol
For the schedule given below, which of the following is correct:$$\begin{array}{ll} \text{1} & \text{Read A} & \text{} \\ \text{2} & \text{} & \text{Read B} \\ \text{3...
Kathleen
14.0k
views
Kathleen
asked
Sep 23, 2014
Databases
gate1999
databases
transaction-and-concurrency
normal
+
–
31
votes
5
answers
43
GATE CSE 1999 | Question: 2.5
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if-then-else forward go to arbitrary go to non-recursive procedure call recursive procedure/function call repeat loop, which constructs will you not include in a programming language ... $\text{(vi), (vii), (viii)}$ $\text{(iii), (vii), (viii)}$
Given the programming constructsassignmentfor loops where the loop parameter cannot be changed within the loopif-then-elseforward go toarbitrary go tonon-recursive proced...
Kathleen
12.5k
views
Kathleen
asked
Sep 23, 2014
Programming in C
gate1999
programming
normal
programming-constructs
+
–
29
votes
2
answers
44
GATE CSE 1999 | Question: 2.4
If $L1$ is context free language and $L2$ is a regular language which of the following is/are false? $L1-L2$ is not context free $L1 \cap L2$ is context free $\sim L1$ is context free $\sim L2$ is regular
If $L1$ is context free language and $L2$ is a regular language which of the following is/are false?$L1-L2$ is not context free$L1 \cap L2$ is context free$\sim L1$ is co...
Kathleen
11.5k
views
Kathleen
asked
Sep 23, 2014
Theory of Computation
gate1999
theory-of-computation
identify-class-language
normal
multiple-selects
+
–
15
votes
4
answers
45
GATE CSE 1999 | Question: 2.3
Let $L$ be a set with a relation $R$ which is transitive, anti-symmetric and reflexive and for any two elements $a, b \in L$, let the least upper bound $lub (a, b)$ and the greatest lower bound $glb (a, b)$ exist. Which of the following is/are true? $L$ is a poset $L$ is a Boolean algebra $L$ is a lattice None of the above
Let $L$ be a set with a relation $R$ which is transitive, anti-symmetric and reflexive and for any two elements $a, b \in L$, let the least upper bound $lub (a, b)$ and ...
Kathleen
5.5k
views
Kathleen
asked
Sep 23, 2014
Set Theory & Algebra
gate1999
set-theory&algebra
normal
relations
multiple-selects
+
–
38
votes
7
answers
46
GATE CSE 1999 | Question: 2.2
Two girls have picked $10$ roses, $15$ sunflowers and $15$ daffodils. What is the number of ways they can divide the flowers among themselves? $1638$ $2100$ $2640$ None of the above
Two girls have picked $10$ roses, $15$ sunflowers and $15$ daffodils. What is the number of ways they can divide the flowers among themselves?$1638$$2100$$2640$None of th...
Kathleen
12.0k
views
Kathleen
asked
Sep 23, 2014
Combinatory
gate1999
combinatory
normal
+
–
16
votes
2
answers
47
GATE CSE 1999 | Question: 2.1
Consider two events $E_1$ and $E_2$ such that probability of $E_1$, $P_r[E_1]=\frac{1}{2}$, probability of $E_2$, $P_r[E_{2}]=\frac{1}{3}$, and probability of $E_1$, and $E_2$, $P_r[E_1 \: and \: E_2] = \frac{1}{5}$. Which of the ... Events $E_1$ and $E_2$ are independent Events $E_1$ and $E_2$ are not independent $P_r \left[{E_1}\mid{E_2} \right] = \frac{4}{5}$
Consider two events $E_1$ and $E_2$ such that probability of $E_1$, $P_r[E_1]=\frac{1}{2}$, probability of $E_2$, $P_r[E_{2}]=\frac{1}{3}$, and probability of $E_1$, and ...
Kathleen
4.1k
views
Kathleen
asked
Sep 23, 2014
Probability
gate1999
probability
normal
independent-events
+
–
35
votes
3
answers
48
GATE CSE 1999 | Question: 1.25
Which of the following is correct? B-trees are for storing data on disk and B$^+$ trees are for main memory. Range queries are faster on B$^+$ trees. B-trees are for primary indexes and B$^+$ trees are for secondary indexes. The height of a B$^+$ tree is independent of the number of records.
Which of the following is correct?B-trees are for storing data on disk and B$^+$ trees are for main memory.Range queries are faster on B$^+$ trees.B-trees are for primary...
Kathleen
14.3k
views
Kathleen
asked
Sep 23, 2014
Databases
gate1999
databases
b-tree
normal
+
–
25
votes
1
answer
49
GATE CSE 1999 | Question: 1.24
Let $R = (A, B, C, D, E, F)$ be a relation scheme with the following dependencies $C \rightarrow F, E \rightarrow A, EC \rightarrow D, A \rightarrow B $. Which one of the following is a key for $R$? CD EC AE AC
Let $R = (A, B, C, D, E, F)$ be a relation scheme with the following dependencies $C \rightarrow F, E \rightarrow A, EC \rightarrow D, A \rightarrow B $. Which one of the...
Kathleen
4.0k
views
Kathleen
asked
Sep 23, 2014
Databases
gate1999
databases
database-normalization
easy
+
–
6
votes
2
answers
50
GATE CSE 1999 | Question: 1.23
The Newton-Raphson method is to be used to find the root of the equation $f(x)=0$ where $x_o$ is the initial approximation and $f’$ is the derivative of $f$. The method converges always only if $f$ is a polynomial only if $f(x_o) <0$ none of the above
The Newton-Raphson method is to be used to find the root of the equation $f(x)=0$ where $x_o$ is the initial approximation and $f’$ is the derivative of $f$. The metho...
Kathleen
2.9k
views
Kathleen
asked
Sep 23, 2014
Numerical Methods
gate1999
numerical-methods
newton-raphson
normal
out-of-syllabus-now
+
–
28
votes
3
answers
51
GATE CSE 1999 | Question: 1.22
The main memory of a computer has $2\;\text{cm}$ blocks while the cache has $2\;\text{c}$ blocks. If the cache uses the set associative mapping scheme with $2$ blocks per set, then block $k$ of the main memory maps to the set: $(k \mod m)$ of the cache $(k \mod c)$ of the cache $(k \mod 2c)$ of the cache $(k \mod 2\; cm)$ of the cache
The main memory of a computer has $2\;\text{cm}$ blocks while the cache has $2\;\text{c}$ blocks. If the cache uses the set associative mapping scheme with $2$ blocks per...
Kathleen
7.5k
views
Kathleen
asked
Sep 23, 2014
CO and Architecture
gate1999
co-and-architecture
cache-memory
normal
+
–
29
votes
3
answers
52
GATE CSE 1999 | Question: 1.21
The maximum gate delay for any output to appear in an array multiplier for multiplying two $n$ bit numbers is $O(n^2)$ $O(n)$ $O(\log n)$ $O(1)$
The maximum gate delay for any output to appear in an array multiplier for multiplying two $n$ bit numbers is$O(n^2)$$O(n)$$O(\log n)$$O(1)$
Kathleen
11.4k
views
Kathleen
asked
Sep 23, 2014
Digital Logic
gate1999
digital-logic
normal
array-multiplier
+
–
29
votes
4
answers
53
GATE CSE 1999 | Question: 1.20
Booth's coding in $8$ bits for the decimal number $-57$ is: $0-100+1000$ $0-100+100-1$ $0-1+100-10+1$ $00-10+100-1$
Booth's coding in $8$ bits for the decimal number $-57$ is:$0-100+1000$$0-100+100-1$$0-1+100-10+1$$00-10+100-1$
Kathleen
13.2k
views
Kathleen
asked
Sep 23, 2014
Digital Logic
gate1999
digital-logic
number-representation
booths-algorithm
normal
+
–
29
votes
1
answer
54
GATE CSE 1999 | Question: 1.19
The relational algebra expression equivalent to the following tuple calculus expression: $\left\{t \mid t \in r \land \left(t[A] = 10 \land t[B]=20\right)\right\}$ is $\sigma_{(A=10 \lor B=20)} (r)$ $\sigma_{(A=10)} (r) \cup \sigma_{(B=20)} (r)$ $\sigma_{(A=10)} (r) \cap \sigma_{(B=20)} (r)$ $\sigma_{(A=10)} (r) - \sigma_{(B=20)} (r)$
The relational algebra expression equivalent to the following tuple calculus expression:$\left\{t \mid t \in r \land \left(t[A] = 10 \land t[B]=20\right)\right\}$ is$\sig...
Kathleen
5.7k
views
Kathleen
asked
Sep 23, 2014
Databases
gate1999
databases
relational-calculus
normal
+
–
38
votes
1
answer
55
GATE CSE 1999 | Question: 1.18, ISRO2016-53
Consider the join of a relation $R$ with a relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples then the maximum and minimum sizes of the join respectively are $m+n$ and $0$ $mn$ and $0$ $m+n$ and $|m-n|$ $mn$ and $m+n$
Consider the join of a relation $R$ with a relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples then the maximum and minimum sizes of the join respectively are$m+n$...
Kathleen
16.8k
views
Kathleen
asked
Sep 23, 2014
Databases
gate1999
databases
relational-algebra
easy
isro2016
+
–
21
votes
6
answers
56
GATE CSE 1999 | Question: 1.17
Which of the following is the most powerful parsing method? LL (1) Canonical LR SLR LALR
Which of the following is the most powerful parsing method?LL (1)Canonical LRSLRLALR
Kathleen
22.9k
views
Kathleen
asked
Sep 23, 2014
Compiler Design
gate1999
compiler-design
parsing
easy
+
–
30
votes
5
answers
57
GATE CSE 1999 | Question: 1.16
If $n$ is a power of $2$, then the minimum number of multiplications needed to compute $a^n$ is $\log_2 n$ $\sqrt n$ $n-1$ $n$
If $n$ is a power of $2$, then the minimum number of multiplications needed to compute $a^n$ is$\log_2 n$$\sqrt n$$n-1$$n$
Kathleen
9.0k
views
Kathleen
asked
Sep 23, 2014
Algorithms
gate1999
algorithms
time-complexity
normal
+
–
39
votes
5
answers
58
GATE CSE 1999 | Question: 1.15
The number of articulation points of the following graph is $0$ $1$ $2$ $3$
The number of articulation points of the following graph is$0$$1$$2$$3$
Kathleen
8.7k
views
Kathleen
asked
Sep 23, 2014
Graph Theory
gate1999
graph-theory
graph-connectivity
normal
+
–
48
votes
2
answers
59
GATE CSE 1999 | Question: 1.14, ISRO2015-42
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order: $20, \ 47, \ 15, \ 8, \ 9, \ 4, \ 40, \ 30, \ 12, \ 17$ ... $4, \ 8, \ 9, \ 15, \ 20, \ 47, \ 12, \ 17, \ 30, \ 40$
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order: $20, \ 47, \ 15, \ 8, \ 9, \ 4, \ 40, \ 30, \ 12, \ 17$then the o...
Kathleen
22.5k
views
Kathleen
asked
Sep 23, 2014
Algorithms
gate1999
algorithms
merge-sort
normal
isro2015
+
–
57
votes
6
answers
60
GATE CSE 1999 | Question: 1.13
Suppose we want to arrange the $n$ numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is $n-1$ $n$ $n+1$ None of the above
Suppose we want to arrange the $n$ numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the w...
Kathleen
19.6k
views
Kathleen
asked
Sep 23, 2014
Algorithms
gate1999
algorithms
time-complexity
normal
+
–
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register