SINDHUDURG SHIKSHAN PRASARAK MANDALS COLLEGE OF ENGINEERING

DEPARTMENT OF COMPUTER ENGINEERING COURSE PLAN

Discrete Structure and Graph Theory Academic Year: 2012-2013 Section Day Hour Mon Tue Wed Thu s Fri Sat 2(A2) 2(A4) 2(A3) 1 2(A1) 1 1 09.00-11.00(T) 02.00-04.00(T) 11.15-01.15(T) 03.00-04.00(L) 09.00-11.00(T) 12.15-01.15(L) 12.15-01.15(L) Designation Lecturer Tel No 9421236438 Email Id [email protected] A Timing Hour B Timing

5. Faculty Details: 6. Required Books & References:

Sec Name Of Faculty A Mr Naik S. P. B A. Text Books:

1. Bernard Kolman, Robert C. Busby, Sharon Cutler Ross, Nadeem-ur-Rehman, Discrete Mathematical Structures Pearson Education. 2. D. S. Malik and M. K. Sen , Discrete Mathematical Structures
B Reference Books:

1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw-Hill. 2. Garry Haggard, John Schlipf, Sue Whitesides. Discrete Mathematics For Computer Science, Thomson.

C. Online References: 1. http://www.hlt.utdallas.edu 2. .http://www.mgt.ncu.edu.tw 7. Perquisite: 8. Objectives: Nil This subject introduces concepts like; 1. Set Theory. 2. Logical operation and Example; Mathematical Induction. 3. Relation, types of Relation and Lattices. 4. different types of function, Pigeon Hole Principle. 5. Tree and its types 6. Algebraic Structures. 7. Generating Functions and Recurrence Relation. A. Unit Test 1: 25 Marks Unit Test 2: 25 Marks Preliminary Exam :50 Marks B. Competitive Activities: Objective Test Quiz Competition 10. Test Schedule: Sr No 01 02 03 Date 07/08/12 11/09/12 16/10/12 Test UNIT TEST-1 UNIT TEST-1 PRELIM Topics Set Theory,Mathamatical Logic Function,Tree ,Relation Algebric Structure ,Graph Duration 60 min 60 min 90min

9. Assessment Details:

11. Outcomes:

A. Program OutcomesPLO 1. Graduate will demonstrate an ability to apply knowledge of mathematics, science and basic engineering. PLO 2. Graduate will demonstrate an ability to design and conduct experiments, analyze and interpret data. PLO 3. Graduate will demonstrate an ability to design and implement system (hardware/software) or process as per the needs and specifications. PLO 4. Graduate will able to communicate effectively in both verbal and written form. PLO 5. Graduate will have an ability to understand professional, social and ethical responsibility. PLO 6. Graduate will develop confidence for higher education and lifelong learning. PLO 7. Graduate will demonstrate an ability to apply mathematical foundations, algorithmic principles, and computer science and engineering theory in the modeling and design of computer-based systems. PLO 8. Graduate will have an ability to work in multidisciplinary areas.

.B. Course OutcomeStudents who have successfully completed this course will have full understanding of the following conceptsCLO 1. Graduates will have the knowledge of set operations, laws of set Theory, Principle of Inclusion-Exclusion, Laws of logic, CLO 2. Graduates will classify Relations, Functions, check Lattice. CLO 3. Graduates will know applications of Graph and Tree. CLO 4. Graduates will have the detail knowledge of Algebraic Structures. CLO 5. Graduates will have the knowledge of Recurrence Relation. 1. Set Theory TLO1:Learn concepts set, Venn Diagram, Set operation TLO2:Learn principle of Inclusion-Exclusion 2. Logic TLO1:Learning concept of Logic TLO2: Learning Principle of mathematical induction. 3. Relation, Diagraph and Lattices TLO1: Learning concept like Relation, Diagraph, and Lattice. Hasse Diagram TLO2: Learning Wars halls Algo. 4. Function And Pigeonhole Principle TLO1: Learning Function, its type, Composition. TLO2: Learning Pigeon-hole Principle. 5. Graphs TLO1: learning Graphs, Euler, Hamiltonian Path, TLO2:Learn Isomorphism of Graph. TLO3:Learning Planar Graph, Graph Coloring, TSP Problem. 6.Trees: Understanding concept of trees TLO1: Learning concepts of Trees Student should be able to create Set , draw venn diagram and perform operation on it. Student should be able apply Inclusion Exclusion Principle to solve set related problem Understanding logical operation, laws of logic. Applying principle of Mathematical induction to prove Statement. Understanding concept and able to Draw Diagraph, Hasse Diagram. Understanding Algo, and find transitive closure of Relation using Algo. Understanding concept of function, Composition and able to identify function . Applying Pigeon-hole Principle on given problem instance.

12.Topic Name with objective & outcomes

Understanding concepts of Graph and able to find Euler or Hamiltonian path for given Graph Student should be able to check Isomorphism of given 2 Graph Student should be able to identify Planar Graph and solve Graph Coloring, TSP Problem

7. Algebraic Structures Understanding and identifying different type of Algebraic Structures TLO1: Describe different Algebraic Structures

8. Generating Function And Recurrence Relation TlO1: Learning Generating Function and Recurrence Relation 13. Detailed Session Plan:
Ses sion No

Understanding concept and finding Generating Function and Recurrence Relation

Topic to be covered Introduction to DSGT Set Theory

Ref TB-2

Teaching Method BB

Testing Methhods Self -test questions

Learning Level

L1,L2

Sets , Venn diagrams,

Operations on sets
3 4

Laws of set theory, Power set and products Partitions of sets and Examples

TB-1,2 TB-1, REF-1

BB BB

5 6

The Principle of Inclusion-Exclusion

