Complete GATE CSE 2025 Paper 1 overview, original pages and practice · Timed previous-paper practice

Questions 19–21 of 65. Imported answers require review unless explicitly marked reviewed.

Paper practice 65 questionsPage 7 of 22

Question 19

Open question
CSMCQ1 markNeeds review
Consider the following context-free grammar

, where

,

, and

are the variables (non-terminals),

and

are the terminal symbols,

is the start variable, and the rules of

are described as:

Which ONE of the languages

is accepted by

?
Your answerChoose one option.

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

Question 20

Open question
CSMCQ1 markNeeds review
Consider the following recurrence relation:

for

Which ONE of the following options is CORRECT?
Your answerChoose one option.

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

Question 21

Open question
CSMSQ1 markNeeds review
Consider the following

tree with 5 nodes, in which a node can store at most 3 key values. The value 23 is now inserted in the

tree. Which of the following option(s) is/are CORRECT?
Tree diagram: root keys 6, 12, 19; four leaf nodes contain, respectively, 1, 4, 3; 7, 9, 10; 13, 15, 17; and 20, 21, 22.
Diagram for Computer Science and Information Technology question 21

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 answer