CS/IT Gate Yearwise 


CS and IT GATE 2024 SET-2 Questions with Answer

Ques 27 Computer Science

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

A

10.12.2.0/23

B

10.12.2.0/22

C

10.12.3.0/23

D

10.12.3.0/24



Ques 28 Computer Science

You are given a set V of distinct integers. A binary search tree T is created by inserting all elements of V one by one, starting with an empty tree. The tree T follows the convention that, at each node, all values stored in the left subtree of the node are smaller than the value stored at the node. You are not aware of the sequence in which these values were inserted into T, and you do not have access to T. Which one of the following statements is TRUE?

A

Inorder traversal of T can be determined from V

B

Root node of T can be determined from V

C

Preorder traversal of T can be determined from V

D

Postorder traversal of T can be determined from V



Ques 29 Computer Science

Consider the following context-free grammar where the start symbol is S and the set of terminals is {a,b,c,d}.

The following is a partially-filled LL(1) parsing table.
Which one of the following options represents the CORRECT combination for the numbered cells in the parsing table? Note: In the options, "blank" denotes that the corresponding cell is empty.

A

(1) S → AaAb (2) S → BbBa (3) A → ϵ (4) B → ϵ

B

(1) S → BbBa (2) S → AaAb (3) A → ϵ (4) B → ϵ

C

(1) S → AaAb (2) S → BbBa (3) blank (4) blank

D

(1) S → BbBa (2) S → AaAb (3) blank (4) blank



Ques 30 Computer Science

Let x and y be random variables, not necessarily independent, that take real values in the interval. Let z = xy and let the mean values of x, y, z be x̅, ȳ, z̅ respectively. Which one of the following statements is TRUE?

A

z̅ = x̅ȳ

B

z̅ ≤ x̅ȳ

C

z̅ ≥ x̅ȳ

D

z̅ ≤ x̅



Ques 31 Computer Science

The relation schema, Person(pid, city), describes the city of residence for every person uniquely identified by pid. The following relational algebra operators are available: selection, projection, cross product, and rename.
To find the list of cities where at least 3 persons reside, using the above operators, the minimum number of cross product operations that must be used is

A

1

B

2

C

3

D

4



Ques 32 Computer Science

Let A be an n x n matrix with real number entries, where n > 2. Let B be a matrix obtained by interchanging two rows of A. Which of the following statements is/are always TRUE?

A

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

B

The rank of B is equal to the rank of A

C

If A is invertible, then B is also invertible

D

If A is symmetric, then B is also symmetric



Ques 33 Computer Science

Which of the following is/are EQUAL to 224 in radix-5 (i.e., base-5) notation?

A

64 in radix-10

B

100 in radix-8

C

50 in radix-16

D

121 in radix-7



Ques 34 Computer Science

Let G be an undirected connected graph in which every edge has a positive integer weight. Suppose that every spanning tree in G has even weight. Which of the following statements is/are TRUE for every such graph G?

A

All edges in G have even weight

B

All edges in G have even weight OR all edges in G have odd weight

C

In each cycle C in G, all edges in C have even weight

D

In each cycle C in G, either all edges in C have even weight OR all edges in C have odd weight



Ques 35 Computer Science

Consider a context-free grammar G with the following 3 rules.
S → aS,
S → aSbS,
S → c
Let w ∈ L(G). Let na(w), nb(w), nc(w) denote the number of times a, b, c occur in w, respectively. Which of the following statements is/are TRUE?

A

na(w) > nb(w)

B

na(w) > nc(w) - 2

C

nc(w) = nb(w) + 1

D

nc(w) = nb(w) * 2



Ques 36 Computer Science

Consider a disk with the following specifications: rotation speed of 6000 RPM, average seek time of 5 milliseconds, 500 sectors/track, 512-byte sectors. A file has content stored in 3000 sectors located randomly on the disk. Assuming average rotational latency, the total time (in seconds, rounded off to 2 decimal places) to read the entire file from the disk is


1.55 is the correct answer.


Ques 37 Computer Science

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


7 is the correct answer.


Ques 38 Computer Science

Consider an Ethernet segment with a transmission speed of 108 bits/sec and a maximum segment length of 500 meters. If the speed of propagation of the signal in the medium is 2 x 108 meters/sec, then the minimum frame size (in bits) required for collision detection is


500 is the correct answer.


Ques 39 Computer Science

A functional dependency F:X → Y is termed as a 'useful functional dependency' if and only if it satisfies all the following three conditions:
• X is not the empty set.
• Y is not the empty set.
• Intersection of X and Y is the empty set.
For a relation R with 4 attributes, the total number of possible useful functional dependencies is


84 is the correct answer.


Unique Visitor Count

Total Unique Visitors

Loading......