GATE 2025 | Computer Science and Information Technology (CS1) | Full Paper Solutions

GATE 2025 CS/IT - Full Paper Solutions

GATE 2025 Computer Science

Detailed Solutions for the Full Question Paper

General Aptitude (Q.1 - Q.10)

Computer Science & IT (Q.11 - Q.65)

Comments

Post a Comment

Ask you doubt here

Popular posts from this blog

GATE 2025 CS/IT Question 1 GATE2025_CS1_Q1 Question: Ravi had ____ younger brother who taught at ____ university. He was widely regarded as ____ honorable man. Select the option with the correct sequence of articles to fill in the blanks. A. a; a; an B. the; an; a C. a; an; a D. an; an; a 👁️ View Full Answer ✅ Final Answer: The correct sequence of articles is (a; a; an) , which corresponds to option (A) . 🔹 Short Answer: The selection of the indefinite article ('a' or 'an') is based on the initial sound of the word that follows. 'a' is used before consonant sounds, and 'an' is used before vowel sounds. 1. " a younger brother" - 'younger' starts with a consonant sound (/j/). 2. " a university" - 'university' starts with a consonant sound (/juː/). 3. " an honorable man"...
Read more
Image
GATE 2025 CS/IT Question 64 GATE2025_CS1_Q64 The maximum value of x such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is ______. (answer in integer) Check Answer 👁️ View Full Answer ✅ Final Answer: The correct answer is 5 . 🔹 Short Answer: For edge (B,C) to be in *every* MST, its weight 'x' must be strictly less than the bottleneck (heaviest edge) of any alternative path between B and C. The alternative paths and their bottlenecks are: B-A-C (bottleneck 7), B-D-C (bottleneck 8), and B-D-A-C (bottleneck 6). To satisfy all conditions, 'x' must be less than the minimum of these bottlenecks, so `x 🔸 Long Answer: Graph for MST Question A B C D 7 6 x ...
Read more
GATE 2025 CS/IT Question 65 GATE2025_CS1_Q65 In a double hashing scheme, h₁(k) = k mod 11 and h₂(k) = 1 + (k mod 7) are the auxiliary hash functions. The size m of the hash table is 11. The hash function for the i-th probe in the open address table is [h₁(k) + i h₂(k)] mod m. The following keys are inserted in the given order: 63, 50, 25, 79, 67, 24. The slot at which key 24 gets stored is ______. (Answer in integer) Check Answer 👁️ View Full Answer ✅ Final Answer: The correct answer is 10 . 🔹 Short Answer: To find the slot for key 24, we calculate its hash values: h₁(24) = 24 mod 11 = 2 and h₂(24) = 1 + (24 mod 7) = 1 + 3 = 4. We then probe the hash table. Probe 0: `(2 + 0*4) mod 11 = 2` (collision). Probe 1: `(2 + 1*4) mod 11 = 6` (collision). Probe 2: `(2 + 2*4) mod 11 = 10` (empty). Key 24 is placed in slot 10. 🔸 Long Answer: This problem requi...
Read more