Dark Mode

Recent questions tagged gatecse-2023

21 votes

4 answers

1

GATE CSE 2023 | Question: 1
Consider the following statements regarding the front-end and back-end of a compiler. S1: The front-end includes phases that are independent of the target hardware. S2: The back-end includes phases that are specific to the target hardware. S3: The back-end includes phases that are ... $\mathbf{S 3}$ are all TRUE. Only $\mathbf{S 1}$ and $\mathbf{S 3}$ are TRUE.

admin asked in Compiler Design Feb 15, 2023

by admin

14.7k views

14 votes

3 answers

2

GATE CSE 2023 | Question: 2
Which one of the following sequences when stored in an array at locations $A[1], \ldots, A[10]$ forms a max-heap? $23,17,10,6,13,14,1,5,7,12$ $23,17,14,7,13,10,1,5,6,12$ $23,17,14,6,13,10,1,5,7,15$ $23,14,17,1,10,13,16,12,7,5$

admin asked in DS Feb 15, 2023

by admin

6.5k views

8 votes

2 answers

3

GATE CSE 2023 | Question: 3
Let $\textsf{SLLdel}$ be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly, let $\textsf{DLLdel}$ be another function that deletes a node in a doubly-linked list given a pointer to the node ... $\textsf{DLLdel}$ are $O(1)$ $\textsf{SLLdel}$ is $O(n)$ and $\textsf{DLLdel}$ is $O(1)$

admin asked in DS Feb 15, 2023

by admin

10.3k views

11 votes

4 answers

4

GATE CSE 2023 | Question: 4
Consider the Deterministic Finite-state Automaton ($\text{DFA}$) $\mathcal{A}$ shown below. The $\text{DFA}$ runs on the alphabet $\{0,1\}$, and has the set of states $\{s, p, q, r\}$, with $s$ being the start state and $p$ being the only final state. Which one of the following ... $1\left(0^{*} 11\right)^{*}$ $0(0+1)^{*}$ $1(0+11)^{*}$ $1\left(110^{*}\right)^{*}$

admin asked in Theory of Computation Feb 15, 2023

by admin

11.0k views

7 votes

4 answers

5

GATE CSE 2023 | Question: 5
The Lucas sequence $L_{n}$ is defined by the recurrence relation: \[ L_{n}=L_{n-1}+L_{n-2}, \quad \text { for } \quad n \geq 3, \] with $L_{1}=1$ and $L_{2}=3$ ... $L_{n}=\left(\frac{1+\sqrt{5}}{2}\right)^{n}-\left(\frac{1-\sqrt{5}}{2}\right)^{n}$

admin asked in Combinatory Feb 15, 2023

by admin

7.8k views

13 votes

5 answers

6

GATE CSE 2023 | Question: 6
Which one of the options given below refers to the degree (or arity) of a relation in relational database systems? Number of attributes of its relation schema. Number of tuples stored in the relation. Number of entries in the relation. Number of distinct domains of its relation schema.

admin asked in Databases Feb 15, 2023

by admin

8.4k views

9 votes

7 answers

7

GATE CSE 2023 | Question: 7
Suppose two hosts are connected by a point-to-point link and they are configured to use $\textsf{Stop-and-Wait}$ protocol for reliable data transfer. Identify in which one of the following scenarios, the utilization of the ... Longer link length and higher transmission rate Shorter link length and lower transmission rate Shorter link length and higher transmission rate

admin asked in Computer Networks Feb 15, 2023

by admin

12.0k views

17 votes

4 answers

8

