Aspire Faculty ID #19219 · Topic: UGC NET Computer Science June 2019 (Paper II) · Just now
UGC NET Computer Science June 2019 (Paper II)

Consider the poset $\left({3,5,9,15,24,45}, \mid\right)$.

Which of the following is correct for the given poset?

Solution

In divisibility poset, least element means an element which divides every element.

Here, $3$ does not divide $5$, so $3$ is not the least element.

Similarly, no other element divides all elements of the set.

So, least element does not exist.

Greatest element means an element which is divisible by every element.

Here, $45$ is not divisible by $24$.

Also, no other element is divisible by all elements of the set.

So, greatest element does not exist.

Therefore, there does not exist a greatest element and a least element.

Next 10 Questions — UGC NET Computer Science June 2019 (Paper II)

Ascending by ID
1
How many ways are there to place $8$ indistinguishable balls into four distinguishable bins?
Topic: UGC NET Computer Science June 2019 (Paper II)
2
How many bit strings of length ten either start with a $1$ bit or end with two bits $00$?
Topic: UGC NET Computer Science June 2019 (Paper II)
3
Suppose that a connected planar graph has six vertices, each of degree four. Into how many regions is the plane divided…
Topic: UGC NET Computer Science June 2019 (Paper II)
4
For which values of $m$ and $n$ does the complete bipartite graph $K_{m,n}$ have a Hamilton circuit?
Topic: UGC NET Computer Science June 2019 (Paper II)
5
Which of the following is principal conjunctive normal form for $[(p \vee q)\wedge[p \to q]]$?
Topic: UGC NET Computer Science June 2019 (Paper II)
6
How many cards must be selected from a standard deck of $52$ cards to guarantee that at least three hearts are present …
Topic: UGC NET Computer Science June 2019 (Paper II)
7
List-I List-II (a) $p \to q$ (i) $\neg(q \to \neg p)$ …
Topic: UGC NET Computer Science June 2019 (Paper II)
8
Find the zero-one matrix of the transitive closure of the relation given by the matrix $A$:
Topic: UGC NET Computer Science June 2019 (Paper II)
9
Consider an LPP given as: $\text{Max } Z=2x_1-x_2+2x_3$ subject to the constraints: $2x_1+x_2\le 10$ $x_1+2x_2-2x_3\le …
Topic: UGC NET Computer Science June 2019 (Paper II)
10
Which type of addressing mode requires the least number of memory references?
Topic: UGC NET Computer Science June 2019 (Paper II)
Ask Your Question or Put Your Review.

loading...