Advertisement Remove all ads

Discrete Structures Semester 3 (SE Second Year) BE Computer Engineering University of Mumbai Topics and Syllabus

Advertisement Remove all ads

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.

CBCGS [2017 - current]
CBGS [2013 - 2016]
Old [2000 - 2012]

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

Advertisement Remove all ads
Advertisement Remove all ads
Advertisement Remove all ads

Syllabus

100 Set Theory
  • Sets, Venn diagrams, Operations on Sets
  • Laws of set theory, Power set and Products
  • Partitions of sets, The Principle of Inclusion and Exclusion
200 Logic
  • Propositions and logical operations, Truth tables
  • Equivalence, Implications
  • Laws of logic, Normal Forms
  • Predicates and Quantifiers
  • Mathematical Induction
300 Relations, Digraphs and Lattices
  • 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
400 Functions and Pigeon Hole Principle
  • Definition and types of functions:- Injective, Surjective and Bijective
  • Composition, Identity and Inverse
  • Pigeon-hole principle
500 Generating Functions and Recurrence Relations
  • Series and Sequences
  • Generating functions
  • Recurrence relations
  • Recursive Functions:- Applications of recurrence relations e,g, Factorial, Fibonacci, Binary search, Quick Sort etc.
600 Graphs and Subgraphs
  • Definitions, Paths and circuits:- Eulerian and Hamiltonian
  • Planer graphs, Graph coloring
  • Isomorphism of graphs
  • Subgraphs and Subgraph isomorphism
700 Trees
  • Trees and weighted trees
  • Spanning trees and minimum spanning tree
  • Isomorphism of trees and sub trees
  • Prefix codes
800 Algebraic Structures
  • 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
Advertisement Remove all ads
Advertisement Remove all ads
Share
Notifications

View all notifications


      Forgot password?
View in app×