Scribd
Upload
382 views

Syllabus PDF

This document describes a course on discrete computational structures. The course introduces mathematical concepts and notations that are essential for computing, including set theory, functions, relations, algebraic structures, propositional and predicate logic, and proof techniques. It is a 3 credit hour course with 3 lecture hours and 1 tutorial hour each week. The course objectives are to train students in mathematical reasoning, analytical thinking, and problem solving skills relevant to computing. The syllabus and course plan cover topics like sets, relations, functions, algebraic structures, lattices, Boolean algebra, propositional logic, predicate logic, and proof methods over 6 modules to be assessed through internal and end semester exams.

Uploaded by

Bibin Raj B S
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
382 views

Syllabus PDF

This document describes a course on discrete computational structures. The course introduces mathematical concepts and notations that are essential for computing, including set theory, functions, relations, algebraic structures, propositional and predicate logic, and proof techniques. It is a 3 credit hour course with 3 lecture hours and 1 tutorial hour each week. The course objectives are to train students in mathematical reasoning, analytical thinking, and problem solving skills relevant to computing. The syllabus and course plan cover topics like sets, relations, functions, algebraic structures, lattices, Boolean algebra, propositional logic, predicate logic, and proof methods over 6 modules to be assessed through internal and end semester exams.

Uploaded by

Bibin Raj B S
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/ 3

Course code Course Name L-T-P Credits Year of

Introduction
CS201 DISCRETE COMPUTATIONAL 3-1-0-4 2016
STRUCTURES
Pre-requisite: NIL
Course Objectives
1. To introduce mathematical notations and concepts in discrete mathematics that is
essential for computing.
2. To train on mathematical reasoning and proof strategies.
3. To cultivate analytical thinking and creative problem solving skills.

Syllabus
Review of Set theory, Countable and uncountable Sets, Review of Permutations and
combinations, Pigeon Hole Principle, Recurrence Relations and Solutions, Algebraic systems
(semigroups, monoids, groups, rings, fields), Posets and Lattices, Prepositional and Predicate
Calculus, Proof Techniques.

Expected Outcome:
Students will be able to
1. identify and apply operations on discrete structures such as sets, relations and functions
in different areas of computing.
2. verify the validity of an argument using propositional and predicate logic.
3. construct proofs using direct proof, proof by contraposition, proof by contradiction and
proof by cases, and by mathematical induction.
4. solve problems using algebraic structures.
5. solve problems using counting techniques and combinatorics.
6. apply recurrence relations to solve problems in different domains.

Text Books
1. Trembly J.P and Manohar R, Discrete Mathematical Structures with Applications to
Computer Science, Tata McGrawHill Pub.Co.Ltd, New Delhi, 2003.
2. Ralph. P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied
Introduction, 4/e, Pearson Education Asia, Delhi, 2002.
References:
1. Liu C. L., Elements of Discrete Mathematics, 2/e, McGrawHill Int. editions, 1988.
2. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, Discrete Mathematical
Structures, Pearson Education Pvt Ltd., New Delhi, 2003
3. Kenneth H.Rosen, Discrete Mathematics and its Applications, 5/e, Tata McGraw Hill
Pub. Co. Ltd., New Delhi, 2003.
4. Richard Johnsonbaugh, Discrete Mathematics, 5/e, Pearson Education Asia, New
Delhi, 2002.
5. Joe L Mott, Abraham Kandel, Theodore P Baker, Discrete Mathematics for Computer
Scientists and Mathematicians, 2/e, Prentice-Hall India, 2009.
Course Plan
Hou End Sem
Module Contents rs Exam
(54) Marks
Review of elementary set theory :
Algebra of sets Ordered pairs and Cartesian products 3
Countable and Uncountable sets
Relations :-
Relations on sets Types of relations and their properties 6
Relational matrix and the graph of a relation Partitions
I 15 %
Equivalence relations - Partial ordering- Posets Hasse
diagrams - Meet and Join Infimum and Supremum
Functions :-
Injective, Surjective and Bijective functions - Inverse of a 1
function- Composition

Review of Permutations and combinations, Principle of 3


inclusion exclusion, Pigeon Hole Principle,
Recurrence Relations:
Introduction- Linear recurrence relations with constant 4
coefficients Homogeneous solutions Particular solutions
II 15 %
Total solutions
Algebraic systems:-
Semigroups and monoids - Homomorphism, Subsemigroups 2
and submonoids

FIRST INTERNAL EXAM


Algebraic systems (contd):-
Groups, definition and elementary properties, subgroups, 6
Homomorphism and Isomorphism, Generators - Cyclic Groups,
III Cosets and Lagranges Theorem 15 %
Algebraic systems with two binary operations- rings, fields-sub 2
rings, ring homomorphism

Lattices and Boolean algebra :-


Lattices Sublattices Complete lattices Bounded Lattices - 7
Complemented Lattices Distributive Lattices Lattice
IV 15 %
Homomorphisms.
Boolean algebra sub algebra, direct product and
homomorphisms 3
SECOND INTERNAL EXAM
Propositional Logic:-
Propositions Logical connectives Truth tables 2
V 20 %
Tautologies and contradictions Contra positive Logical 3
equivalences and implications

Rules of inference: Validity of arguments. 3


Predicate Logic:-
Predicates Variables Free and bound variables Universal 3
and Existential Quantifiers Universe of discourse.
Logical equivalences and implications for quantified statements
Theory of inference : Validity of arguments.
VI 20 %
3
Proof techniques:
Mathematical induction and its variants Proof by Contradiction
Proof by Counter Example Proof by Contra positive.
3
END SEMESTER EXAM
Question Paper Pattern:

1. There will be five parts in the question paper A, B, C, D, E


2. Part A
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module I and II; All
four questions have to be answered.
3. Part B
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module I and II; Two
questions have to be answered. Each question can have a maximum of three
subparts
4. Part C
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module III and IV; All
four questions have to be answered.
5. Part D
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module III and IV; Two
questions have to be answered. Each question can have a maximum of three
subparts
6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and VI; four
questions have to be answered.
c. A question can have a maximum of three sub-parts.

7. There should be at least 60% analytical/numerical questions.

You might also like