L3 TB-1,2 BB Self -test questions L2,L1

Logic Propositions and logical operations, Truth tables

7 8 9

TB-2 TB-1 TB-1,2

BB BB BB

Self -test questions Self -test questions Self -test questions

L1 L1 L1,L2

10 11

Predicates and Quantifiers

TB-1,2 TB-1,

BB BB

Group Discussion Self -test questions

L2,L3 L1,L2

Mathematical Induction
12

REF-1,2 TB-1,2 REF-1 BB Self -test questions L1,L2

Relations ,Diagraph And Lattices Relations and its types

13 14

Example on Relation digraphs

TB-2 TB-1

BB BB

Self -test questions Self -test questions

L1,L2 L1,L2

15

TB-1

BB

Self -test questions

L1,L2,L3

Properties and types of binary relations;

Manipulation of relations
17

TB-1, REF-1,2 TB-1, REF-1,2 TB-1,2

BB

Self -test questions

L2,L3

BB

Self -test questions

L1,L2,L3

closures, Warshall's algorithm

BB

Self -test questions

L1,L2

Equivalence and Partial ordered relations;

Posets Hasse diagram Lattice.

TB-2 TB-1,2 TB-1, REF-1,2

22

Functions And Pigeon-hole principle.

23

Composition

TB-1, REF-1

BB

Self -test questions

L1,L2

24

TB-1,2

BB

Self -test questions

L2,L3

identity and inverse;

Pigeon-hole principle.
26

Graphs Definition, Terminology; Paths and circuits : Eulerian, Hamiltonian;

BB

Self -test questions

L1,L2

27

TB-1,2

BB

Self -test questions

L1,L2,L3

28

Planer graphs, Graph coloring

TB-1,2 REF-1,2 TB-1, REF-1,2 TB-1,2

BB

Self -test questions

L1,L2,L3

BB

Self -test questions

L2,L3

Isomorphism Of Graphs
30

BB

Self -test questions

L2,L3

Traveling salesperson problem

Trees Trees, Rooted tree and path length in rooted tree

TB-1,2 REF-1,2

BB

Self -test questions

L1,L2

32

TB-1

BB

Self -test questions

L1,L3,

33

Isomorphism of trees,Weighted Trees and Prefix Codes

TB-1, REF-1,2

BB

Self -test questions

L1,L2

Algebraic structures Algebraic structures with one binary operation - semigroups

TB-1,2 REF-1

BB

Self -test questions

L1,L2

monoids and groups.

TB-1,2 REF-1

BB

Self -test questions

L1,L2,L3

36 37

Commutative Group
Isomorphism, homomorphism, automorphism;

TB-1,2 TB-1,2 REF-1 TB-1,2 REF-1

BB BB

Self -test questions Self -test questions

L1,L2 L1,L2

38

BB

Self -test questions

L1,L2,L3

Cyclic Groups and coding

Normal subgroup codes , Ring Homomorphisms, Isomorphisms Algebraic structures with two binary operations - rings, integral domains and fields.

TB-1,2

BB

Self -test questions

L1,L2,L3

40

TB-1,2 REF-1

BB

Self -test questions

L1,L2,L3

41

Generating Function And Recurrence Relation Series and Sequences;

TB1, WEB 1,2 TB1, WEB 1,2 TB1, WEB 1,2 TB1, WEB 1,2 TB 1, WEB 1,2

BB

Self -test questions

L1,L3

42 43

Generating functions; Recurrence relations;

BB BB

Self -test questions Self -test questions

L1,L2,L3 L1,L2,L3

44 45

Example
Applications: Solving Differential equations, Fibonacci

BB BB

Self -test questions Self -test questions

L1,L2,L3 L1,L2,L3

14. Activity List (Min 02 activities should be carried out) 15. Activity Schedule

1. Internal Assessment Test 2. Viva 3. Tutorial Classes

Activity

Announcement Date

Submission Date

Evaluation Date

HOD Remark

Tutorial no.1 Tutorial no.2 Tutorial no.3 Tutorial no.4 Tutorial no.5 Tutorial no.6 Tutorial no.7

17/7 17/7 31/7 31/7 14/8 14/8 21/8 21/8 4/9 4/9

19/7 2/8 16/8 23/8 6/9 21/9 4/10

20/7 27/7 17/8 24/8 7/9 28/9 5/10

31/7 14/8 21/8 4/9 11/9 25/9 1/10

31/7 14/8 21/8 4/9 11/9 25/9 1/10

2/8 16/8 23/8 6/9 21/9 4/10 11/10

27/7 17/8 24/8 7/9 28/9 5/10

31/7 31/7 2/8 14/8 14/8 16/8 21/8 21/8 23/8 4/9 4/9 6/9

27/7 17/8 24/8 7/9 28/9 5/10 11/10

11/9 11/9 21/9 25/9 25/9 4/10

11/9 11/9 25/9 25/9

11/10 1/10 1/10 11/10

16. Course Articulation Matrix

Course Outcomes CLO-1 CLO-2 CL0-3 CLO-4 CLO-5 L: Low

Activities that meet a the PLO 1 outcomes 1,3 M 1,3 M 1,2,3 M 1,2,3 M 1,2,3 M M: Medium H: High

b PLO 2

Program Outcomes c d PLO 3 PLO 4

e PLO 5 M M M M M

f PLO 6

g PLO 7 L L L L L

F PLO 8 M M M M M

17. Checklist

Sr No 01 02 03

Items Assignment Quiz Questions Test Papers

Check box

HOD Remark

Principal Remark

04 05 06 07 08 09 10

Syllabus Copy PPT Lesson Plan Attendance Sheet Academic Calendar Competitive Exam Que Papers Tutorials

Faculty Signature with Date