Recent questions tagged gate1988

Recent questions tagged gate1988

1 vote

0 answers

1

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 at the origins and the requirements at the destinations. The ... . For the solution of (ii) above, calculate the values of the duals and determine whether this is an optimal solution.

jothee asked in Others Dec 20, 2016

by jothee

274 views

0 votes

0 answers

2

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)$ ... known property of this norm. Although this norm is very easy to calculate for any matrix, explain why the condition number is difficult (i.e. expensive) to calculate.

jothee asked in Linear Algebra Dec 20, 2016

by jothee

292 views

5 votes

2 answers

3

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-triangular, and $P$ ... $L, U,$ and $P$ using Gaussian elimination with partial pivoting.

jothee asked in Linear Algebra Dec 20, 2016

by jothee

1.2k views

4 votes

1 answer

4

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?$ $F2=D?$ $M=(Q, \Sigma, \delta, q_0, F)$ $M_{2}=(Q2, \Sigma, \delta_2, q_{00}, F2)$ ... $D=\{\langle p, q, r \rangle \mid p \in Q; q \in F\}$

jothee asked in Theory of Computation Dec 20, 2016

by jothee

680 views

1 vote

0 answers

5

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-formed formula, given above, cannot be satisfied for any interpretation.

jothee asked in Mathematical Logic Dec 20, 2016

by jothee

300 views

1 vote

1 answer

6

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 clausal form.

jothee asked in Mathematical Logic Dec 20, 2016

by jothee

338 views

10 votes

4 answers

7

GATE CSE 1988 | Question: 13iv
Solve the recurrence equations: $T(n)= T( \frac{n}{2})+1$ $T(1)=1$

jothee asked in Algorithms Dec 20, 2016

by jothee

2k views

7 votes

3 answers

8

GATE CSE 1988 | Question: 13iii
Are the two digraphs shown in the above figure isomorphic? Justify your answer.

jothee asked in Graph Theory Dec 20, 2016

by jothee

693 views

19 votes

1 answer

9

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.

jothee asked in Set Theory & Algebra Dec 20, 2016

by jothee

1.4k views

1 vote

0 answers

10

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$.

jothee asked in Set Theory & Algebra Dec 20, 2016

by jothee

289 views

1 vote

0 answers

11

GATE CSE 1988 | Question: 13ib
Verify whether the following mapping is a homomorphism. If so, determine its kernel. $\overline{G}=G$

jothee asked in Graph Theory Dec 20, 2016

by jothee

242 views

1 vote

0 answers

12

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.

jothee asked in Set Theory & Algebra Dec 20, 2016

by jothee

228 views

3 votes

2 answers

13

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 least two attributes of each of these relations.

jothee asked in Databases Dec 20, 2016

by jothee

787 views

6 votes

3 answers

14

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 (select PNO from P Where COLOUR='BLUE'))

jothee asked in Databases Dec 20, 2016

by jothee

1k views

4 votes

1 answer

15

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 $y$ is functionally dependent on $x$, $z \subseteq y$ denotes $z$ is subset of $y$, and $\mid =$ means derives).

jothee asked in Databases Dec 20, 2016

by jothee

630 views

3 votes

1 answer

16

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$ denotes $y$ is functionally dependent on $x$, $z \subseteq y$ denotes $z$ is subset of $y$, and $\mid =$ means derives).

jothee asked in Databases Dec 20, 2016

by jothee

553 views

5 votes

1 answer

17

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$ denotes $y$ is functionally dependent on $x$, $z \subseteq y$ denotes $z$ is subset of $y$, and $\mid =$ means derives).

jothee asked in Databases Dec 19, 2016

by jothee

687 views

6 votes

1 answer

18

GATE CSE 1988 | Question: 12i
What are the three axioms of functional dependency for the relational databases given by Armstrong.

jothee asked in Databases Dec 19, 2016

by jothee

930 views

5 votes

4 answers

19

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 processes and let there be four resources types $r_j, 0 \leq j \leq 3$. Suppose the following ... Is the system currently in a safe state? If yes, explain why.

jothee asked in Operating System Dec 19, 2016

by jothee

1.5k views

8 votes

2 answers

20

GATE CSE 1988 | Question: 10iib
Given below is solution for the critical section problem of two processes $P_0$ and $P_1$ ... until false Determine of the above solution is correct. If it is incorrect, demonstrate with an example how it violates the conditions.

jothee asked in Operating System Dec 19, 2016

by jothee

1.8k views

1 vote

1 answer

21

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; while turn !=i do begin while flag[j] do skip turn:=i; end critical section flag[i]:=false; until false Program Test; ... 1...10] of real; begin i:=0; While i:<=10 do begin a[i]:=0; i:=i+1 end; end.

jothee asked in Compiler Design Dec 19, 2016

by jothee

530 views

2 votes

2 answers

22

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 of the $\text{LR(0)}$ parser.

jothee asked in Compiler Design Dec 19, 2016

by jothee

829 views

8 votes

2 answers

23

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 its goto graph.

jothee asked in Compiler Design Dec 19, 2016

by jothee

1.4k views

8 votes

1 answer

24

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. ...

jothee asked in CO and Architecture Dec 19, 2016

by jothee

1.9k views

1 vote

0 answers

25

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 below Note-that $SP$ is the stack pointer and $R_i$ represents $i^{th}$ ...

jothee asked in CO and Architecture Dec 19, 2016

by jothee

264 views

3 votes

3 answers

26

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 T2 ADD T1 STORE Z Give the arithmetic expression implemented by the fragment.

jothee asked in CO and Architecture Dec 19, 2016

by jothee

967 views

1 vote

0 answers

27

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; exception when BAD-Format => ... handler body 1 end R; begin R; Q; exception when BAD-FORMAT => ... handler body 2 end P; Under what conditions are the two handler bodies $1$ and $2$ executed?

jothee asked in Programming Dec 19, 2016

by jothee

237 views

0 votes

0 answers

28

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.

jothee asked in Programming Dec 19, 2016

by jothee

195 views

4 votes

2 answers

29

GATE CSE 1988 | Question: 8ii
Consider the two program segments below: for i:=1 to f(x) by 1 do S end i:=1; While i<=f(x) do S i:=i+1 end Under what conditions are these two programs equivalent? Treat $S$ as any sequence of statements and $f$ as a function.

jothee asked in Programming Dec 19, 2016

by jothee

1.3k views

3 votes

1 answer

30

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 an array and i an integer, is implemented as below. create a new local variable, ... P using z for k; set A [i] to z; Explain your answer. If this is incorrect implementation, suggest a correct one.

jothee asked in Compiler Design Dec 19, 2016

by jothee

1k views

Page:

1
2
3
next »

Follow @gateoverflow

GATE Overflow

Recent questions tagged gate1988

Search GATE Overflow