Register
GATE 1988 Computer Science Questions

Recent questions tagged gate1988

2 2 votes
0 0 answers
963
963 views
GATE CSE 1988 | Question: 17i-ii-iii
The following table gives the cost of transporting one tonne of goods from the origins A, B, C to the destinations F, G, H. Also shown are the availabilities of the goods...
User Avatar
1 1 vote
0 0 answers
1.4k
1.4k views
GATE CSE 1988 | Question: 16ii-iii
If $x \| \underline{x} \| \infty = 1< i^{max} < n \: \: max \: \: ( \mid x1 \mid ) $ for the vector $\underline{x} = (x1, x2 \dots x_n)$ and $\| A \| \infty = x^{Sup} \fr...
User Avatar
24 24 votes
4 4 answers
8.3k
8.3k views
GATE CSE 1988 | Question: 16i
Assume that the matrix $A$ given below, has factorization of the form $LU=PA$, where $L$ is lower-triangular with all diagonal elements equal to $1, U$ is upper-triangula...
User Avatar
22 22 votes
4 answers 4 answers
7.3k
7.3k views
GATE CSE 1988 | Question: 15
Consider the DFA $M$ and NFA $M_{2}$ as defined below. Let the language accepted by machine $M$ be $L$. What language machine $M_{2}$ accepts, if$F2=A?$$F2=B?$$F2=C?$$...
User Avatar
3 3 votes
1 1 answer
1.3k
1.3k views
GATE CSE 1988 | Question: 14ii
Consider the following well-formed formula:$\exists x \forall y [ \neg \exists z [ p (y, z) \wedge p (z, y) ] \equiv p(x,y)]$Show using resolution principle that the well...
User Avatar
1 1 vote
1 1 answer
1.5k
1.5k views
GATE CSE 1988 | Question: 14i
Consider the following well-formed formula:$\exists x \forall y [ \neg \: \exists z [ p (y, z) \wedge p (z, y) ] \equiv p(x,y)]$Express the above well-formed formula in c...
User Avatar
20 20 votes
6 answers 6 answers
6.5k
6.5k views
GATE CSE 1988 | Question: 13iv
Solve the recurrence equations:$T(n)= T( \frac{n}{2})+1$$T(1)=1$
User Avatar
9 9 votes
3 answers 3 answers
2.1k
2.1k views
GATE CSE 1988 | Question: 13iii
Are the two digraphs shown in the above figure isomorphic? Justify your answer.
User Avatar
32 32 votes
2 answers 2 answers
5.6k
5.6k views
GATE CSE 1988 | Question: 13ii
If the set $S$ has a finite number of elements, prove that if $f$ maps $S$ onto $S$, then $f$ is one-to-one.
User Avatar
1 1 vote
1 1 answer
1.1k
1.1k views
GATE CSE 1988 | Question: 13ic
Verify whether the following mapping is a homomorphism. If so, determine its kernel.$f(x)=x^3$, for all $x$ belonging to $G$.
User Avatar
3 3 votes
0 0 answers
865
865 views
GATE CSE 1988 | Question: 13ib
Verify whether the following mapping is a homomorphism. If so, determine its kernel.$\overline{G}=G$
User Avatar
1 1 vote
0 0 answers
736
736 views
GATE CSE 1988 | Question: 13ia
Verify whether the following mapping is a homomorphism. If so, determine its kernel.$G$ is the group of non zero real numbers under multiplication.
User Avatar
7 7 votes
4 answers 4 answers
3.1k
3.1k views
GATE CSE 1988 | Question: 12iv
Select SNAME from S Where SNOin (select SNO from SP where PNOin (select PNO from P Where COLOUR='BLUE'))What relations are being used in the above SQL query? Given at lea...
User Avatar
19 19 votes
5 answers 5 answers
5.1k
5.1k views
GATE CSE 1988 | Question: 12iii
Describe the relational algebraic expression giving the relation returned by the following SQL query.Select SNAME from S Where SNOin (select SNO from SP where PNOin (sele...
User Avatar
15 15 votes
1 answers 1 answer
3.3k
3.3k views
GATE CSE 1988 | Question: 12iic
Using Armstrong’s axioms of functional dependency derive the following rules:$\{ x \rightarrow y, \: z \subset y \} \mid= x \rightarrow z$(Note: $x \rightarrow y$ denotes...
User Avatar
11 11 votes
2 answers 2 answers
2.6k
2.6k views
GATE CSE 1988 | Question: 12iib
Using Armstrong’s axioms of functional dependency derive the following rules:$\{ x \rightarrow y, \: wy \rightarrow z \} \mid= xw \rightarrow z$(Note: $x \rightarrow y$ d...
User Avatar
18 18 votes
1 answers 1 answer
3.8k
3.8k views
GATE CSE 1988 | Question: 12iia
Using Armstrong’s axioms of functional dependency derive the following rules:$\{ x \rightarrow y, \: x \rightarrow z \} \mid= x \rightarrow yz$(Note: $x \rightarrow y$ de...
User Avatar
19 19 votes
1 answers 1 answer
4.7k
4.7k views
GATE CSE 1988 | Question: 12i
What are the three axioms of functional dependency for the relational databases given by Armstrong.
User Avatar
10 10 votes
4 answers 4 answers
5.9k
5.9k views
GATE CSE 1988 | Question: 11
A number of processes could be in a deadlock state if none of them can execute due to non-availability of sufficient resources. Let $P_i, 0 \leq i \leq 4$ represent five...
User Avatar
37 37 votes
4 answers 4 answers
10.9k
10.9k views
GATE CSE 1988 | Question: 10iib
Given below is solution for the critical section problem of two processes $P_0$ and $P_1$ sharing the following variables:var flag :array [0..1] of boolean; (initially fa...
User Avatar
1 1 vote
1 1 answer
1.3k
1.3k views
GATE CSE 1988 | Question: 10iia
Translate the executable statements of the following Pascal Program into quadruples. Assume that integer and real values require four words each.repeat flag[i]:=true; whi...
User Avatar
10 10 votes
3 answers 3 answers
5.6k
5.6k views
GATE CSE 1988 | Question: 10ib
Consider the following grammar:$S \rightarrow S$$S \rightarrow SS \mid a \mid \epsilon$Indicate the shift-reduce and reduce-reduce conflict (if any) in the various states...
User Avatar
17 17 votes
3 answers 3 answers
8.0k
8.0k views
GATE CSE 1988 | Question: 10ia
Consider the following grammar:$S \rightarrow S$$S \rightarrow SS \mid a \mid \epsilon$Construct the collection of sets of $\text{LR (0)}$ items for this grammar and draw...
User Avatar
26 26 votes
3 3 answers
8.7k
8.7k views
GATE CSE 1988 | Question: 9iii
In the program scheme given below indicate the instructions containing any operand needing relocation for position independent behaviour. Justify your answer.$$\begin{arr...
User Avatar
1 1 vote
0 0 answers
848
848 views
GATE CSE 1988 | Question: 9ii
The code for the implementation of a sub-routine to convert positive numeric data from binary to appropriate character string in a $PDP-11$ like machine has been given be...
User Avatar
14 14 votes
4 answers 4 answers
3.7k
3.7k views
GATE CSE 1988 | Question: 9i
The following program fragment was written in an assembly language for a single address computer with one accumulator register:LOAD B MULT C STORE T1 ADD A STORE T2 MULT ...
User Avatar
1 1 vote
0 0 answers
865
865 views
GATE CSE 1988 | Question: 8iv
Consider the following Ada program:Procedure P is BAD-FORMAT: exception Procedure Q is begin ... if S/='b' then raise BAD-FORMAT end if; ... end Q; Procedure R is begin Q...
User Avatar
0 0 votes
1 1 answer
853
853 views
GATE CSE 1988 | Question: 8iii
Write a LISP function to compute the product of all the numbers in a list. Assume that the list contains only number.
User Avatar
12 12 votes
3 3 answers
4.6k
4.6k views
GATE CSE 1988 | Question: 8ii
Consider the two program segments below:for i:=1 to f(x) by 1 do S endi:=1; While i<=f(x) do S i:=i+1 endUnder what conditions are these two programs equivalent? Treat $S...
User Avatar
8 8 votes
1 1 answer
3.3k
3.3k views
GATE CSE 1988 | Question: 8i
Consider the procedure declaration:Procedure P (k: integer)where the parameter passing mechanism is call-by-value-result. Is it correct if the call, P (A[i]), where A is ...
User Avatar
Page: