Computer Science and Information Technology
2025 · Paper 1
Take it one question at a time. Try an answer, then check your understanding.
Complete GATE CSE 2025 Paper 1 overview, original pages and practice · Timed previous-paper practice
Questions 28–30 of 65. Imported answers require review unless explicitly marked reviewed.
Question 28
Open questionCSMSQ1 markNeeds review
A regular language
is accepted by a non-deterministic finite automaton (NFA) with
states. Which of the following statement(s) is/are FALSE?Your answerSelect all correct options. You can choose more than one.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 29
Open questionCSNAT1 markNeeds review
Suppose in a multiprogramming environment, the following C program segment is executed. A process goes into I/O queue whenever an I/O related operation is performed. Assume that there will always be a context switch whenever a process requests for an I/O, and also whenever the process returns from an I/O. The number of times the process will enter the ready queue during its life time (not counting the time the process enters the ready queue when it is run initially) is ______. (Answer in integer)
int main()
{
int x=0,i=0;
scanf("%d",&x);
for(i=0; i<20; i++)
{
x = x+20;
printf("%d\n",x);
}
return 0;
}
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 30
Open questionCSNAT1 markNeeds review
Let
be the set of all ternary strings defined over the alphabet
. Consider all strings in
that contain at least one occurrence of two consecutive symbols, that is, “aa”, “bb” or “cc”. The number of such strings of length 5 that are possible is ______. (Answer in integer)Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer