University of Mumbai Syllabus For Semester 3 (SE Second Year) Discrete Structures: Knowing the Syllabus is very important for the students of Semester 3 (SE Second Year). Shaalaa has also provided a list of topics that every student needs to understand.

The University of Mumbai Semester 3 (SE Second Year) Discrete Structures syllabus for the academic year 2021-2022 is based on the Board's guidelines. Students should read the Semester 3 (SE Second Year) Discrete Structures Syllabus to learn about the subject's subjects and subtopics.

Students will discover the unit names, chapters under each unit, and subtopics under each chapter in the University of Mumbai Semester 3 (SE Second Year) Discrete Structures Syllabus pdf 2021-2022. They will also receive a complete practical syllabus for Semester 3 (SE Second Year) Discrete Structures in addition to this.

## University of Mumbai Semester 3 (SE Second Year) Discrete Structures Revised Syllabus

University of Mumbai Semester 3 (SE Second Year) Discrete Structures and their Unit wise marks distribution

### University of Mumbai Semester 3 (SE Second Year) Discrete Structures Course Structure 2021-2022 With Marking Scheme

# | Unit/Topic | Marks |
---|---|---|

100 | Set Theory | |

200 | Logic | |

300 | Relations, Digraphs and Lattices | |

400 | Functions and Pigeon Hole Principle | |

500 | Generating Functions and Recurrence Relations | |

600 | Graphs and Subgraphs | |

700 | Trees | |

800 | Algebraic Structures | |

Total | - |

## Syllabus

- Sets, Venn diagrams, Operations on Sets
- Laws of set theory, Power set and Products
- Partitions of sets, The Principle of Inclusion and Exclusion

- Propositions and logical operations, Truth tables
- Equivalence, Implications
- Laws of logic, Normal Forms
- Predicates and Quantifiers
- Mathematical Induction

- Relations, Paths and Digraphs
- Properties and types of binary relations
- Manipulation of relations, Closures, Warshall’s algorithm
- Equivalence and partial ordered relations
- Posets and Hasse diagram
- Lattice

- Definition and types of functions:- Injective, Surjective and Bijective
- Composition, Identity and Inverse
- Pigeon-hole principle

- Series and Sequences
- Generating functions
- Recurrence relations
- Recursive Functions:- Applications of recurrence relations e,g, Factorial, Fibonacci, Binary search, Quick Sort etc.

- Definitions, Paths and circuits:- Eulerian and Hamiltonian
- Planer graphs, Graph coloring
- Isomorphism of graphs
- Subgraphs and Subgraph isomorphism

- Trees and weighted trees
- Spanning trees and minimum spanning tree
- Isomorphism of trees and sub trees
- Prefix codes

- Algebraic structures with one binary operation:- semigroup, monoids and groups
- Product and quotient of algebraic structures
- Isomorphism, Homomorphism and Automorphism
- Cyclic groups, Normal subgroups
- Codes and group codes