Scribd
Upload
5 views5 pages

Discrete

Discrete

Uploaded by

Abhishek Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views5 pages

Discrete

Discrete

Uploaded by

Abhishek Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

ALS IVth Semester

Name: Himan Diwaken

FATHER'S NAME-RASKUMAR DIWAKAR

PAPERE DISCRETE MATHEMATICAL STRUCTURES 1. Which of the following statements


aliout lattices is tru

al Lattices are always finite sets.

b) Every lattice is a totally ordered set.

Hatices are partially ordered sits with

certain properties 4) Lattices cannot have a greatest element.

2. In a latrice, the greatest lower bound infinum) of two elemens

a) May not ex

Always exists

Exists only for finite lattices.

d) Exists only for totally ordered lattices.

3. Which property distinguishes a lattice from a general partially ordered set?

a) Reflexivity

b) Transitivity

c) Antisymmetry

Existence of all pairwise supremums and infimums.

4. In a lattice, the element which is both the greatest lower bound and the least upper hound of
a subens called

al Maximal element b) Minimal element

Upper bound
Meet and juin of subset

5. A lattice in which every nonempty finite subset has both a supremum and an infimum is called

complete lattice

c) A bounded lattice

b) A finite lattice

d) A modular lattic

6. Which of the following statements about the lattice operations meet and join is true?

a) Meet distributes over join in all lattices.

b) Join distributes over meet in all lattices

c) Meet and join commute in all lattices.

Meet and join need not commute in all lattices.

7. In a lattice, an element that is less than or equal to every other element is called:

a) Maximal element

Minimal element

c) Upper bound

d) Lower bound

8. Which of the following is not a property of a lattice?

a) Antisymmetry

b) Transitivity

c) Reflexivity

Commutativity

9. In a lattice, the operation of "meet" is also known as:


Intersection

b) Union

c) Difference

d) complement

10.In a lattice, the operation of "Join" is also known as

a) Intersection

Union

c) Difference

d) complement

ILIG PrGarram, what does a loop represent Itse An element related to in

b) An unrelated pair of elements


Astrit para under

A total order

. What is Hess diagram primarily used fic? 12

Vimalting partially untered us

Representing directed acyclic graphs

Analysing statistical date

4) Blustrating geomeτής στομος

15. How are elements represented in a less diagram?

by pots or des By Bi By atrows lines di By numbers

14. In a Hess diagram, what do upward-potting arия героями?

Greeter than relation 1) Less than relation

Equivalence relation
d) Incomparable relation

15. In a directed graph, what do the edges represent?

al Connections between vertices with no direction Connections between vertices with direcion

c) Distances between vertices

d) The size of the graph

16. What is the degree of a vertex in a graph The number of edges incident to it

b) The number of vertices incident to

The length of the shortest path to another vertex

d) The number of connected components it belongs to

17.What is a cycle in a graph?

a) A set of vertices without any edges

bl A set of edges without any vertices

closed path in which no vertex (except the first and last) appears more than once

d) A path with no vertices

18. What is a spanning tree of a graph?

a) A tree with maximum height

b) A tree with minimum height

tree that includes all the vertices of the graph

d) A tree with the maximum number of edges

19. What is the maximum number of edges in an undirected graph with 'n vertices?

a) n

(n-1)/2
bin-1

din^2

20. What is a graph in graph theory?

a) A mathematical function

A collection of vertices and edges

OPPO A53s 5G shape

204405del lambers

You might also like