GATE CSE 2026 Paper 2 — page 14

Questions 40–42 of 65. Imported answers require review unless explicitly marked reviewed.

Consider the following 4-variable Boolean function

Consider

as MSB,

as LSB. Which one of the following options represents the minimal sum of products form for the above function?

Note:

is OR operation,

is AND operation,

is NOT operation

Your answerChoose one option.

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

Consider the canonical

parsing of the grammar below using terminals

and non-terminals

with

as the start symbol.

Which one of the following options gives the number of shift-reduce conflicts that will occur in the

ACTION table?

Your answerChoose one option.

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

In the context of schema normalization in relational DBMS, consider a set

of functional dependencies. The set of all functional dependencies implied by

is called the closure of

. To compute the closure of

, Armstrong’s axioms can be applied. Consider

, and

as sets of attributes over a relational schema. The three rules of Armstrong’s Axioms are described as follows.

Reflexivity: If

, then

Augmentation: If

, then

for any

Transitivity: If

and

, then

The additional rule of Union is defined as follows.

Union: If

and

, then

It can be proved that the additional rule of Union is also implied by the three rules of Armstrong’s Axioms. Listed below are four combinations of these three rules. Which one of these combinations is both necessary and sufficient for the proof?

Your answerChoose one option.

Reflexivity, Augmentation, and Transitivity

Reflexivity and Augmentation

Transitivity

Augmentation and Transitivity

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

2026 · Paper 2

Question 40

Question 41

Question 42