Dark Mode

Recent questions tagged gate1997

25 votes

2 answers

61

GATE CSE 1997 | Question: 3.5
Locality of reference implies that the page reference being made by a process will always be to the page used in the previous page reference is likely to be to one of the pages used in the last few page references will always be to one of the pages existing in memory will always lead to a page fault

Kathleen asked in Operating System Sep 29, 2014

9.4k views

38 votes

5 answers

62

GATE CSE 1997 | Question: 3.4
Given $\Sigma=\{a,b\}$, which one of the following sets is not countable? Set of all strings over $\Sigma$ Set of all languages over $\Sigma$ Set of all regular languages over $\Sigma$ Set of all languages over $\Sigma$ accepted by Turing machines

Kathleen asked in Theory of Computation Sep 29, 2014

12.3k views

24 votes

4 answers

63

GATE CSE 1997 | Question: 3.3
In the lattice defined by the Hasse diagram given in following figure, how many complements does the element ‘$e$’ have? $2$ $3$ $0$ $1$

Kathleen asked in Set Theory & Algebra Sep 29, 2014

7.5k views

17 votes

3 answers

64

GATE CSE 1997 | Question: 3.2
Which of the following propositions is a tautology? $(p \vee q) \rightarrow p$ $p \vee (q \rightarrow p)$ $p \vee (p \rightarrow q)$ $p \rightarrow (p \rightarrow q)$

Kathleen asked in Mathematical Logic Sep 29, 2014

6.1k views

24 votes

6 answers

65

GATE CSE 1997 | Question: 3.1
Let $\left(Z, *\right)$ be an algebraic structure where $Z$ is the set of integers and the operation $*$ is defined by $n*m = \max(n,m)$. Which of the following statements is true for $\left(Z, *\right)$? $\left(Z, *\right)$ is a monoid $\left(Z, *\right)$ is an Abelian group $\left(Z, *\right)$ is a group None of the above

Kathleen asked in Set Theory & Algebra Sep 29, 2014

13.4k views

37 votes

5 answers

66

GATE CSE 1997 | Question: 2.5
An N-bit carry lookahead adder, where $N$ is a multiple of $4$, employs ICs $74181$ ($4$ bit ALU) and $74182$ ( $4$ bit carry lookahead generator). The minimum addition time using the best architecture for this adder is proportional to $N$ proportional to $\log N$ a constant None of the above

Kathleen asked in Digital Logic Sep 29, 2014

9.6k views

16 votes

3 answers

67

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

Kathleen asked in CO and Architecture Sep 29, 2014

7.6k views

11 votes

3 answers

68

GATE CSE 1997 | Question: 2.3
Purpose of a start bit in $\text{RS-232}$ serial communication protocol is: to synchronize receiver for receiving every byte to synchronize receiver for receiving a sequence of bytes a parity bit to synchronize receiver for receiving the last byte

Kathleen asked in Computer Networks Sep 29, 2014

4.0k views

1 vote

1 answer

69

GATE CSE 1997 | Question: 2.2
RST 7.5 interrupt in 8085 microprocessor executes the interrupt service routing from interrupt vector location 0000H 0075H 003CH 0034H

Kathleen asked in CO and Architecture Sep 29, 2014

3.0k views

27 votes

4 answers

70

GATE CSE 1997 | Question: 2-1
Let $*$ be defined as $x * y = \bar{x} + y$. Let $z = x * y$. Value of $z * x$ is $\bar{x} + y$ $x$ $0$ $1$

Kathleen asked in Digital Logic Sep 29, 2014

5.3k views

19 votes

4 answers

71

GATE CSE 1997 | Question: 1.10
Heap allocation is required for languages. that support recursion that support dynamic data structure that use dynamic scope rules None of the above

Kathleen asked in Compiler Design Sep 29, 2014

7.1k views

16 votes

2 answers

72

GATE CSE 1997 | Question: 1.9
The conditional expansion facility of macro processor is provided to test a condition during the execution of the expanded program to expand certain model statements depending upon the value of a condition during the execution of the expanded ... recursion to expand certain model statements depending upon the value of a condition during the process of macro expansion

Kathleen asked in Compiler Design Sep 29, 2014

5.1k views

17 votes

2 answers

73

GATE CSE 1997 | Question: 1.8
A language $L$ allows declaration of arrays whose sizes are not known during compilation. It is required to make efficient use of memory. Which one of the following is true? A compiler using static memory allocation can be written for $L$ A compiler ... $L$; an interpreter must be used A compiler using dynamic memory allocation can be written for $L$ None of the above

Kathleen asked in Compiler Design Sep 29, 2014

4.6k views

28 votes

3 answers

74

GATE CSE 1997 | Question: 1.7
Which of the following is essential for converting an infix expression to the postfix form efficiently? An operator stack An operand stack An operand stack and an operator stack A parse tree

Kathleen asked in DS Sep 29, 2014

8.5k views

22 votes

2 answers

75

GATE CSE 1997 | Question: 1.6
In the following grammar $X ::= X \oplus Y \mid Y$ $Y::= Z * Y \mid Z$ $Z::= id $ Which of the following is true? $\text{ }\oplus\text{'}$ is left associative while $\text{ }*\text{'}$ ... $\text{ }\oplus\text{'}$ is right associative while $\text{ }*\text{'}$ is left associative None of the above

Kathleen asked in Compiler Design Sep 29, 2014

6.7k views

21 votes

3 answers

76

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

Kathleen asked in Algorithms Sep 29, 2014

5.0k views

44 votes

5 answers

77

GATE CSE 1997 | Question: 1.4
The concatenation of two lists is to be performed on $O(1)$ time. Which of the following implementations of a list should be used? Singly linked list Doubly linked list Circular doubly linked list Array implementation of list

Kathleen asked in DS Sep 29, 2014

19.4k views

17 votes

3 answers

78

GATE CSE 1997 | Question: 1.3
The determinant of the matrix $\begin{bmatrix} 6 & -8 & 1 & 1 \\ 0 & 2 & 4 & 6 \\ 0 & 0 & 4 & 8 \\ 0 & 0 & 0 & -1 \end{bmatrix}$ $11$ $-48$ $0$ $-24$

Kathleen asked in Linear Algebra Sep 29, 2014

3.8k views

3 votes

2 answers

79

GATE CSE 1997 | Question: 1.2
The Newton-Raphson method is used to find the root of the equation $X^2-2=0$. If the iterations are started from -1, the iterations will converge to -1 converge to $\sqrt{2}$ converge to $\sqrt{-2}$ not converge

Kathleen asked in Numerical Methods Sep 29, 2014

11.9k views

20 votes

2 answers

80

GATE CSE 1997 | Question: 1.1
The probability that it will rain today is $0.5$. The probability that it will rain tomorrow is $0.6$. The probability that it will rain either today or tomorrow is $0.7$. What is the probability that it will rain today and tomorrow? $0.3$ $0.25$ $0.35$ $0.4$

Kathleen asked in Probability Sep 29, 2014

6.2k views

Page:

« prev
1
2
3

Recent questions tagged gate1997