Scribd
Upload
9 views4 pages

Course Handout

Very nice

Uploaded by

hamzashaikh.hs34
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views4 pages

Course Handout

Very nice

Uploaded by

hamzashaikh.hs34
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

​

​
BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI
WORK INTEGRATED LEARNING PROGRAMMES
​ COURSE HANDOUT
​
​Part A: Content Design
Course Title Discrete Structures for Computer Science
Course No(s) SE* ZC252/ MATH ZC222
Credit Units 3
Course Author Prof. Dr YVK Ravi Kumar
Version No
Date
​
​
Course Description
​ Introduction to discrete mathematical structures; Formal logic and predicate calculus; Sets, relations and
functions; Proof techniques; Graphs and trees; Primes, factorization, greatest common divisor, residues
and application to cryptology; Permutations, combinations and partitions; Recurrence relations.

Course Objectives
No Course Objective

CO1 To understand the logic which is the basis for programming

CO2 To understand techniques for analysis of algorithms- Recurrence relations

CO3 To learn the basics required for cryptology and Graph Theory

Text Books
T1 Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw Hill, 5 th Ed., 2004.

Reference Books
Kolman, Busby, Ross and Rehman, Discrete Mathematical Structures for Computer Science,
R1
Pearson Education, 5th Edition, 2003.
D.S. Malik and M.K. Sen, Discrete Mathematical Structures: Theory and Applications, Thomson,
R2
2004.
R3 Goodaire & Parmenter : Discrete Mathematics & Graph Theory, Pearson Education, 2000.
R4 C.L. Liu, Elements of Discrete Mathematics, 2nd Edition, McGraw Hill, 1986.

Modular Structure

No Title of the Module


M1 Mathematical Logic – Propositional logic, propositional equivalence, predicate logic
M2 Inference Rules, Proof Methods, Strong & Weak induction
M3 Sets, Functions and Relations
M4 Combinatorics, Recursion, Recurrence relation
M5 Graph Theory
M6 Introduction to Cryptography

Learning Outcomes
No Learning outcome

LO1 Student will be able to understand the logic behind the validation of statements in programming

LO2 Student should be confident of analysing algorithms in particular using recurrence relations

LO3 Students are confident of Graph theory concepts so that understanding data structures becomes
very simple

Part B: Contact Session Plan


Academic Term
Course Title Discrete Structures for Computer Science
Course No
Lead Instructor

Course Contents

Contact List of Topic Title Text/Ref Book/external


Sessions(#) (from content structure in Course Handout) resource

1 M1: Mathematical Logic


Introduction to Discrete structures T1-Chapter 1
Propositional Logic

2 M1: Mathematical Logic


Propositional Equivalence T1-Chapter 1
Predicates and Quantifiers
Nested Quantifiers

3 M2: Inferences
Inference rules T1-Chapter 1

4 M2: Inferences T1-Chapter 1


Introduction to proofs
Strong and weak induction

5 M3: Sets, Relations & Functions T1-Chapter 2


Sets, operations on Sets
Venn diagrams , theorems on sets

6 M3: Sets, Relations & Functions T1-Chapter 7


Relations
Representing relations
Equivalence relations & partial order relations

7 M3: Sets, Relations & Functions T1-Chapter 2


Functions ,types of functions
Operations on functions
Properties with examples

8 Review

9 M4: Combinatorics, Recursion, Recurrence T1-Chapter 5


relation
Combinatorics

10 M4: Combinatorics, Recursion, Recurrence T1-Chapter 6


relation
Recurrence relations - Introduction
Types of Recurrence relations

11 M4: Combinatorics, Recursion, Recurrence T1-Chapter 6


relation
Solution of recurrence relations
Generating functions

12 M5: Graph Theory T1-Chapter 8.1 & 8.2


Introduction to Graph Theory
Representation of Graphs

13 M5: Graph Theory T1-Chapter 8.3 ,8.4 & 8.5


Graph Isomorphism
Connectivity
Euler and Hamilton Paths

14 M5: Graph Theory T1-Chapter 9.1 to 9.5


Trees
Spanning tress
Minimum spanning trees

15 M6: Introduction to Cryptography T1-Chapter 3


Primes, GCD
Integers and Algorithms
RSA Cryptosystem

16 Review

Evaluation Scheme
Legend: EC = Evaluation Component

No Name Type Duration Weight Day, Date, Session, Time


EC-1 Quiz-I/ Assignment-I - 5% To be announced
Quiz-II 5% To be announced
Quiz II / Assignment 5% To be announced
EC-2 Mid-Semester Test Closed 2 hours 35% To be announced
Book
EC-3 Comprehensive Exam Open 3 hours 50% To be announced
Book
Note - Evaluation components can be tailored depending on the proposed model.

Important Information
Syllabus for Mid-Semester Test (Closed Book): Topics in Weeks 1-7
Syllabus for Comprehensive Exam (Open Book): All topics given in plan of study

Evaluation Guidelines:
1. EC-1 consists of either two Assignments or three Quizzes. Announcements regarding the same will
be made in a timely manner.
2. For Closed Book tests: No books or reference material of any kind will be permitted.
Laptops/Mobiles of any kind are not allowed. Exchange of any material is not allowed.
3. For Open Book exams: Use of prescribed and reference text books, in original (not photocopies) is
permitted. Class notes/slides as reference material in filed or bound form is permitted. However,
loose sheets of paper will not be allowed. Use of calculators is permitted in all exams.
Laptops/Mobiles of any kind are not allowed. Exchange of any material is not allowed.
4. If a student is unable to appear for the Regular Test/Exam due to genuine exigencies, the student
should follow the procedure to apply for the Make-Up Test/Exam. The genuineness of the reason for
absence in the Regular Exam shall be assessed prior to giving permission to appear for the Make-up
Exam. Make-Up Test/Exam will be conducted only at selected exam centres on the dates to be
announced later.
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 lectures, and take all the prescribed evaluation components such as
Assignment/Quiz, Mid-Semester Test and Comprehensive Exam according to the evaluation scheme
provided in the handout.

You might also like