Scribd
Upload
20 views

DSAT Assignment

The document contains assignments from Dr. A D Shinde College of Engineering covering topics in set theory, relations, functions, graph theory, and algorithms. It includes problems on operations on sets, laws of set theory, truth tables, properties of relations, closures, Hasse diagrams, and graph definitions. Additionally, it addresses concepts like Hamiltonian and Eulerian graphs, isomorphism, and Dijkstra's algorithm.

Uploaded by

harshadpowar2212
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
20 views

DSAT Assignment

The document contains assignments from Dr. A D Shinde College of Engineering covering topics in set theory, relations, functions, graph theory, and algorithms. It includes problems on operations on sets, laws of set theory, truth tables, properties of relations, closures, Hasse diagrams, and graph definitions. Additionally, it addresses concepts like Hamiltonian and Eulerian graphs, isomorphism, and Dijkstra's algorithm.

Uploaded by

harshadpowar2212
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/ 4

DR.

A D SHINDE COLLEGE OF ENGINEERING, BHADGAON

ASSIGNMENT-1
1) Explain different operations performed on sets.
2) Explain different laws of set theory.
3) Find the power set of A= {1,2}.
4) Out of 120 students surveyed it was found that 20 students have studied French, 50
students have studied English, 70 students have studied Hindi, 5 students have
studied English & French, 20 students have studied English & Hindi, 10 students
have studied Hindi & French, and only 3 have studied all 3 languages. Find how
many students have studied
i) Hindi alone.
ii) French alone.
iii) English but not Hindi.
iv) Hindi but not French.
5) Prove by mathematical Induction for all positive integers
𝟏
𝒏 ≥ 𝟏; 𝟏 + 𝟐 + 𝟑+ _ _ _ _ _ + 𝒏 = 𝒏(𝒏 + 𝟏)
𝟐

6) Construct the Truth Table for the following Propositions:


i) 𝒑⋀𝒒 → (∼ 𝒓)
ii) 𝒑 → (𝒒⋀𝒓) ⇔ (𝒑 → 𝒒)⋀(𝒑 → 𝒓)
7) “All students are hardworking and some students are lazy” write the given quantifier in
symbolic form and apply the negation to the obtained quantifier.
8) Let D={1,2,3_ _ _ _ _ _ _ ,9} Determine truth value of each of the following statement;
i) ∀ 𝑥 ∈ 𝐷 ; 𝑥 + 4 < 15
ii) ∃ 𝑥 ∈ 𝐷 ; 𝑥 + 4 = 10
iii) ∀ 𝑥 ∈ 𝐷 ; 𝑥 + 4 ≤ 10
iv) ∃ 𝑥 ∈ 𝐷 ; 𝑥 + 4 > 15

ASSIGNMENT-2
1) List and explain different properties of Relation.
2) Digraph of a relation ‘R’ on set A={1,2,3} is given below Determine whether ‘R’ is
equivalence or not.

DR. A D SHINDE COLLEGE OF ENGINEERING, BHADGAON PROF. I M TRASGAR


DR. A D SHINDE COLLEGE OF ENGINEERING, BHADGAON

3) Let A={1,2,3,4} and R={(1,1) (1,2) (2,3) (2,2) (3,4)} be the relation ‘A’. Find the
Reflexive Closure, Symmetric Closure and Transitive Closure of ‘R’.
4) Draw the Hasse diagram of the following POSETS;
i) P1= ({1,2,3,6};/)
ii) P2= ({1,2,3,4,5,6};/)
iii) P3= ({2,3,6,12,24,36};/)
iv) 𝑫𝟏𝟔
v) 𝑫𝟏𝟐
5) Explain types of functions with example?
6) Among 100 peoples, find the number of peoples who born in same month?
7) What is minimum number of students required in a class to be sure that at-least 6 of
them will receive the same grade. If there are 5 possible grades A, B, C, D, F.

ASSIGNMENT-3
1) Define the following terms:
i) Graph
ii) Degree
iii) Path
iv) Cycle
v) Subgraph
2) Draw the Bi-partite graph of the given graph

3) Draw the planar graph of the given graph


u

z v

y w

DR. A D SHINDE COLLEGE OF ENGINEERING, BHADGAON PROF. I M TRASGAR


DR. A D SHINDE COLLEGE OF ENGINEERING, BHADGAON

4) Draw the complement of the given graph

z v

y w

5) With respect to given graph find the following:

i) Draw Hamiltonian circuit and Hamiltonian path


ii) Is it a Hamiltonian Graph.
iii) Is it a Eulerian Graph.

6) Check whether the given graphs are Isomorphic or not.

7) Define Tree and Explain its types.

DR. A D SHINDE COLLEGE OF ENGINEERING, BHADGAON PROF. I M TRASGAR


DR. A D SHINDE COLLEGE OF ENGINEERING, BHADGAON

8) Compute Shortest path between A & F Using Dijkstra’s Algorithm.

DR. A D SHINDE COLLEGE OF ENGINEERING, BHADGAON PROF. I M TRASGAR

You might also like