Recent questions tagged multiple-selects / GATE Overflow for GATE CSE

3 votes

2 answers

121

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 44
Which of the following statements is/are false? Let $\text{A}$ and $\text{B}$ be sets of languages over some fixed alphabet $\Sigma$, with $\text{A} \subseteq \text{B}$. If $\text{A}$ is closed under some operation $\text{P},$ then ... $\mathrm{L} 2$ $\subseteq \mathrm{L} 1$, then $\mathrm{L} 2$ is decidable.)

Which of the following statements is/are false?Let $\text{A}$ and $\text{B}$ be sets of languages over some fixed alphabet $\Sigma$, with $\text{A} \subseteq \text{B}$. I...

GO Classes

557 views

GO Classes asked Jan 21

10 votes

1 answer

122

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 45
Below is a drawing(graph representation) of a binary relation $\text{R}$ over a set $\text{P}$ of elements $\{ \text{A, B, C, D, E, F}\}:$ Which of the following first-order logic statements about $\mathrm{R}$ ... $\forall x \in P . \exists y \in P . x R y$

Below is a drawing(graph representation) of a binary relation $\text{R}$ over a set $\text{P}$ of elements $\{ \text{A, B, C, D, E, F}\}:$Which of the following first-ord...

GO Classes

630 views

GO Classes asked Jan 21

6 votes

1 answer

123

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 47
An involution is a function $f: A \rightarrow A$ where $f(f(x))=x$. A fixed point of any function $f: A \rightarrow A$ is an element $x \in A$ for which $f(x)$ $=x$. Which of the following statement(s) ... $f: \mathrm{A} \rightarrow \mathrm{A}$ is a bijective function.

An involution is a function $f: A \rightarrow A$ where $f(f(x))=x$.A fixed point of any function $f: A \rightarrow A$ is an element $x \in A$ for which $f(x)$ $=x$.Which ...

GO Classes

456 views

GO Classes asked Jan 21

8 votes

1 answer

124

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 50
A computer has a $32$-bit address bus with a direct mapped cache, using $4$ bits for block offset, $16$ tag bits, and $12$ index bits. Which of the following address pairs can be placed in the cache simultaneously? $\textsf{3AC6 F45 6}$ ... $\textsf{5E3C 768 0}$ and $\textsf{8F3C 768 A}$ $\textsf{2233 445 5}$ and $\textsf{2233 445 C}$

A computer has a $32$-bit address bus with a direct mapped cache, using $4$ bits for block offset, $16$ tag bits, and $12$ index bits.Which of the following address pairs...

GO Classes

843 views

GO Classes asked Jan 21

5 votes

2 answers

