Sail E0 Webinar

Quantitative Aptitude

ALGEBRA MCQs

Basic Algebraic Identities Of School Algebra & Elementary Surds

Total Questions : 1010 | Page 20 of 101 pages
Question 191.  let x = {2, 3, 6, 12, 24}, and ≤ be the partial order defined by x ≤ y if x divides y. number of edges in the hasse diagram of (x, ≤ ) is
  1.    1
  2.    3
  3.    4
  4.    7
 Discuss Question
Answer: Option C. -> 4
Explanation :
Question 192.  hasse diagrams are drawn for
  1.    lattices
  2.    boolean Algebra
  3.    partially ordered sets
  4.    none of these
 Discuss Question
Answer: Option D. -> none of these
Explanation :
Question 193.  let d30 = {1, 2, 3, 4, 5, 6, 10, 15, 30} and relation i be partial ordering on d30. the all lower bounds of 10 and 15 respectively are
  1.    1,5
  2.    1,7
  3.    1,3,5
  4.    None of these
 Discuss Question
Answer: Option A. -> 1,5
Explanation :
Question 194.  a self-complemented, distributive lattice is called
  1.    Self dual lattice
  2.    Complete lattice
  3.    Modular lattice
  4.    Boolean algebra
 Discuss Question
Answer: Option D. -> Boolean algebra
Explanation :
Question 195.  let d30 = {1, 2, 3, 4, 5, 6, 10, 15, 30} and relation i be partial ordering on d30. the all lower bounds of 10 and 15 respectively are
  1.    1,5
  2.    1,7
  3.    1,3,5
  4.    None of these
 Discuss Question
Answer: Option A. -> 1,5
Explanation :
Question 196.  hasse diagrams are drawn for
  1.    lattices
  2.    boolean Algebra
  3.    partially ordered sets
  4.    none of these
 Discuss Question
Answer: Option D. -> none of these
Explanation :
Question 197.  a self-complemented, distributive lattice is called
  1.    Self dual lattice
  2.    Modular lattice
  3.    Complete lattice
  4.    Boolean algebra
 Discuss Question
Answer: Option D. -> Boolean algebra
Explanation :
Question 198.  different partially ordered sets may be represented by the same hasse diagram if they are
  1.    same
  2.    isomorphic
  3.    order-isomorphic
  4.    lattices with same order
 Discuss Question
Answer: Option C. -> order-isomorphic
Explanation :
Question 199.  principle of duality is defined as
  1.    all properties are unaltered when  ≤ is replaced by ≥ other than 0 and 1 element.
  2.    all properties are unaltered when  ≤ is replaced by ≥
  3.    LUB becomes GLB
  4.    ≤ is replaced by ≥
 Discuss Question
Answer: Option A. -> all properties are unaltered when  ≤ is replaced by ≥ other than 0 and 1 element.
Explanation :
Question 200.  a self-complemented, distributive lattice is called
  1.    Self dual lattice
  2.    Modular lattice
  3.    Complete lattice
  4.    Boolean algebra
 Discuss Question
Answer: Option D. -> Boolean algebra
Explanation :

Latest Videos

Latest Test Papers