CSC303: Discrete Structures Syllabus for CS 3rd Sem 2017 Pattern Mumbai University

Discrete Structures detailed syllabus scheme for Computer Engineering (CS), 2017 regulation has been taken from the University of Mumbai official website and presented for the Bachelor of Engineering students. For Course Code, Course Title, Test 1, Test 2, Avg, End Sem Exam, Team Work, Practical, Oral, Total, and other information, do visit full semester subjects post given below.

For all other Mumbai University Computer Engineering 3rd Sem Syllabus 2017 Pattern, do visit CS 3rd Sem 2017 Pattern Scheme. The detailed syllabus scheme for discrete structures is as follows.

Discrete Structures Syllabus for Computer Engineering SE 3rd Sem 2017 Pattern Mumbai University

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:

At the end of the course student will be able to

1. Understand the notion of mathematical thinking, mathematical proofs and to apply them in problem solving.
2. Ability to reason logically.
3. Ability to understand relations, Diagraph and lattice.
4. Ability to understand use of functions, graphs and their use in programming applications.
5. Understand use of groups and codes in Encoding-Decoding
6. Apply discrete structures into other computing problems such as formal specification, verification, artificial intelligence, cryptography, Data Analysis and Data Mining etc.

Prerequisites:

Basic Mathematics

Module 1

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 4

Module 2

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.
.

Module 3

Relations and Functions

• Relations, Paths and Digraphs
• Properties and types of binary relations
• Operations on relations, Closures, Warshalls algorithm
• Equivalence and partial ordered relations,
• Poset, Hasse diagram and Lattice
• Functions: Types of functions – Injective, Surjective and Bijective 12
• Composition of functions , Identity and Inverse function
• Pigeon-hole principle

Module 4

Counting

• Permutations , Combinations
• Elements of Probability, Discrete Probability and Conditional Probability
• Generating Functions and Recurrence Relations
• Recursive Functions
• Introduction to Functional Programming 6

Module 5

Graphs

• Definitions, Paths and circuits: Eulerian and Hamiltonian
• Types of graphs, Sub Graphs
• Isomorphism of graphs 6

Module 6

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.
.

Text Books:

1. BernadKolman, Robert Busby, Sharon Cutler Ross, Nadeem-ur-Rehman, Discrete Mathematical Structures, Pearson Education.
2. C.L.Liu, Elements of Discrete Mathematics, second edition 1985, McGraw-Hill BookCompany. Reprinted 2000.
3. K.H.Rosen, Discrete Mathematics and applications, fifth edition 2003, TataMcGraw Hill publishing Company.
4. D.E. Rydeheard University of Manchester , R.M. Burstall, University of Edinburgh Computational Category Theory.

Reference Books:

1. Y N Singh, Discrete Mathematical Structures, Wiley-India.
2. J .L.Mott, A.Kandel, T.P .Baker, Discrete Mathematics for Computer Scientists and Mathematicians, second edition 1986, Prentice Hall of India.
3. J. P. Trembley, R. Manohar Discrete Mathematical Structures with Applications to Computer Science, T ataMcgraw-Hill.
4. Seymour Lipschutz , Marc Lars Lipson, Discrete Mathematics SchaumsOutline, McGraw Hill Education.

Internal Assessment Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed. Duration of each test shall be one hour.

Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

Tutorial lecture can be conducted for each unit and min 10 problems on the covered unit can be given to the students for practice.

For detail syllabus of all other subjects of Computer Engineering (CS) 3rd Sem 2017 regulation, visit CS 3rd Sem Subjects syllabus for 2017 regulation.