What is the answer for the weak entity set participation question in GATE 2024 CS Set 2?

The correct answer is Option A: Only weak entity sets MUST have total participation in the identifying relationship. A weak entity cannot exist without its owner/identifying entity, so every weak entity instance must participate in the identifying relationship (total participation). The owner entity set does not need to participate totally.

What code optimization matching is tested in GATE 2024 CS Set 2?

The correct answer is Option B: P-2, Q-3, R-1, S-4. The question matches compiler optimization techniques to their definitions. Constant folding evaluates constant expressions at compile time. Dead code elimination removes unreachable code. Common subexpression elimination avoids recomputing the same expression. Strength reduction replaces costly operations with cheaper equivalents.

What DFA regular expression question appeared in GATE 2024 CS Set 2?

The correct answer is Option A: 0*1(0+10*1)*. The DFA accepts strings over {0,1} that, when traced through the state diagram, correspond to this regular expression. The pattern represents strings starting with any number of 0s, then a 1, followed by repetitions of either a single 0 or 10*1 groups.

CS and IT Gate 2024 Set-2 Questions with Answer

1 2 3 4 5

Ques 27 GATE 2024 Set-2

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

10.12.2.0/23

10.12.2.0/22

10.12.3.0/23

10.12.3.0/24

(a) is the correct answer.

To determine which CIDR prefix exactly represents the given range of IP addresses, let us convert the changing portions of the IP addresses into binary form.
1. Analyze the Constant and Changing Octets: Looking at the start and end of the address block:
• Start IP: 10.12.2.0
• End IP: 10.12.3.255

The first two octets (10.12) remain completely constant across the entire range. Since each octet represents 8 bits, this gives us 16 matching network bits right away.
2. Convert the 3rd Octet to Binary: Let us look at the binary structure of the 3rd octet for the boundary values:
• Decimal 2 in binary: 0 0 0 0 0 0 1 0
• Decimal 3 in binary: 0 0 0 0 0 0 1 1
Let's align them to find the matching network prefix length:

1st & 2nd Octet       3rd Octet
10 . 12        .  0 0 0 0 0 0 1 0  (For 10.12.2.0)
10 . 12        .  0 0 0 0 0 0 1 1  (For 10.12.3.255)
---------------------------------
<- 16 bits ->  <-   7 bits   -> -> The first 7 bits match perfectly.

Counting the total number of identical, continuous bits from left to right:
• First two octets = 16 bits
• Third octet matching bits = 7 bits
• Total network prefix length = 16 + 7 = 23 bits.
3. Determine the Network Address: The common prefix up to the 23rd bit gives us the base network address. Setting all remaining host bits (the last bit of the 3rd octet and all 8 bits of the 4th octet) to 0 results in:
• 3rd Octet: 00000010 → 2
• 4th Octet: 00000000 → 0

This creates the full CIDR identifier: 10.12.2.0/23.
4. Verify Total Addresses: A /23 network leaves $32 - 23 = 9$ bits for host allocation.
The total number of addresses in this block is $2^9 = 512$.
Our target range spans from 10.12.2.0 to 10.12.3.255, which contains exactly 256 addresses from the .2 block and 256 addresses from the .3 block ($256 + 256 = 512$). This confirms the block calculation is correct.
Conclusion: The prefix that exactly matches the address block is 10.12.2.0/23, corresponding to option (a).

Ques 28 GATE 2024 Set-2

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?

Inorder traversal of T can be determined from V

Root node of T can be determined from V

Preorder traversal of T can be determined from V

Postorder traversal of T can be determined from V

(a) is the correct answer.

Ques 29 GATE 2024 Set-2

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.

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

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

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

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

Ques 30 GATE 2024 Set-2

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?

z̅ = x̅ȳ

z̅ ≤ x̅ȳ

z̅ ≥ x̅ȳ

z̅ ≤ x̅

(b) is the correct answer.

Ques 31 GATE 2024 Set-2

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

Ques 32 GATE 2024 Set-2

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?

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

The rank of B is equal to the rank of A

If A is invertible, then B is also invertible

If A is symmetric, then B is also symmetric

(a,b,c) is the correct answer.

Ques 33 GATE 2024 Set-2

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

64 in radix-10

100 in radix-8

50 in radix-16

121 in radix-7

(a,d) is the correct answer.

Ques 34 GATE 2024 Set-2

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?

All edges in G have even weight

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

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

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

(a,c) is the correct answer.

Ques 35 GATE 2024 Set-2

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

n_a(w) > n_b(w)

n_a(w) > n_c(w) - 2

n_c(w) = n_b(w) + 1

n_c(w) = n_b(w) * 2

(a,b,c) is the correct answer.

Ques 36 GATE 2024 Set-2

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 GATE 2024 Set-2

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 GATE 2024 Set-2

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

(500) is the correct answer.

Ques 39 GATE 2024 Set-2

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.

1 2 3 4 5

Total Unique Visitors

Loading......

CS/IT Gate Yearwise

CS and IT Gate 2024 Set-2 Questions with Answer

Question Options

Sign in to ExamPrev