GATE CSE 2024 | Set 2

Question 21

Consider a TCP connection operating at a point of time with the congestion window of size 12 MSS (Maximum Segment Size), when a timeout occurs due to packet loss. Assuming that all the segments transmitted in the next two RTTs (Round Trip Time) are acknowledged correctly, the congestion window size (in MSS) during the third RTT will be

• 3

• 4

• 5

• 2

Question 22

Let A be an n x n matrix over the set of all real numbers ℝ. Let B be a matrix obtained from ???? by swapping two rows. Which of the following statements is/are TRUE?

• If A is invertible, then B is also invertible

• The determinant of B is the negative of the determinant of A

• If the trace of A is zero, then the trace of B is also zero

• If A is symmetric, then B is also symmetric

Question 23

A non-pipelined instruction execution unit operating at 2 GHz takes an average of 6 cycles to execute an instruction of a program P. The unit is then redesigned to operate on a 5-stage pipeline at 2 GHz. Assume that the ideal throughput of the pipelined unit is 1 instruction per cycle. In the execution of program P, 20% of instructions incur an average of 2 cycles stall due to data hazards and 20% of instructions incur an average of 3 cycles stall due to control hazards. The speedup (rounded off to one decimal place) obtained by the pipelined design over the non-pipelined design is

• 3.0

• 3.5

• 2.5

• 4.0

Question 24

Which one of the following CIDR prefixes exactly represents the range of IP addresses 10.12.2.0 to 10.12.3.255?

• 10.12.2.0/24 

• 10.12.2.0/22

• 10.12.0.0/22 

• 10.12.2.0/23

Question 25

Let p and q be the following propositions:

p: Fail grade can be given.
q: Student scores more than 50% marks.

Consider the statement: "Fail grade cannot be given when student scores more than 50% marks."

Which one of the following is the CORRECT representation of the above statement in the propositional logic?

• q -> ¬ p

• q -> p

• p -> q

• ¬ p -> q

Question 26

Let A be the adjacency matrix of a simple undirected graph G. Suppose A is its own inverse. Which one of the following statements is always TRUE?

• G is a cycle

• G is a perfect matching

• G is a complete graph

• There is no such graph G

Question 27

Once the DBMS informs the user that a transaction has been successfully completed, its effect should persist even if the system crashes before all its changes are reflected on the disk. This property is called 

• durability

• atomicity

• consistency

• isolation

Question 28

Consider the following two sets:

Set X		Set Y
P	Lexical Analyzer	1	Abstract Syntax Tree
Q	Syntax Analyzer	2	Token
R	Intermediate Code Generator	3	Parse Tree
S	Code Optimizer	4	Constant Folding

Which one of the following options is the CORRECT match from Set X to Set Y ?

• P – 4; Q – 1; R – 3; S – 2

• P – 2; Q – 3; R – 1; S – 4

• P – 2; Q – 1; R – 3; S – 4

• P – 4; Q – 3; R – 2; S – 1

Question 29

Which one of the following regular expressions is equivalent to the language accepted by the DFA given below?

[caption width="800"] [/caption]

• 0*1(0+10*1)*

• 0*(10*11)*0*

• 0*1(010*1)*0*

• 0(1+0*10*1)*0*

Question 30

Which of the following tasks is/are the responsibility/responsibilities of the memory management unit (MMU) in a system with paging-based memory management?

• Allocate a new page table for a newly created process

• Translate a virtual address to a physical address using the page table

• Raise a trap when a virtual address is not found in the page table

• Raise a trap when a process tries to write to a page marked with read-only permission in the page table