Pournami P N

Normal
0

false
false
false

EN-IN
X-NONE
X-NONE

/* Style Definitions */
table.MsoNormalTable
{mso-style-name:"Table Normal";
mso-tstyle-rowband-size:0;
mso-tstyle-colband-size:0;
mso-style-noshow:yes;
mso-style-priority:99;
mso-style-qformat:yes;
mso-style-parent:"";
mso-padding-alt:0cm 5.4pt 0cm 5.4pt;
mso-para-margin-top:0cm;
mso-para-margin-right:0cm;
mso-para-margin-bottom:10.0pt;
mso-para-margin-left:0cm;
line-height:115%;
mso-pagination:widow-orphan;
font-size:11.0pt;
font-family:"Calibri","sans-serif";
mso-ascii-font-family:Calibri;
mso-ascii-theme-font:minor-latin;
mso-hansi-font-family:Calibri;
mso-hansi-theme-font:minor-latin;}

CS1001 FOUNDATIONS OF COMPUTING

 

Lecture:

Lecture Hours : Tuesday 9am – 10am, Thursday 10.15am – 11.15am

Tutorial Hours : Monday 1pm – 2pm, Wednesday 2pm – 3pm

Lecture Hall : NLHC 204

 

Instructor:

Name : Pournami P N

Office : CSE 102 Computer Science & Engineering Department Building

Telephone : 0495-2286824

Email : pournamipn@nitc.ac.in

 

Course Objective: To get familiarised with the basic mathematical structures and to learn the basics of logical reasoning

 

Syllabus:

Module 1 : Logic (7 hours)

Propositional logic, implications and inference, equivalence, truth tables. Normal forms. duality, minimization. logic gates and combinational Circuit design, Introduction to first order logic.

 

Module 2 : Sets and Relational structures (7 hours)

Sets, relations, functions, transitive closures, partial order, lattices, boolean lattices, Boolean algebras.

 

Module 3 Proof Techniques and Recursion (7 hours)

Methods of proof using Induction, deduction proofs and contradiction. Recursion and recursive definitions, Writing recursive programs.

 

Module 4 Graphs: (7 hours)

Basic definitions, trees, paths, cycles and elementary properties.

 

References:

1. E. Mendelson, Shaum's outline on boolean algebra and switching circuits, McGraw Hill, 1970.

2. B. Kolman, R. Busby, R. C. Ross, Discrete Mathematics, Pearson (6/e), 2008.

 

 

Grading - Exams and Quizzes:

Mid-Term Exam I : 20%

Mid-Term Exam II : 20%

Quizzes/Assignments : 10%

Final Exam : 50%

 

Grading Policy:

 

•          Grading will be relative.

•          Even though the grading will be relative here is a tentative grade distribution: 90-100: S; 80-89:

•          A; 70-79: B; 60-69: C; 50-59: D; 40-49: E; <40: F.

•          Absence for exams/quizzes without prior written permission from the instructor will be equivalent to zero marks in the corresponding exam/quiz.

•          There will be no makeup exams except in case of genuine reasons. In the event of such exceptional cases, the student must discuss the matter with the instructor and must get written permission before the date of exam.

•          All issues regarding valuation of exams and quizzes/assignments must be resolved within one week after the marks are announced.

 

Standard of Conduct:

 

Each student is expected to adhere to high standards of ethical conduct, especially those related to cheating. Any academic dishonesty will result in zero marks in the corresponding exam or quiz and will be reported to the department council for record keeping and for permission to assign F grade in the course.