Birla Institute of Technology & Science, Pilani Work-Integrated Learning Programmes Division Second Semester 2011-2012 Course Handout

Course Number Course Title Instructor Course Description Language of math, sets & operation on sets, relations & equivalence relations, elementary logic, propositions, informal proof, logical equivalence, mathematical induction weak- strong, counting pigeonhole principle, recurrence relations, graph, relations and digraph Permutations, combinations and partitions; Recurrence relations and generating functions; partially ordered set, Boolean algebra; Semigroups & groups, product & Quotient semigroup. Scope and Objectives After doing this course a student can understand various features of Discrete Mathematical Structures and also learn some techniques applicable in different branches of computer science. Prescribed Textbook
T1.

: MATH ZC222 : Discrete Structures for Computer Science : Trilok Mathur

Kolman Bernard and S.C. Ross, Discrete Mathematical Structures, Prentice-Hall of India, 6th Ed., 2009.

Reference Book(s)
R1. R2. R3.

C.L. Liu, Elements of Discrete Mathematics, 2nd Edition, McGraw Hill, 1986. Goodaire & Parmenter : Discrete mathematics & graph theory, Pearson Education, 2000. Kenneth H. Rosen, Discrete Mathematics and its applications, Tata McGraw Hill, 6th Ed., 2007. (eBook) http://www.mhhe.com/rosen/dm6e

R4. D.S. Malik and M.K. Sen, Discrete Mathematical Structures: Theory and Applications, Thomson, 2004.

MATH ZC222 (Course Handout) Plan of Self Study: Week Topics No. 1 Sets, Operations on sets, Sequences, Matrices 2 Propositions, Conditional statements, truth table 3 Mathematical induction weak & strong form, Permutation & combinations, 4 Pigeonhole principle, Recurrence relations

Second Semester 2011-2012 Learning Objectives Introduction and overview of language of mathematics. To develop logical and mathematical concepts necessary to appreciate computational systems. Also to prove theorems with the techniques of direct proof, proof by contraposition, proof by contradiction, and proof by induction., recursive definitions and to write recursive definitions for certain sequences and collections of objects To construct formal proofs in prepositional and predicate logic and through such proofs help them to determine the validity of English language arguments. Also to develop some basic technique of combinatorics.

Page 2 Reference to Text Book Chapter 1 Chapter 2: 2.1-2.3 Chapter 2 : 2.4 Chapter 3 : 3.1-3.2 Chapter 3.3 3.5

5 6 7 8 9 10 11 12 13 14 15 16 17 18

Relations and their matrix To study of concepts, techniques, and Chapter 4.1-4.3 representation skills necessary to comprehend the Paths in Relations & digraph, structure of problems encountered in designing and implementing Chapter 4.4-4.5 Properties of relations, computer systems and software. Equivalence relation Closure & transitive closure Chapter 4.7-4.8 of relations Partially ordered sets, Chapter 6.1-6.4 Lattices, Boolean Algebras Review Session Syllabus for Mid-Semester Test (Closed Book): Topics in Week No. 1 to 9 Functions permutation Chapter 5 function, growth of functions Trees, Labeled Trees To provide the foundations for Chapter 7: 7.1, 7.2 understanding computer science, that Chapter 7: 7.3 Tree searching relies upon the comprehension of Undirected trees, Minimal Chapter 7.4-7.5 formal abstract concepts Spanning Trees Graph theory, Hamiltonian & To provide basic concepts of graph Chapter 8: 8.1-8.3 Eulerian graph theory and their applications. Matching problems & Chapter 8: 8.5 - 8.6 Coloring graphs Semigroups, Products and To develop elementary algebra Chapter : 9.1- 9.3 Quotients of Semigroups needed for few courses in computer science Groups Chapter 9: 9.4 Review Session Syllabus for Comprehensive Exam (Open Book): All topics given in Plan of Self Study Second Semester 2011-2012 Page 3

MATH ZC222 (Course Handout)

Evaluation Scheme: EC No. EC-1 Evaluation Component & Type of Examination Assignment/Quiz Duration ** Details to be announced on LMS Taxila website by Instructor 2 Hours 3 Hours Weightage 10% Day, Date, Session,Time ** Details to be announced on LMS Taxila website by Instructor Saturday, 11/02/2012 (FN)* 10 AM 12 Noon Saturday, 07/04/2012 (FN)* 9 AM 12 Noon

EC-2 EC-3

Mid-Semester Test (Closed Book)* Comprehensive Exam (Open Book)*

30% 60%

** Please check the details by January 2nd Week on LMS Taxila web site.
* Legend: AN: AfterNoon Session; FN: ForeNoon Session Closed Book Test: No reference material of any kind will be permitted inside the exam hall. Open Book Exam: Use of any printed / written reference material (books and notebooks) will be permitted inside the exam hall. Loose sheets of paper will not be permitted. Computers of any kind will not be allowed inside the exam hall. Use of calculators will be allowed in all exams. No exchange of any material will be allowed. Note: It shall be the responsibility of the individual student to be regular in maintaining the self study schedule as given in the course handout, attend the online/on demand lectures as per details that would be put up in the BITS LMS Taxila website www.taxila.bits-pilani.ac.in and take all the prescribed components of the evaluation such as Assignment (Course Page on LMS Taxila), Mid Semester Test and Comprehensive Examination according to the Evaluation Scheme given in the respective Course Handout. If the student is unable to appear for the Regular Test/Examination due to genuine exigencies, the student must refer to the procedure for applying for Make-up Test/Examination, which will be available through the Important Information link on the BITS WILP website on the date of the Regular Test/Examination. The Make-up Tests/Exams will be conducted only at selected exam centres on the dates to be announced later. Instructor-in-Charges