125

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 53
Consider the following $4$-bit adder circuit. Note, $\text{C}_0$ is carry in and $\text{C}_4$ is carry out for the $4$-bit adder. The given circuit operates on $\text{2's}$ ... $\text{S}=1$

Consider the following $4$-bit adder circuit.Note, $\text{C}_0$ is carry in and $\text{C}_4$ is carry out for the $4$-bit adder. The given circuit operates on $\text{2's}...

GO Classes

679 views

GO Classes asked Jan 21

3 votes

1 answer

126

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 14
Which kind of data dependence can cause data hazards in a single-core, pipelined, in-order processor? (Mark all that apply.) read-after-write dependence write-after-read dependence write-after-write dependence read-after-read dependence

Which kind of data dependence can cause data hazards in a single-core, pipelined, in-order processor? (Mark all that apply.)read-after-write dependencewrite-after-read de...

GO Classes

583 views

GO Classes asked Jan 13

3 votes

1 answer

127

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 16
Which one of the following options is CORRECT for the given logic circuit? $P=1, Q=1 ; X=0$ $P=1, Q=0 ; X=1$ $P=0, Q=1 ; X=0$ $P=0, Q=0 ; X=1$

Which one of the following options is CORRECT for the given logic circuit?$P=1, Q=1 ; X=0$$P=1, Q=0 ; X=1$$P=0, Q=1 ; X=0$$P=0, Q=0 ; X=1$

GO Classes

389 views

GO Classes asked Jan 13

4 votes

2 answers

128

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 19
Consider three concurrently executing threads in the same process using two semaphores $\text{s}1$ and $\text{s2}.$ Assume $\text{s1}$ has been initialized to $1$, while $\text{s2}$ has been initialized to $0.$ ... ); /* thread C */ P(s1); x = x+3; V(s2); V(s1); $6$ $12$ $18$ $36$

Consider three concurrently executing threads in the same process using two semaphores $\text{s}1$ and $\text{s2}.$ Assume $\text{s1}$ has been initialized to $1$, while ...

GO Classes

580 views

GO Classes asked Jan 13

2 votes

1 answer

129

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 25
A linear-probing hash table of length $10$ uses the hash function $h(x)=x \bmod 10$ ... that apply. $34,42,23,52,33,46$ $46,34,42,23,52,33$ $42,46,33,23,34,52$ $42,23,34,52,46,33$

A linear-probing hash table of length $10$ uses the hash function $h(x)=x \bmod 10$. After inserting six integer keys into an initially empty hash table, the array of key...

GO Classes

399 views

GO Classes asked Jan 13

3 votes

1 answer

130

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 26
A lexical analyzer uses the following patterns to recognize four tokens $\textsf{T1, T2, T3},$ and $\textsf{T4}$ over the alphabet $ \{a,b,c\}.$ Rule1: aa*b*c* { print ( T1 ); } Rule2: c { print ( T2 ); ... never be used? Note that the analyzer outputs the token that matches the longest possible prefix. Rule$1$ Rule$2$ Rule$3$ Rule$4$

A lexical analyzer uses the following patterns to recognize four tokens $\textsf{T1, T2, T3},$ and $\textsf{T4}$ over the alphabet $ \{a,b,c\}.$Rule1: aa*b*c* { print...

GO Classes

623 views

GO Classes asked Jan 13

3 votes

1 answer

131

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 27
Suppose there is a handle on the top of the stack at some point in time while performing $\text{LR(k)}$ parsing. In this context, a cetrain $\text{LR(k)}$ parsers may exhibit uncertainty in ... The parser may perform reduction without generating any conflict. The parser may execute a shift operation without generating any conflict.

Suppose there is a handle on the top of the stack at some point in time while performing $\text{LR(k)}$ parsing. In this context, a cetrain $\text{LR(k)}$ parsers may exh...

GO Classes

531 views

GO Classes asked Jan 13

5 votes

2 answers

132

Which one of the following context-free grammars is unambiguous? (Note that $a, b, c,(,),+$ are terminals, $S, X, Y$ are nonterminals, and the start symbol in each case i...

GO Classes

641 views

GO Classes asked Jan 13

5 votes

1 answer

133

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 36
Consider the system $A \mathbf{x}=\mathbf{b}$, with coefficient matrix $A$ and augmented matrix $[A \mid b]$. The sizes of $\mathbf{b}, A$, and $[A \mid \mathbf{b}]$ are $m \times 1, m \times n$ ... $\operatorname{rank}[A]>$ $\operatorname{rank}[A \mid b]$.

Consider the system $A \mathbf{x}=\mathbf{b}$, with coefficient matrix $A$ and augmented matrix $[A \mid b]$. The sizes of $\mathbf{b}, A$, and $[A \mid \mathbf{b}]$ are ...

GO Classes

515 views

GO Classes asked Jan 13

9 votes

1 answer

134

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 38
A binary relation $\mathrm{R}$ over a set $\mathrm{A}$ is called a "GO Relation" if for all $\mathrm{x}, \mathrm{y}, \mathrm{z}$ $\in A$, if $x R y$ and $x R z$, then $y R z$. Which of the following ... is transitive. If $R$ is a GO relation then $R$ is reflexive. If $R$ is an equivalence relation then $R$ is a GO relation.

A binary relation $\mathrm{R}$ over a set $\mathrm{A}$ is called a "GO Relation" if for all $\mathrm{x}, \mathrm{y}, \mathrm{z}$ $\in A$, if $x R y$ and $x R z$, then $y ...

GO Classes

568 views

GO Classes asked Jan 13

8 votes

1 answer

135

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 41
A self-dual logic function is a function that is identical to its dual. An anti-self-dual logic function is a function whose dual is the same as the complement of the function. A boolean function $f$ on $n$ variables is called neutral if $f$ has ... on $\mathrm{n}$ variables is $\mathrm{C}\left(2^{n-1}\right., \left.2^ {n-2}\right)$.

A self-dual logic function is a function that is identical to its dual. An anti-self-dual logic function is a function whose dual is the same as the complement of the fun...

GO Classes

752 views

GO Classes asked Jan 13

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true