Register

Which elements will be JOin Irreducible in D60 ?Compilements of 2 and 10 exists?

3,611 views
0 0 votes

Which elements will be JOin Irreducible in D60 ?

Whether complements of 2 and 10 exists or not? 

Express each number  x as join of a minimum number of irredundant join irreducible elements.

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · TanenbaumNext → · output of program
← Previous in category · GATE CSE 1990 | Ques...Next in category → · Suppose a connected ...
Position:
Show:

Related questions

0 0 votes
2 2 answers
4.9k
4.9k views
nehab.sairam asked Jul 18, 2015
4,908 views
Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than 1000 in s.What will be the time complexity???????
1 1 vote
4 4 answers
3.5k
3.5k views
tishhaagrawal asked Dec 4, 2023
3,499 views
Made Easy Probability - Let X be a set containing n elements. Three subsets A,B, C of X are chosen at random. The probability that A, B, C are pairwise disjoint is? (What do they mean by pairwise disjoint? and how should I approach this question?)
Let $X$ be a set containing $n$ elements. Three subsets $A, B, C$ of $X$ are chosen at random. The probability that $\mathrm{A}, \mathrm{B}$ and C are pairwise disjoint, ...
0 0 votes
1 answers 1 answer
13.9k
13.9k views
shivani2010 asked Jun 12, 2016
13,874 views
n elements of a queue are to be reversed using another queue. The number of ADD and REMOVE required to do so is,
A. 2*nB. 4*nC. nD. the task cannot be done
0 0 votes
1 1 answer
871
871 views
dhruba asked Jun 5, 2023
871 views
Consider performing QuickSort on an array of n distinct elements. What is the probability that no comparisons will be made between the smallest and largest element?
Consider performing QuickSort on an array of n distinct elements. What is the probability that no comparisons will be made between the smallest and largest element?a. 1/n...