Discrete Structures and Applications detailed syllabus scheme for B.Tech Information Technology (IT), 2018-19 onwards has been taken from the DBATU official website and presented for the Bachelor of Technology students. For Subject Code, Course Title, Lecutres, Tutorials, Practice, Credits, and other information, do visit full semester subjects post given below.
For all other DBATU Syllabus for Information Technology 4th Sem 2018-19, do visit IT 4th Sem 2018-19 Onwards Scheme. The detailed syllabus scheme for discrete structures and applications is as follows.
Discrete Structures and Applications Syllabus for Information Technology (IT) 2nd Year 4th Sem 2018-19 DBATU
Course Objectives:
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
.
Course Outcomes:
After learning the course the students should be able:
- To perform operations on various discrete structures such as sets functions, relations, and sequences.
- To solve problems using counting techniques, permutation and combination, recursion and generating functions
- To construct and verify correctness of a Boolean expression using K-Maps and truth tables.
- To use graphs as tools to visualize and simplify Problems.
- To solve problems using algebraic structures (Rings, Monoids and Groups).
UNIT I
The Foundations: Sets theory and its applications sets, Set operations, Laws of set theory, Power sets, Partitions, Multi-sets, Cardinality, Principle of inclusion and exclusion, Algebra of sets and duality, Applications of sets: Problems on set operations and principle of inclusion-exclusion, Logics and proofs, Propositional logic, Propositional equivalences, Propositional algebra, Basic logical operations, De Morgans laws, Predicates and quantifiers, Nested quantifiers, Rules of inference, Proof methods and strategy, Applications of logic: Translating English statements into propositions, Boolean searches in web pages, Bit operations.
UNIT II
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier..
UNIT III
Basic Counting Principles: Permutations, Combinations, Binomial coefficients, Generalized permutations and combinations, Combinations and permutations with repetition, Generating permutations and combinations, Recurrence relation, Solving linear recurrence relations with constant coefficients, Applications of counting principles, Pigeonhole principle and its applications.
UNIT IV
Relations: Properties of binary relations, Closure of relations, Warshalls algorithm, Equivalence relations and partitions, Partial ordering relations and lattice application of relations: N-ary relations and their applications, Databases and relations.
UNIT V
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier..
UNIT VI
Algebraic Structures: Algebraic systems, Groups, Semi groups, Monoid, Subgroups, Permutation groups, Codes and group codes, Isomorphism and automorphisms, Homomorphism, Fermats little theorem, Polynomial rings, Applications of groups.
Text Books:
- K. H. Rosen, Discrete Mathematics and Its Applications, Tata McGraw Hill Publication, 7th Edition, 2012.
- J. P. Tremblay, R. Manohar, Discrete Mathematical Structures with Applications to Computer Science, 1st Edition, McGraw Hill Publication, 2001.
Reference Books:
- B. Kolman, R. Busby, S. Ross, Discrete Mathematical Structures, Pearson Education, 6th Edition, 2009.
- R. K. Bisht, H. S. Dhami, DiscreteMathematics, Oxford University Press, 2015.
For detail syllabus of all other subjects of Information Technology (IT) 4th Sem 2018-19 regulation, visit IT 4th Sem Subjects syllabus for 2018-19 regulation.