Subject: Discrete Mathematics

Course: MCA 103

Primary Reference Book:

Discrete Mathematical Structures by Bernard Kolman, Robert Busby, and Sharon Ross (third edition)

• • 16 July 2010, Friday.

Chapter 1: Fundamentals

Introduction; The idea of discreteness; How modeling reality into computational domain involves discretizing certain measurable parameter; Examples;

Definition of set, subset; Basic set notations; Venn Diagrams; Definition of cardinality; Few representative examples from 'Exercise Set 1.1" covered;

(Sec 1.2) Operations on Set: union intersection, complement, symmetric difference; Few examples covered in class from 'Exercise Set 1.2';

Definition of characteristic function; it's relation and importance towards usefulness for storing sets as computable entities; Home exercise: Theorem 1 (c) (page 17);

• • 17 July 2010, Saturday

Chapter 4: Relations and Digraphs

Definition of a 'Relation'; Examples; Relation and ordered pair; Almost all examples (Ex. 1 to Ex. 8 covered in class); Matrix representation of a Relation; A Digraph; Abstract and practical examples illustrating the application of ordered pair, relation, digraph and eventually connecting it to computational use.

• • 23 July 2010,Friday

This lecture was not conducted due to overlap with placement activities.

• • 24 July 2010,Saturday

This lecture was not conducted due to overlap with placement activities.

ASSIGNMENTS (Discrete Mathematics):

MISCELLANEOUS:

The "Choosing between the gateway of Heaven and Hell: A logical puzzle" that I had mentioned in the class on 16 July 2010 is elaborated on the "Stuff for Students" page.

<< Ganesh Bagler's Home-Page << >> Ganesh's Teaching Page >>