The minimum number of ordered pairs that need to be added to R to make (X, R) a lattice is _____.

Note – Numerical Type question

Note – Numerical Type question

- Option : A
- Explanation :

A Hasse Diagram is called a Lattice, if for every pair of elements there exists a LUB and GLB.

In the above Hasse Diagram, LUB and GUB exist for every two elements taken from {a,b,c,d,e}. So, it is already a Lattice.

Hence, Minimum number of ordered pairs that need to be added =0

You must be logged in to post a comment.

- Option : A
- Explanation :

Bottom up parsers in decreasing order of their power: CLR≫ LALR≫ SLR≫ LR (0)

The given statements:

I. Canonical LR is more powerful than SLR is CORRECT.

II. SLR is more powerful than LALR is INCORRECT

III. SLR is more powerful than Canonical LR is INCORRECT.

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : B
- Explanation :

Given L_{1}and L_{2}are context free languages and R is a regular language.

I. L_{1}∪ L_{2}is context free is CORRECT, context free language are closed under union operation.

II. L_{1}is context free is INCORRECT, context free languages are not closed under complement operation.

III. L_{1}- R is Context free is CORRECT.

L_{1}- R = L_{1}∩ R, Context free intersection Regular is always Context free.

IV. L_{1}∩ L_{2}is context free is INCORRECT; context free languages are not closed under complement operation.

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : D
- Explanation :

If every vertex has degree at least k then

You must be logged in to post a comment.

You must be logged in to post a comment.

You must be logged in to post a comment.