GATE CSE 2026 Paper 1 — page 10

Questions 28–30 of 65. Imported answers require review unless explicitly marked reviewed.

Paper practice 65 questionsPage 10 of 22

Which of the following statements is/are true?

Your answerSelect all correct options. You can choose more than one.

LL(1) parser uses backtracking

For a grammar to be LL(1), it must be left-recursive

For a grammar to be LL(1), it must be left-factored

The LL(1) parsers are more powerful than the SLR parsers

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

With respect to deadlocks in an operating system, which of the following statements is/are FALSE?

Your answerSelect all correct options. You can choose more than one.

Banker’s algorithm is used to prevent deadlocks

Deadlock formation can be prevented by ensuring that the hold and wait condition is not allowed

An assignment edge in a resource allocation graph is marked from a process to a resource

A safe state guarantees that all processes can finish without formation of a deadlock

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Let

and

be the attributes of a relation in a relational schema. Let

indicate functional dependency in the context of a relational database, where

Which of the following options is/are always true?

Your answerSelect all correct options. You can choose more than one.

and

, then

and

, then

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

2026 · Paper 1