AY 2007-2008/Sem-1/Mathematical Foundations of Information Technology

From IIITM-k-wiki

Contents 1 Course Description 2 Instructors 2.1 Principal Instructor 2.2 Associate Instructor 3 Location 4 Class Schedule 5 Credits 6 Target Audience 7 Prerequisites 8 Course Syllabus 8.1 Text-Book 8.2 Reference Books 9 Evaluation

Course Description

This is a foundational course on Discrete Mathematics. The purpose of this course is to introduce students to ideas and techniques of discrete structures which form the backbone of Computer Science. This course introduces the topics of logic, sets, functions, algorithms, integers, matrices, mathematical reasoning, counting, discrete probability, recurrence relations, relations, graphs and trees with applications in computer science.

Instructors

Principal Instructor

Dr. V. Sundarapandian, Professor, IIITM-K

Associate Instructor

Dr. T.K. Manoj Kumar, Assistant Professor, IIITM-K

Location

IIITM-K, Park Centre, Technopark

Class Schedule

• Tuesday (9-10.10 A.M.)
• Wednesday (9-10.10 A.M., 11.50-1 P.M.)
• Thursday (2-3.10 P.M.)

Credits

4

Target Audience

• Post-graduate students of IIITM-K
• People from Academic Institutions
• People from Industry

Prerequisites

• Concepts of high school algebra

Course Syllabus

1. The Foundations: Logic, sets and functions
2. The Fundamentals: Algorithms, the integers and matrices
3. Mathematical reasoning, induction and recursion
4. Counting
5. Discrete Probability
6. Advanced Counting Techniques
7. Relations
8. Graphs
9. Trees

Text-Book

1. Kenneth H. Rosen, Discrete Mathematics and its Applications (5th edition),Tata McGraw-Hill, New Delhi, 2002.

Reference Books

1. R. Johnsonbough, Discrete Mathematics (5th edition), Pearson Education, New Delhi, 2000.
2. C.L. Liu, Elements of Discrete Mathematics (2nd edition), Tata-McGraw Hill, New Delhi, 2000.

Evaluation

Evaluation will be based on the following:

• Homework Assignments: 10%
• Quizzes: 20%
• Midterm: 30%
• Final Exam: 40%