Dark Mode

Recent questions tagged gate1997

31 votes

2 answers

31

GATE CSE 1997 | Question: 6.10, ISRO2016-54
Let $R (a, b, c)$ and $S(d, e, f)$ be two relations in which $d$ is the foreign key of $S$ that refers to the primary key of $R$. Consider the following four operations $R$ and $S$ Insert into $R$ Insert ... Which of the following can cause violation of the referential integrity constraint above? Both I and IV Both II and III All of these None of these

Kathleen asked in Databases Sep 29, 2014

10.0k views

29 votes

2 answers

32

GATE CSE 1997 | Question: 6.9
For a database relation $R(a, b, c, d)$, where the domains $a, b, c, d$ include only atomic values, only the following functional dependencies and those that can be inferred from them hold $a \rightarrow c$ $b \rightarrow d$ This ... normal form but not in second normal form in second normal form but not in first normal form in third normal form none of the above

Kathleen asked in Databases Sep 29, 2014

11.7k views

50 votes

13 answers

33

GATE CSE 1997 | Question: 6.8
Each Process $P_i, i = 1\ldots 9$ is coded as follows repeat P(mutex) {Critical section} V(mutex) forever The code for $P_{10}$ is identical except it uses V(mutex) in place of P(mutex). What is the largest number of processes that can be inside the critical section at any moment? $1$ $2$ $3$ None

Kathleen asked in Operating System Sep 29, 2014

24.7k views

25 votes

6 answers

34

GATE CSE 1997 | Question: 6.7
An operating system contains $3$ user processes each requiring $2$ units of resource $R$. The minimum number of units of $R$ such that no deadlocks will ever arise is $3$ $5$ $4$ $6$

Kathleen asked in Operating System Sep 29, 2014

17.5k views

25 votes

4 answers

35

GATE CSE 1997 | Question: 6.6
Which of the following languages over $\left\{a,b,c\right\}$ is accepted by a deterministic pushdown automata? $\left\{ wcw^R \mid w \in \left\{a,b\right\}^*\right\}$ $\left\{ ww^R \mid w \in \{a,b,c\}^*\right\}$ ... $w^R$ is the string obtained by reversing $'w'$.

Kathleen asked in Theory of Computation Sep 29, 2014

10.6k views

34 votes

4 answers

36

GATE CSE 1997 | Question: 6.5
Which one of the following is not decidable? Given a Turing machine $M$, a string $s$ and an integer $k$, $M$ accepts $s$ within $k$ steps Equivalence of two given Turing machines Language accepted by a given finite state machine is not empty Language generated by a context free grammar is non-empty

Kathleen asked in Theory of Computation Sep 29, 2014

10.1k views

64 votes

8 answers

37

GATE CSE 1997 | Question: 6.4
Which one of the following regular expressions over $\{0,1\}$ denotes the set of all strings not containing $\text{100}$ as substring? $0^*(1+0)^*$ $0^*1010^*$ $0^*1^*01^*$ $0^*(10+1)^*$

Kathleen asked in Theory of Computation Sep 29, 2014

37.3k views

54 votes

6 answers

38

GATE CSE 1997 | Question: 6.3
The number of equivalence relations of the set $\{1,2,3,4\}$ is $15$ $16$ $24$ $4$

Kathleen asked in Set Theory & Algebra Sep 29, 2014

21.2k views

45 votes

6 answers

39

GATE CSE 1997 | Question: 6.2
Let $G$ be the graph with $100$ vertices numbered $1$ to $100$. Two vertices $i$ and $j$ are adjacent if $\vert i-j \vert =8$ or $\vert i-j \vert=12$. The number of connected components in $G$ is $8$ $4$ $12$ $25$

Kathleen asked in DS Sep 29, 2014

8.9k views

42 votes

2 answers

40

GATE CSE 1997 | Question: 6.1
A partial order $≤$ is defined on the set $S=\left \{ x, a_1, a_2, \ldots, a_n, y \right \}$ as $x$ $\leq _{i}$ $a_{i}$ for all $i$ and $a_{i}\leq y$ for all $i$, where $n ≥ 1$. The number of total orders on the set S which contain the partial order $≤$ is $n!$ $n+2$ $n$ $1$

Kathleen asked in Set Theory & Algebra Sep 29, 2014