GATE CSE 2023 | Question: 8
Let \[ A=\left[\begin{array}{llll} 1 & 2 & 3 & 4 \\ 4 & 1 & 2 & 3 \\ 3 & 4 & 1 & 2 \\ 2 & 3 & 4 & 1 \end{array}\right] \] and \[ B=\left[\begin{array}{llll} 3 & 4 & ... $\operatorname{det}(B)=-\operatorname{det}(A)$ $\operatorname{det}(A)=0$ $\operatorname{det}(A B)=\operatorname{det}(A)+\operatorname{det}(B)$

admin asked in Linear Algebra Feb 15, 2023

by admin

11.0k views

8 votes

4 answers

9

GATE CSE 2023 | Question: 9
Consider the following definition of a lexical token $\textbf{id}$ for an identifier in a programming language, using extended regular expressions: \[ \begin{array}{ll} \textbf{ letter } & \rightarrow[\mathrm{A}-\mathrm{Za}-\mathrm{ ... Finite-state Automata with $\epsilon$-transitions accepts the set of valid identifiers? (A double-circle denotes a final state)

admin asked in Theory of Computation Feb 15, 2023

by admin

8.4k views

11 votes

3 answers

10

GATE CSE 2023 | Question: 10
An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize the number of collisions. Let $k$ be the number of keys, $m$ be the number of slots in the hash ... a carefully chosen constant. Universal hashing method. If $k$ is a prime number, use Division method. Otherwise, use Multiplication method.

admin asked in Algorithms Feb 15, 2023

by admin

9.3k views

8 votes

3 answers

11

GATE CSE 2023 | Question: 11
The output of a $2$-input multiplexer is connected back to one of its inputs as shown in the figure. Match the functional equivalence of this circuit to one of the following options. $\text{D}$ Flip-flop $\text{D}$ Latch Half-adder Demultiplexer

admin asked in Digital Logic Feb 15, 2023

by admin

10.4k views

8 votes

1 answer

12

GATE CSE 2023 | Question: 12
Which one or more of the following need to be saved on a context switch from one thread $\text{(T1)}$ of a process to another thread $\text{(T2)}$ of the same process? Page table base register Stack pointer Program counter General purpose registers

admin asked in Operating System Feb 15, 2023

by admin

9.7k views

12 votes

3 answers

13

GATE CSE 2023 | Question: 13
Which one or more of the following options guarantee that a computer system will transition from user mode to kernel mode? Function Call malloc Call Page Fault System Call

admin asked in Operating System Feb 15, 2023

by admin

11.1k views

4 votes

3 answers

14

GATE CSE 2023 | Question: 14
Which of the following statements is/are $\text{CORRECT}?$ The intersection of two regular languages is regular. The intersection of two context-free languages is context-free. The intersection of two recursive languages is recursive. The intersection of two recursively enumerable languages is recursively enumerable.

admin asked in Theory of Computation Feb 15, 2023

by admin

7.9k views

5 votes

3 answers

15

GATE CSE 2023 | Question: 15
Which of the following statements is/are $\text{INCORRECT}$ about the $\textsf{OSPF (Open Shortest Path First)}$ routing protocol used in the Internet? $\textsf{OSPF}$ implements Bellman-Ford algorithm to find shortest paths. $\textsf{OSPF}$ ... path routing. $\textsf{OSPF}$ is used as an inter-domain routing protocol. $\textsf{OSPF}$ implements hierarchical routing.

admin asked in Computer Networks Feb 15, 2023

by admin

7.9k views

23 votes

5 answers

16

GATE CSE 2023 | Question: 16
Geetha has a conjecture about integers, which is of the form \[ \forall x(P(x) \Longrightarrow \exists y Q(x, y)), \] where $P$ is a statement about integers, and $Q$ is a statement about pairs of integers. Which of the following (one or more) option(s) would imply ... $\exists y \forall x(P(x) \Longrightarrow Q(x, y))$ $\exists x(P(x) \wedge \exists y Q(x, y))$

admin asked in Mathematical Logic Feb 15, 2023

by admin

11.0k views

20 votes

5 answers

17

GATE CSE 2023 | Question: 17
Which one or more of the following $\text{CPU}$ scheduling algorithms can potentially cause starvation? First-in First-Out Round Robin Priority Scheduling Shortest Job First

admin asked in Operating System Feb 15, 2023

by admin

14.2k views

8 votes

2 answers

18

GATE CSE 2023 | Question: 18
Let $\qquad f(x)=x^{3}+15 x^{2}-33 x-36$ be a real-valued function. Which of the following statements is/are $\text{TRUE}?$ $f(x)$ does not have a local maximum. $f(x)$ has a local maximum. $f(x)$ does not have a local minimum. $f(x)$ has a local minimum.

admin asked in Calculus Feb 15, 2023

by admin

5.1k views

9 votes

4 answers

19

GATE CSE 2023 | Question: 19
Let $f$ and $g$ be functions of natural numbers given by $f(n)=n$ and $g(n)=n^{2}.$ Which of the following statements is/are $\text{TRUE}?$ $f \in O(g)$ $f \in \Omega(g)$ $f \in o(g)$ $f \in \Theta(g)$

admin asked in Algorithms Feb 15, 2023

by admin

9.5k views

8 votes

4 answers

20

GATE CSE 2023 | Question: 20
Let $A$ be the adjacency matrix of the graph with vertices $\{1,2,3,4,5\}.$ Let $\lambda_{1}, \lambda_{2}, \lambda_{3}, \lambda_{4}$, and $\lambda_{5}$ be the five eigenvalues of $A$. Note that these eigenvalues need not be distinct. The value of $\lambda_{1}+\lambda_{2}+\lambda_{3}+\lambda_{4}+\lambda_{5}=$____________

admin asked in Linear Algebra Feb 15, 2023

by admin

12.8k views

5 votes

2 answers

21

GATE CSE 2023 | Question: 21
The value of the definite integral \[ \int_{-3}^{3} \int_{-2}^{2} \int_{-1}^{1}\left(4 x^{2} y-z^{3}\right) \mathrm{d} z \mathrm{~d} y \mathrm{~d} x \] is _________. (Rounded off to the nearest integer)

admin asked in Calculus Feb 15, 2023

by admin

8.5k views

6 votes

2 answers

22

GATE CSE 2023 | Question: 22
A particular number is written as $132$ in radix-$4$ representation. The same number in radix-$5$ representation is _____________.

admin asked in Digital Logic Feb 15, 2023

by admin

12.1k views

9 votes

4 answers

23

GATE CSE 2023 | Question: 23
Consider a $3$-stage pipelined processor having a delay of $10 \mathrm{~ns}$ (nanoseconds), $20 \mathrm{~ns}$, and $14 \mathrm{~ns},$ for the first, second, and the third stages, respectively. Assume that there is no other ... instruction is fetched every cycle. The total execution time for executing $100$ instructions on this processor is _____________ $\mathrm{ns}.$

admin asked in CO and Architecture Feb 15, 2023

by admin

9.1k views

11 votes

2 answers

24

GATE CSE 2023 | Question: 24
A keyboard connected to a computer is used at a rate of $1$ keystroke per second. The computer system polls the keyboard every $10 \mathrm{~ms}$ (milli seconds) to check for a keystroke and consumes $100\; \mu \mathrm{s}$ (micro seconds) for ... interrupt and processing a keystroke. The ratio $\dfrac{T_{1}}{T_{2}}$ is _____________. (Rounded off to one decimal place)

admin asked in CO and Architecture Feb 15, 2023

by admin

7.8k views

18 votes

3 answers

25

GATE CSE 2023 | Question: 25
The integer value printed by the $\textsf{ANSI-C}$ program given below is _______________ #include<stdio.h> int funcp(){ static int x = 1; x++; return x; } int main(){ int x,y; x = funcp(); y = funcp()+x; printf("%d\n", (x+y)); return 0; }

admin asked in Programming in C Feb 15, 2023

by admin

10.6k views

8 votes

1 answer

26

GATE CSE 2023 | Question: 26
Consider the following program: int main() { f1 (); f2(2); f3(); return (0); } int f1 () { return(1); } int f2 (int X) { f3(); if (X==1); return f1 (); else return (X * f2 (X - 1)); } int f3 () { return (5); } Which one of the following options represents the activation tree corresponding to the main function?

admin asked in Compiler Design Feb 15, 2023

by admin

7.8k views

12 votes

4 answers

27

GATE CSE 2023 | Question: 27
Consider the control flow graph shown. Which one of the following choices correctly lists the set of live variables at the exit point of each basic block? $\text{B1: { }, B2: {a}, B3: {a}, B4: {a}}$ $\text{B1: {i, j}, B2: {a}, B3: {a}, B4: {i}}$ $\text{B1: {a, i, j}, B2: {a, i, j}, B3: {a, i}, B4: {a}}$ $\text{B1: {a, i, j}, B2: {a, j}, B3: {a, j}, B4: {a, i, j}}$

admin asked in Compiler Design Feb 15, 2023

by admin

11.6k views

17 votes

2 answers

28

GATE CSE 2023 | Question: 28
Consider the two functions $\textsf{incr}$ and $\textsf{decr}$ shown below. incr(){ decr(){ wait(s); wait(s); X = X+1; X = X-1; signal(s); signal(s); } } There are $5$ threads each invoking $\textsf{incr}$ once, and $3$ threads each ... of the following choices corresponds to the minimum possible values of $\text{V1, V2},$ respectively? $15,7$ $7,7$ $12,7$ $12,8$

admin asked in Operating System Feb 15, 2023

by admin

11.8k views

14 votes

5 answers

29

GATE CSE 2023 | Question: 29
Consider the context-free grammar $G$ below \[ \begin{array}{l} S \rightarrow a S b \mid X \\ X \rightarrow a X \mid X b \mid a \mid b, \end{array} \] where $S$ and $X$ are non-terminals, and $a$ and $b$ are terminal symbols. The starting non- ... $G$ is $a^{\ast} b^{\ast}(a+b)$ The language generated by $G$ is not a regular language

admin asked in Theory of Computation Feb 15, 2023

by admin

8.5k views

12 votes

4 answers

30

GATE CSE 2023 | Question: 30
Consider the pushdown automaton $\text{(PDA)}\;P$ below, which runs on the input alphabet $\{a, b\}$, has stack alphabet $\{\perp, A\}$, and has three states $\{s, p, q\}$, with $s$ being the start state. A transition from state $u$ to state $v$ ... $\left.0 \leq n\right\}$ $\left\{a^{m} \mid 0 \leq m\right\} \cup\left\{b^{n} \mid 0 \leq n\right\}$

admin asked in Theory of Computation Feb 15, 2023

by admin

6.7k views

Page:

1
2
3
next »

Recent questions tagged gatecse-2023