GATE CSE 2022 Paper 1 — page 5

Questions 13–15 of 65. Imported answers require review unless explicitly marked reviewed.

Which one of the following statements is TRUE?

Your answerChoose one option.

The

parser for a grammar

cannot have reduce-reduce conflict if the

parser for

does not have reduce-reduce conflict.

Symbol table is accessed only during the lexical analysis phase.

Data flow analysis is necessary for run-time memory management.

parsing is sufficient for deterministic context-free languages.

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

In a relational data model, which one of the following statements is TRUE?

Your answerChoose one option.

A relation with only two attributes is always in BCNF.

If all attributes of a relation are prime attributes, then the relation is in BCNF.

Every relation has at least one non-prime attribute.

BCNF decompositions preserve functional dependencies.

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

Consider the problem of reversing a singly linked list. To take an example, given the linked list below,

the reversed linked list should look like

Which one of the following statements is TRUE about the time complexity of algorithms that solve the above problem in

space?

Your answerChoose one option.

The best algorithm for the problem takes

time in the worst case.

The best algorithm for the problem takes

time in the worst case.

The best algorithm for the problem takes

time in the worst case.

It is not possible to reverse a singly linked list in

space.

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

2022 · Paper 1