8.9k views

22 votes

1 answer

41

GATE CSE 1997 | Question: 5.5
Consider a logic circuit shown in figure below. The functions $f_1, f_2 \text{ and } f$ (in canonical sum of products form in decimal notation) are : $f_1 (w, x, y, z) = \sum 8, 9, 10$ $f_2 (w, x, y, z) = \sum 7, 8, 12, 13, 14, 15$ $f (w, x, y, z) = \sum 8, 9$ The function $f_3$ is $\sum 9, 10$ $\sum 9$ $\sum 1, 8, 9$ $\sum 8, 10, 15$

Kathleen asked in Digital Logic Sep 29, 2014

6.2k views

27 votes

2 answers

42

GATE CSE 1997 | Question: 5.4
Given $\sqrt{(224)_r} =(13)_r$. The value of the radix $r$ is: $10$ $8$ $5$ $6$

Kathleen asked in Digital Logic Sep 29, 2014

11.7k views

35 votes

3 answers

43

GATE CSE 1997 | Question: 5.3
A micro instruction is to be designed to specify: none or one of the three micro operations of one kind and none or upto six micro operations of another kind The minimum number of bits in the micro-instruction is: $9$ $5$ $8$ None of the above

Kathleen asked in CO and Architecture Sep 29, 2014

11.4k views

3 votes

1 answer

44

GATE CSE 1997 | Question: 5.2
Contents of A register after the execution of the following 8085 microprocessor program is MVIA, 55 H MVI C, 25 H ADDC DAA 7AH 80H 50H 22H

Kathleen asked in CO and Architecture Sep 29, 2014

6.1k views

39 votes

9 answers

45

GATE CSE 1997 | Question: 5.1
Let $f(x, y, z)=\bar{x} + \bar{y}x + xz$ be a switching function. Which one of the following is valid? $\bar{y} x$ is a prime implicant of $f$ $xz$ is a minterm of $f$ $xz$ is an implicant of $f$ $y$ is a prime implicant of $f$

Kathleen asked in Digital Logic Sep 29, 2014

15.7k views

0 votes

1 answer

46

GATE CSE 1997 | Question: 4.10
The trapezoidal method to numerically obtain $\int_a^b f(x) dx$ has an error E bounded by $\frac{b-a}{12} h^2 \max f’’(x), x \in [a, b]$ where $h$ is the width of the trapezoids. The minimum number of trapezoids guaranteed to ensure $E \leq 10^{-4}$ in computing $\ln 7$ using $f=\frac{1}{x}$ is 60 100 600 10000

Kathleen asked in Numerical Methods Sep 29, 2014

1.5k views

24 votes

2 answers

47

GATE CSE 1997 | Question: 4.9
The expression $( a * b) * c \; op \dots$ where ‘op’ is one of ‘$+$’, ‘$*$’ and ‘$\uparrow$’ (exponentiation) can be evaluated on a CPU with single register without storing the value of ($a * b$) if $\text{‘op’}$ is ‘$+$’ or ‘$*$’ $\text{‘op’}$ is ‘$\uparrow$’ or ‘$*$’ $\text{‘op’}$ is ‘$\uparrow$’ or ‘$+$’ not possible to evaluate without storing

Kathleen asked in Compiler Design Sep 29, 2014

5.0k views

0 votes

0 answers

48

GATE CSE 1997 | Question: 4.8

Kathleen asked in Others Sep 29, 2014

538 views

56 votes

5 answers

49

GATE CSE 1997 | Question: 4.7
A priority queue $Q$ is used to implement a stack that stores characters. PUSH (C) is implemented as INSERT $(Q, C, K)$ where $K$ is an appropriate integer key chosen by the implementation. POP is implemented as ... For a sequence of operations, the keys chosen are in non-increasing order non-decreasing order strictly increasing order strictly decreasing order

Kathleen asked in DS Sep 29, 2014

24.4k views

21 votes

1 answer

50

GATE CSE 1997 | Question: 4.6
Let $T(n)$ be the function defined by $T(1) =1, \: T(n) = 2T (\lfloor \frac{n}{2} \rfloor ) + \sqrt{n}$ for $n \geq 2$. Which of the following statements is true? $T(n) = O \sqrt{n}$ $T(n)=O(n)$ $T(n) = O (\log n)$ None of the above

