Register
Filter

Questions by Kathleen

22 votes
3 answers
91
GATE CSE 1995 | Question: 13
Obtain the principal (canonical) conjunctive normal form of the propositional formula $(p \wedge q) \vee (\neg q \wedge r)$ where $\wedge$ is logical and, $\vee$ is inclusive or and $\neg$ is negation.
Obtain the principal (canonical) conjunctive normal form of the propositional formula $$(p \wedge q) \vee (\neg q \wedge r)$$ where $\wedge$ is logical and, $\vee$ is inc...
18 votes
2 answers
92
GATE CSE 1995 | Question: 12
Consider the following sequence of numbers:$92, 37, 52, 12, 11, 25$ Use Bubble sort to arrange the sequence in ascending order. Give the sequence at the end of each of the first five passes.
Consider the following sequence of numbers:$$92, 37, 52, 12, 11, 25$$ Use Bubble sort to arrange the sequence in ascending order. Give the sequence at the end of each of ...
0 votes
0 answers
94
GATE CSE 1995 | Question: 10
23 votes
4 answers
95
GATE CSE 1995 | Question: 9
Translate the arithmetic expression $a^\ast -(b+c)$ into syntax tree. A grammar is said to have cycles if it is the case that $A \overset{+}{\Rightarrow} A$ Show that no grammar that has cycles can be $\text{LL(1)}.$
Translate the arithmetic expression $a^\ast -(b+c)$ into syntax tree.A grammar is said to have cycles if it is the case that $A \overset{+}{\Rightarrow} A$ Show that no g...
6 votes
2 answers
97
GATE CSE 1995 | Question: 7(A)
Determine the number of divisors of $600.$
Determine the number of divisors of $600.$
23 votes
2 answers
101
GATE CSE 1995 | Question: 2.25
A computer system has a $4 \ K$ word cache organized in block-set-associative manner with $4$ blocks per set, $64$ words per block. The number of bits in the SET and WORD fields of the main memory address format is: $15, 40$ $6, 4$ $7, 2$ $4, 6$
A computer system has a $4 \ K$ word cache organized in block-set-associative manner with $4$ blocks per set, $64$ words per block. The number of bits in the SET and WORD...
26 votes
5 answers
102
GATE CSE 1995 | Question: 2.24
Let $\Sigma=\left\{0,1\right\}, L = \Sigma^*$ and $R=\left\{0^n1^n \mid n > 0\right\} $ then the languages $L \cup R$ and $R$ are respectively regular, regular not regular, regular regular, not regular not regular, not regular
Let $\Sigma=\left\{0,1\right\}, L = \Sigma^*$ and $R=\left\{0^n1^n \mid n 0\right\} $ then the languages $L \cup R$ and $R$ are respectivelyregular, regularnot regular, ...
41 votes
5 answers
103
GATE CSE 1995 | Question: 2.23
A finite state machine with the following state table has a single input $x$ and a single out $z$ ... $C$ is: $01$ $10$ $101$ $110$
A finite state machine with the following state table has a single input $x$ and a single out $z$.$$\begin{array}{|c|ll|}\hline\textbf{present state} & \qquad \textbf{nex...
49 votes
7 answers
105
GATE CSE 1995 | Question: 2.21
The postfix expression for the infix expression $A+B*(C+D)/F+D*E$ is: $AB + CD + *F/D +E*$ $ABCD + *F/DE* ++$ $A * B + CD/F *DE ++$ $A + *BCD/F* DE ++$
The postfix expression for the infix expression $A+B*(C+D)/F+D*E$ is:$AB + CD + *F/D +E*$$ABCD + *F/DE* ++$$A * B + CD/F *DE ++$$A + *BCD/F* DE ++$
32 votes
8 answers
106
GATE CSE 1995 | Question: 2.20
Which of the following definitions below generate the same language as $L$, where $L=\{x^ny^n \text{ such that } n\geq 1 \}$? $E \rightarrow xEy\mid xy$ $x y \mid (x^+xyy^+$) $x^+y^+$ I only I and II II and III II only
Which of the following definitions below generate the same language as $L$, where $L=\{x^ny^n \text{ such that } n\geq 1 \}$?$E \rightarrow xEy\mid xy$$x y \mid (x^+xyy^+...
42 votes
4 answers
107
GATE CSE 1995 | Question: 2.19
If the proposition $\lnot p \to q$ is true, then the truth value of the proposition $\lnot p \lor \left ( p \to q \right )$, where $\lnot$ is negation, $\lor$ is inclusive OR and $\to$ is implication, is True Multiple Values False Cannot be determined
If the proposition $\lnot p \to q$ is true, then the truth value of the proposition $\lnot p \lor \left ( p \to q \right )$, where $\lnot$ is negation, $\lor$ is inclusiv...
1 votes
1 answer
108
GATE CSE 1995 | Question: 2.18
The solution of differential equation $y''+3y'+2y=0$ is of the form $C_1e^x+C_2e^{2x}$ $C_1e^{-x}+C_2e^{3x}$ $C_1e^{-x}+C_2e^{-2x}$ $C_1e^{-2x}+C_2e^{-x}$
The solution of differential equation $y''+3y'+2y=0$ is of the form$C_1e^x+C_2e^{2x}$$C_1e^{-x}+C_2e^{3x}$$C_1e^{-x}+C_2e^{-2x}$$C_1e^{-2x}+C_2e^{-x}$
25 votes
3 answers
110
GATE CSE 1995 | Question: 2.16
In a virtual memory system the address space specified by the address lines of the CPU must be _____ than the physical memory size and ____ than the secondary storage size. smaller, smaller smaller, larger larger, smaller larger, larger
In a virtual memory system the address space specified by the address lines of the CPU must be _____ than the physical memory size and ____ than the secondary storage siz...
Page: