CS and IT Gate 2025 Set-2 Questions with Answer

Ques 53 GATE 2025 SET-2

Consider a demand paging system with three frames, and the following page reference string: 123454164513 2. The contents of the frames are as follows initially and after each reference (from left to right):

The *-marked references cause page replacements.
Which one or more of the following could be the page replacement policy/policies in use?

Least Recently Used page replacement policy

Least Frequently Used page replacement policy

Most Frequently Used page replacement policy

Optimal page replacement policy

(d) is the correct answer.

Ques 54 GATE 2025 SET-2

P={P₁,P₂,P₃,P₄} consists of all active processes in an operating system.
R={R₁,R₂,R₃,R₄} consists of single instances of distinct types of resources in the system.
The resource allocation graph has the following assignment and claim edges.
Assignment edges: R₁→P₁, R₂→P₂, R₃→P₃, R₄→P₄ (the assignment edge R₁→P₁ means resource R₁ is assigned to process P₁, and so on for others)
Claim edges: P₁→R₂, P₂→R₃, P₃→R₁, P₂→R₄, P₄→R₂ (the claim edge P₁→R₂ means process P₁ is waiting for resource R₂, and so on for others)
Which of the following statement(s) is/are CORRECT?

Aborting P₁ makes the system deadlock free.

Aborting P₃ makes the system deadlock free.

Aborting P₂ makes the system deadlock free.

Aborting P₁ and P₄ makes the system deadlock free.

(a) is the correct answer.

Ques 55 GATE 2025 SET-2

A computer system supports a logical address space of 2³² bytes. It uses two-level hierarchical paging with a page size of 4096 bytes. A logical address is divided into a b-bit index to the outer page table, an offset within the page of the inner page table, and an offset within the desired page. Each entry of the inner page table uses eight bytes. All the pages in the system have the same size.
The value of b is ______ (Answer in integer)

(10) is the correct answer.

Ques 56 GATE 2025 SET-2

Consider the following C program:

Which ONE of the following will be the output of the program?

#Hello World!

Hello World!

ello World!

Hello World!d!

Correct answer:

Hello World!

Explanation:
The statement stringcopy(a, a + 2); copies the string from a + 2 (which points to Hello World! in the original array a) into a itself. Therefore, the updated string in a becomes Hello World! and printf("%s", a); outputs Hello World!.

Ques 57 GATE 2025 SET-2

The output of the given C code segment is ______ (Answer in integer)

(21) is the correct answer.

Ques 58 GATE 2025 SET-2

Consider the following C program:

The output of the above program is ______ (Answer in integer)

(111) is the correct answer.

Ques 59 GATE 2025 SET-2

Consider the following C program:

The output of the given C program is ______ (Answer in integer)

(64) is the correct answer.

Ques 60 GATE 2025 SET-2

Which ONE of the following languages is accepted by a deterministic pushdown automaton?

Any regular language.

Any context-free language.

Any language accepted by a non-deterministic pushdown automaton.

Any decidable language.

(a) is the correct answer.

Correct Answer:

a) Any regular language.

A deterministic pushdown automaton (DPDA) can accept all regular languages, because it can simulate any deterministic finite automaton (DFA), which recognizes regular languages.
Regular languages are a strict subset of deterministic context-free languages, but not all context-free languages are accepted by a DPDA—some require non-determinism.
The languages accepted by a DPDA (called deterministic context-free languages, DCFLs) include all regular languages, but not all context-free, NPDA-accepted, or decidable languages.

Ques 61 GATE 2025 SET-2

Let G₁, G₂ be Context Free Grammars (CFGs) and R be a regular expression. For a grammar G, let L(G) denote the language generated by G.
Which ONE among the following questions is decidable?

Is L(G₁)=L(G₂)?

Is L(G₁)∩L(G₂)=φ?

Is L(G₁)=L(R)?

Is L(G₁)=∅?

(d) is the correct answer.

Ques 62 GATE 2025 SET-2

Consider the two lists List I and List II given below:
List I
(i) Context free languages
(ii) Recursive languages
(iii) Regular languages
List II
(a) Closed under union
(b) Not closed under complementation
(c) Closed under intersection
For matching of items in List I with those in List II, which of the following option(s) is/are CORRECT?

(i)-(a), (ii)-(b), and (iii)-(c)

(i)-(b), (ii)-(a), and (iii)-(c)

(i)-(b), (ii)-(c), and (iii)-(a)

(i)-(a), (ii)-(c), and (iii)-(b)

(d) is the correct answer.

Ques 63 GATE 2025 SET-2

Let Σ={a,b,c}. For x∈Σ^*, and α∈Σ, let #_α(x) denote the number of occurrences of a in x.
Which one or more of the following option(s) define(s) regular language(s)?

{a^mbⁿ|m,n≥0}

{a,b}^*∩{a^mbⁿc^m-n|m≥n≥0}

{w|w∈{a,b}^*,#_a(w)≡2(mod 7),and#_b(w)≡3(mod 9)}

{w|w∈{a,b}^*,#_a(w)≡2(mod 7) and #_a(w)=#_b(w)}

Ques 64 GATE 2025 SET-2

Let Σ={1,2,3,4}. For x∈Σ^*, let prod(x) be the product of symbols in x modulo 7. We take prod(ε)=1, where ε is the null string.
For example, prod(124)=(1×2×4) mod 7=1.
Define L={x∈Σ^*|prod(x)=2}
The number of states in a minimum state DFA for L is ______ (Answer in integer)

(6) is the correct answer.

1 2 3 4 5

Total Unique Visitors

Loading......

CS/IT Gate Yearwise

CS and IT Gate 2025 Set-2 Questions with Answer

Question Options

Sign in to ExamPrev