Kathleen asked in Algorithms Sep 29, 2014

4.8k views

48 votes

7 answers

51

GATE CSE 1997 | Question: 4.5
A binary search tree contains the value $1, 2, 3, 4, 5, 6, 7, 8$. The tree is traversed in pre-order and the values are printed out. Which of the following sequences is a valid output? $5 \ 3 \ 1 \ 2 \ 4 \ 7 \ 8 \ 6$ $5 \ 3 \ 1 \ 2 \ 6 \ 4 \ 8 \ 7$ $5 \ 3 \ 2 \ 4 \ 1 \ 6 \ 7 \ 8$ $5 \ 3 \ 1 \ 2 \ 4 \ 7 \ 6 \ 8$

Kathleen asked in DS Sep 29, 2014

37.3k views

27 votes

4 answers

52

GATE CSE 1997 | Question: 4.4
A polynomial $p(x)$ is such that $p(0) = 5, p(1) = 4, p(2) = 9$ and $p(3) = 20$. The minimum degree it should have is $1$ $2$ $3$ $4$

Kathleen asked in Set Theory & Algebra Sep 29, 2014

6.8k views

0 votes

0 answers

53

GATE CSE 1997 | Question: 4.3
Using the forward Euler method to solve $y’'(t) = f(t), y’(0)=0$ with a step size of $h$, we obtain the following values of $y$ in the first four iterations: $0, hf (0), h(f(0) + f(h)) \text{ and }h(f(0) - f(h) + f(2h))$ $0, 0, h^2f(0)\text{ and } 2h^2 f(0) + f(h)$ $0, 0, h^2f(0) \text{ and } 3h^2f(0)$ $0, 0, hf(0) + h^2f(0) \text{ and }hf (0) + h^2f(0) + hf(h)$

Kathleen asked in Numerical Methods Sep 29, 2014

669 views

23 votes

7 answers

54

GATE CSE 1997 | Question: 4.2
Let $A=(a_{ij})$ be an $n$-rowed square matrix and $I_{12}$ be the matrix obtained by interchanging the first and second rows of the $n$-rowed Identity matrix. Then $AI_{12}$ is such that its first Row is the same as its second row Row is the same as the second row of $A$ Column is the same as the second column of $A$ Row is all zero

Kathleen asked in Linear Algebra Sep 29, 2014

4.9k views

10 votes

4 answers

55

GATE CSE 1997 | Question: 4.1
What is the maximum value of the function $f(x) = 2x^2 - 2x + 6$ in the interval $\left[0,2 \right]$? 6 10 12 5.5

Kathleen asked in Calculus Sep 29, 2014

5.8k views

34 votes

3 answers

56

GATE CSE 1997 | Question: 3.10, ISRO2008-57, ISRO2015-64
Dirty bit for a page in a page table helps avoid unnecessary writes on a paging device helps maintain LRU information allows only read on a page None of the above

Kathleen asked in Operating System Sep 29, 2014

11.0k views

32 votes

4 answers

57

GATE CSE 1997 | Question: 3.9
Thrashing reduces page I/O decreases the degree of multiprogramming implies excessive page I/O improve the system performance

Kathleen asked in Operating System Sep 29, 2014

13.2k views

48 votes

4 answers

58

GATE CSE 1997 | Question: 3.8
When an interrupt occurs, an operating system ignores the interrupt always changes state of interrupted process after processing the interrupt always resumes execution of interrupted process after processing the interrupt may change state of interrupted process to ‘blocked’ and schedule another process.

Kathleen asked in Operating System Sep 29, 2014

13.8k views

32 votes

2 answers

59

GATE CSE 1997 | Question: 3.7
I/O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting $2$ programs through a pipe None of the above

Kathleen asked in Operating System Sep 29, 2014

8.6k views

24 votes

3 answers

60

GATE CSE 1997 | Question: 3.6
The correct matching for the following pairs is: ... $\text{A-4 B-3 C-2 D-1}$ $\text{A-2 B-4 C-1 D-3}$ $\text{A-3 B-4 C-3 D-2}$

Kathleen asked in Operating System Sep 29, 2014

5.7k views

Page:

Recent questions tagged gate1997