Log In
GATE 1989 Computer Science Questions

Recent questions tagged gate1989

24 votes
3 answers
Provide short answers to the following questions: How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.
asked Nov 30, 2016 in Combinatory makhdoom ghaya 1.9k views
9 votes
2 answers
Answer the following: Which one of the following statements (s) is/are FALSE? Overlaying is used to run a program, which is longer than the address space of the computer. Optimal binary search tree construction can be performed efficiently by using dynamic programming ... components of a graph. Given the prefix and postfix walls over a binary tree, the binary tree can be uniquely constructed.
asked Nov 27, 2016 in DS makhdoom ghaya 1.6k views
4 votes
1 answer
Answer the following: Which of the following statements are FALSE? For poisson distribution, the mean is twice the variance. In queuing theory, if arrivals occur according to poisson distribution, then the inter-arrival time is exponentially distributed. The ... the time between successive arrivals is exponential, then the time between the occurences of every third arrival is also exponential.
asked Nov 27, 2016 in Probability makhdoom ghaya 558 views
21 votes
2 answers
10 votes
6 answers
Answer the following: Which of the following well-formed formulas are equivalent? $P \rightarrow Q$ $\neg Q \rightarrow \neg P$ $\neg P \vee Q$ $\neg Q \rightarrow P$
asked Nov 27, 2016 in Mathematical Logic makhdoom ghaya 981 views
19 votes
2 answers
Answer the following questions: Which of the following problems are undecidable? Membership problem in context-free languages. Whether a given context-free language is regular. Whether a finite state automation halts on all inputs. Membership problem for type $0$ languages.
asked Nov 27, 2016 in Theory of Computation makhdoom ghaya 3.6k views
20 votes
6 answers
Context-free languages and regular languages are both closed under the operation (s) of : Union Intersection Concatenation Complementation
asked Nov 27, 2016 in Theory of Computation makhdoom ghaya 2.6k views
10 votes
4 answers
An unrestricted use of the "go to" statement is harmful because of which of the following reason (s): It makes it more difficult to verify programs. It makes programs more inefficient. It makes it more difficult to modify existing programs. It results in the compiler generating longer machine code.
asked Nov 27, 2016 in Programming makhdoom ghaya 1.2k views
21 votes
3 answers
15 votes
3 answers
Match the pairs in the following:$\begin{array}{ll|ll}\hline \text{(A)} & \text{$O (\log n)$} & \text{(p)} & \text{Heapsort} \\\hline \text{(B)} & \text{$O (n)$} & \text{(q)}& \text{Depth-first search} \\\hline \text{(C)}& \text{$ ... $} &\text{(s)} & \text{Selection of the $k^{th}$ smallest element in a set of $n$ elements} \\\hline \end{array}$
asked Nov 27, 2016 in Algorithms makhdoom ghaya 1.7k views
18 votes
2 answers
6 votes
1 answer
Match the pairs in the following questions: $\begin{array}{|l|l|l|} \hline \text {(A) Cyclic Redundancy Code} & \text {(p) Error Correction} \\\hline \text {(B) Serial Communication} & \text{(q) Wired-OR } \\\hline \text{(C) Open Collector} & \text{(r) Error detection} \\\hline \text{(D) Hamming Code} & \text{(s) RS-232-C} \\\hline \end{array}$
asked Nov 27, 2016 in Computer Networks makhdoom ghaya 990 views
7 votes
1 answer
Consider an excess - 50 representation for floating point numbers with $4 BCD$ digit mantissa and $2 BCD$ digit exponent in normalised form. The minimum and maximum positive numbers that can be represented are __________ and _____________ respectively.
asked Nov 27, 2016 in Digital Logic makhdoom ghaya 1.3k views
29 votes
1 answer
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given n) is ___________.
asked Nov 27, 2016 in Set Theory & Algebra makhdoom ghaya 2.4k views
14 votes
4 answers
The transitive closure of the relation $\left\{(1, 2), (2, 3), (3, 4), (5, 4)\right\}$ on the set $\left\{1, 2, 3, 4, 5\right\}$ is ___________.
asked Nov 27, 2016 in Set Theory & Algebra makhdoom ghaya 1.5k views
12 votes
3 answers
Merging states with a common core may produce __________ conflicts and does not produce ___________ conflicts in an LALR purser.
asked Nov 27, 2016 in Compiler Design makhdoom ghaya 1.4k views
14 votes
1 answer
In which of the following case(s) is it possible to obtain different results for call-by-reference and call-by-name parameter passing? Passing an expression as a parameter Passing an array as a parameter Passing a pointer as a parameter Passing as array element as a parameter
asked Jan 22, 2016 in Compiler Design Cruise Device 2k views
32 votes
3 answers
A hash table with ten buckets with one slot per bucket is shown in the following figure. The symbols $S1$ to $S7$ initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is $4$ $5$ $6$ $3$
asked Jun 1, 2015 in DS Anu 8.5k views