A ------ is a poset (A, ≤) in which every subset {a, b} of A, has a least upper bound and a greatest lower bound.

Processing math: 100%

M

Mr. Dubey • 52.26K Points
Coach

Q. A ------ is a poset (A, ≤) in which every subset {a, b} of A, has a least upper bound and a greatest lower bound.

(A) Chain

(B) Lattice.

(C) Antichains

(D) Group

Correct : Option (B)

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. DS acquired a building for Rs. $15 lakh in June, 2016 in addition to cost of land beneath the building of$ 3 lakh. It was used for personal purposes

Q. Bluetooth operates in which band?

Q. What is the first stage in software development?

Q. A _________is a linked list which always contains a special node called the header node, at the beginning of the list.

Q. Which of the following statements about component testing is not true?

Q. In how many ways can 8 different dolls be packed in 5 identical gift boxes such that no box is empty if any of the boxes hold all of the toys?

Q. A domain is atomic if elements of the domain are considered to be units.

Q. technology often used in "smart cards," have small radio

Q. 10Base2 signifies in the same manner as 10Base5 except 2 is signified here as ____________ maximum segment length(actually 185 metres)

Q. A computer program that converts an entire program into machine language is called a/an