Register

Recent questions tagged gate1995

4 votes
1 answer
1
GATE CSE 1995 | Question: 7(B)
Compute without using power series expansion $\displaystyle \lim_{x \to 0} \frac{\sin x}{x}.$
Compute without using power series expansion $\displaystyle \lim_{x \to 0} \frac{\sin x}{x}.$
User Avatar
0 votes
0 answers
2
GATE CSE 1995 | Question: 17b
Consider a CRT display that has a text mode display format of $80×25$ characters with a $9×12$ character cell. What is the size of the video buffer RAM for the display to be used in monochrome ($1$ bit per pixel) graphics mode
Consider a CRT display that has a text mode display format of $80×25$ characters with a $9×12$ character cell. What is the size of the video buffer RAM for the display ...
User Avatar
20 votes
2 answers
3
GATE CSE 1995 | Question: 25b
Determine the number of positive integers $(\leq 720)$ which are not divisible by any of $2,3$ or $5.$
Determine the number of positive integers $(\leq 720)$ which are not divisible by any of $2,3$ or $5.$
User Avatar
8 votes
1 answer
4
GATE CSE 1995 | Question: 15-b
What is the equivalent minimal Boolean expression (in sum of products form) for the Karnaugh map given below?
What is the equivalent minimal Boolean expression (in sum of products form) for the Karnaugh map given below?
User Avatar
25 votes
3 answers
5
GATE CSE 1995 | Question: 6
What is the number of binary trees with $3$ nodes which when traversed in post-order give the sequence $A, B, C ?$ Draw all these binary trees.
What is the number of binary trees with $3$ nodes which when traversed in post-order give the sequence $A, B, C ?$ Draw all these binary trees.
User Avatar
24 votes
3 answers
6
GATE CSE 1995 | Question: 27
Consider the relation scheme. ... for the publisher with PNAME='TECHNICAL PUBLISHERS'. Get the names of all authors who have published a book for any publisher located in Madras
Consider the relation scheme.$$\begin{array}{ll} \text{AUTHOR} & \text{(ANAME, INSTITUTION, ACITY, AGE)} \\\hline \text{PUBLISHER} & \text{(PNAME, PCITY)} \\\hline \te...
User Avatar
28 votes
7 answers
7
GATE CSE 1995 | Question: 26
Consider the relation scheme $R(A, B, C)$ with the following functional dependencies: $A, B \rightarrow C,$ $C \rightarrow A$ Show that the scheme $R$ is in $3\text{NF}$ but not in $\text{BCNF}$. Determine the minimal keys of relation $R$.
Consider the relation scheme $R(A, B, C)$ with the following functional dependencies:$A, B \rightarrow C,$$C \rightarrow A$Show that the scheme $R$ is in $3\text{NF}$ but...
User Avatar
13 votes
1 answer
8
GATE CSE 1995 | Question: 25a
Find the minimum value of $3-4x+2x^2$.
Find the minimum value of $3-4x+2x^2$.
User Avatar
19 votes
3 answers
9
GATE CSE 1995 | Question: 24
Prove that in finite graph, the number of vertices of odd degree is always even.
Prove that in finite graph, the number of vertices of odd degree is always even.
User Avatar
16 votes
1 answer
11
GATE CSE 1995 | Question: 22
How many minimum spanning trees does the following graph have? Draw them. (Weights are assigned to edges).
How many minimum spanning trees does the following graph have? Draw them. (Weights are assigned to edges).
User Avatar
27 votes
5 answers
12
GATE CSE 1995 | Question: 21
Let $G_1$ and $G_2$ be subgroups of a group $G$. Show that $G_1 \cap G_2$ is also a subgroup of $G$. Is $G_1 \cup G_2$ always a subgroup of $G$?.
Let $G_1$ and $G_2$ be subgroups of a group $G$.Show that $G_1 \cap G_2$ is also a subgroup of $G$.Is $G_1 \cup G_2$ always a subgroup of $G$?.
User Avatar
14 votes
2 answers
18
GATE CSE 1995 | Question: 15-a
Implement a circuit having the following output expression using an inverter and a nand gate $Z=\overline{A} + \overline{B} +C$
Implement a circuit having the following output expression using an inverter and a nand gate $$Z=\overline{A} + \overline{B} +C$$
User Avatar
22 votes
3 answers
20
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...
User Avatar
18 votes
2 answers
21
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 ...
User Avatar
0 votes
0 answers
23
GATE CSE 1995 | Question: 10
User Avatar
23 votes
4 answers
24
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...
User Avatar
23 votes
2 answers
30
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...
User Avatar
Page: