CS and IT GATE 2023 Questions with Answer

Ques 27 Computer Science

---

The value of the definite integral
∫_-3³∫_-2²∫_-1¹(4x²y - z³)dz dy dx
(Rounded off to the nearest integer) is _______.

See Answer Video Solution

Ques 28 Computer Science

---

A particular number is written as 132 in radix-4 representation. The same number in radix-5 representation is _______.

See Answer Video Solution

Ques 29 Computer Science

---

Consider a 3-stage pipelined processor having a delay of 10 ns (nanoseconds), 20 ns, and 14 ns, for the first, second, and the third stages, respectively. Assume that there is no other delay and the processor does not suffer from any pipeline hazards. Also assume that one instruction is fetched every cycle. The total execution time for executing 100 instructions on this processor is _______ ns.

See Answer Video Solution

Ques 30 Computer Science

---

A keyboard connected to a computer is used at a rate of 1 keystroke per second. The computer system polls the keyboard every 10 ms (milli seconds) to check for a keystroke and consumes 100 μs (micro seconds) for each poll. If it is determined after polling that a key has been pressed, the system consumes an additional 200 μs to process the keystroke. Let T₁ denote the fraction of a second spent in polling and processing a keystroke. In an alternative implementation, the system uses interrupts instead of polling. An interrupt is raised for every keystroke. It takes a total of 1 ms for servicing an interrupt and processing a keystroke. Let T₂ denote the fraction of a second spent in servicing the interrupt and processing a keystroke. The ratio T₁/T₂ is _______. (Rounded off to one decimal place)

See Answer Video Solution

Ques 31 Computer Science

---

The integer value printed by the ANSI-C program given below is _______.

See Answer Video Solution

Ques 32 Computer Science

---

Consider the following program:

Which one of the following options represents the activation tree corresponding to the main function?

A

B

C

D

See Answer Video Solution

Ques 33 Computer Science

---

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?

A

B1: {}, B2: {a}, B3: {a}, B4: {a}

B

B1: {i, j}, B2: {a}, B3: {a}, B4: {i}

C

B1: {a, i, j}, B2: {a, i, j}, B3: {a, i}, B4: {a}

D

B1: {a, i, j}, B2: {a, j}, B3: {a, j}, B4: {a, i, j}

See Answer Video Solution

Ques 34 Computer Science

---

Consider the two functions incr and decr shown below.

There are 5 threads each invoking incr once, and 3 threads each invoking decr once, on the same shared variable X. The initial value of X is 10.
Suppose there are two implementations of the semaphore s, as follows:
I-1: s is a binary semaphore initialized to 1
I-2: s is a counting semaphore initialized to 2. Let V1, V2 be the values of X at the end of execution of all the threads with implementations I-1, 1-2, respectively.
Which one of the following choices corresponds to the minimum possible values of V1, V2, respectively?

A

15,7

B

7,7

C

12,7

D

12,8

See Answer Video Solution

Ques 35 Computer Science

---

Consider the context-free grammar G below:
S -> aSb | X
X -> aX | Xb | a | b
where S and X are non-terminals, and a and b are terminal symbols. The starting non-terminal is S.
Which one of the following statements is CORRECT?

A

The language generated by G is (a+b)*

B

The language generated by G is a*(a+b)b*

C

The language generated by G is a*b*(a+b)

D

The language generated by G is not a regular language

See Answer Video Solution

Ques 36 Computer Science

---

Consider the pushdown automaton (PDA) P below, which runs on the input alphabet {a,b}, has stack alphabet {⊥, A}, and has three states {s,p,q}, with s being the start state. A transition from state u to state v, labelled c/X/γ where c is an input symbol or e, X is a stack symbol, and γ is a string of stack symbols, represents the fact that in state u, the PDA can read c from the input, with X on the top of its stack, pop X from the stack, push in the string γ on the stack, and go to state v. In the initial configuration, the stack has only the symbol ⊥ in it. The PDA accepts by empty stack.

Which one of the following options correctly describes the language accepted by P?

A

{a^mbⁿ | 1 ≤ m and n < m}

B

{a^mbⁿ | 0 ≤ n ≤ m}

C

{a^mbⁿ | 0 ≤ m and 0 ≤ n}

D

{a^m | 0 ≤ m} ∪ {bⁿ | 0 ≤ n}

See Answer Video Solution

Ques 37 Computer Science

---

Consider the given C-code and its corresponding assembly code, with a few operands U1-U4 being unknown. Some useful information as well as the semantics of each unique assembly instruction is annotated as inline comments in the code. The memory is byte-addressable.

Which one of the following options is a CORRECT replacement for operands in the position (U1, U2, U3, U4) in the above assembly code?

A

(8, 4, 1, L02)

B

(3, 4, 4, L01)

C

(8,1,1,LO2)

D

(3,1,1,L01)

See Answer Video Solution

Ques 38 Computer Science

---

A 4 kilobyte (KB) byte-addressable memory is realized using four 1 KB memory blocks. Two input address lines (IA₄ and IA₃) are connected to the chip select (CS) port of these memory blocks through a decoder as shown in the figure. The remaining ten input address lines from IA₁₁-IA₀ are connected to the address port of these blocks. The chip select (CS) is active high.

The input memory addresses (IA₁₁-IA₀), in decimal, for the starting locations (Addr=0) of each block (indicated as X1, X2, X3, X4 in the figure) are among the options given below. Which one of the following options is CORRECT?

A

(0,1,2,3)

B

(0, 1024, 2048, 3072)

C

(0,8,16,24)

D

(0,0,0,0)

See Answer Video Solution

Ques 39 Computer Science

---

Consider a sequential digital circuit consisting of T flip-flops and D flip-flops as shown in the figure. CLKIN is the clock input to the circuit. At the beginning, Q1, Q2 and Q3 have values 0, 1 and 1, respectively.

Which one of the given values of (Q1, Q2, Q3) can NEVER be obtained with this digital circuit?

A

(0, 0, 1)

B

(1, 0, 0)

C

(1, 0, 1)

D

(1, 1, 1)

See Answer Video Solution