Mfcs Course Plan

3
KESHAV MEMORIAL INSTITUTE OF TECHNOLOGY COURSE DELIVERY PLAN DEPARTMENT OF CSE NAME OF THE LECTURER: A.SHARATH KUMAR DESIGNATION: Asst.Prof SUBJECT: MFCS BRANCH: CSE YEAR: II SEM: I (2010-11) S.No . Topics No. of periods 1 UNIT-1: Statements and notations 1 2 Connectives 1 3 Well formed formulas 1 4 Truth tables 2 5 Tautology 2 6 Equivalence implication 2 7 Normal forms 3 8 UNIT-2: Predicative logic 1 9 Free variables 1 10 Bound variables 2 11 Rules of inference 2 12 Consistency 1 13 Proof of contradiction 1 14 Automatic theorem proving 2 15 UNIT-3: Properties of binary relations 2 16 Equivalence 1 17 Compatibility 1 18 Partial ordering relations 1 19 Hasse diagram 1 20 Inverse function 1 21 Comports of functions 1 22 Recursive functions 1 23 Lattice and its properties 1 24 Pigeon hole principles and its application 1 25 UNIT-4: Algebraic systems 2 26 Examples 1 27 General properties 1

Transcript of Mfcs Course Plan

Page 1: Mfcs Course Plan

KESHAV MEMORIAL INSTITUTE OF TECHNOLOGY

COURSE DELIVERY PLAN

DEPARTMENT OF CSE

NAME OF THE LECTURER: A.SHARATH KUMAR DESIGNATION: Asst.Prof

SUBJECT: MFCS BRANCH: CSE YEAR: II SEM: I (2010-11)

S.No. Topics No. of

periods

1 UNIT-1:Statements and notations 1

2 Connectives 1

3 Well formed formulas 1

4 Truth tables 2

5 Tautology 2

6 Equivalence implication 2

7 Normal forms 3

8 UNIT-2:Predicative logic 1

9 Free variables 1

10 Bound variables 2

11 Rules of inference 2

12 Consistency 1

13 Proof of contradiction 1

14 Automatic theorem proving 2

15 UNIT-3:Properties of binary relations 2

16 Equivalence 1

17 Compatibility 1

18 Partial ordering relations 1

19 Hasse diagram 1

20 Inverse function 1

21 Comports of functions 1

22 Recursive functions 1

23 Lattice and its properties 1

24 Pigeon hole principles and its application 1

25 UNIT-4:Algebraic systems 2

26 Examples 1

27 General properties 1

28 Semi groups 1

S.No. Topics No. of

periods

Page 2: Mfcs Course Plan

29 Monads 1

30 Homomorphism 1

31 Isomorphism 2

32 UNIT-5:Basics of counting 1

33 Combinations - general 1

34 Permutations - general 1

35 Combinations - With repetitions 1

36 Permutations - With repetitions 1

37 Combinations - Constrained repetitions 1

38 Permuations - Constrained repetitions 1

39 Binomial coefficients 1

40 Binomial theorems 1

41 Multinomial theorems 1

42 Principles of inclusion 1

43 Principles of exclusion 1

44 UNIT-6:Generating functions 1

45 Function of sequences calculating coefficient of generating function 1

46 Recurrence relations 1

47 Solving recurrence relation by substitution 1

48 Generating funds 1

49 Characteristics roots solution of inhomogeneous recurrence relation 4

50 UNIT-7:Representation of Graph 1

51 Depth First Search 2

52 Breadth First Search 2

53 Spanning trees 1

54 Planar graphs 2

55 UNIT-8:Graph theory and applications, basic concepts isomorphism 4

56 sub graphs 1

57 Multi graphs 1

58 Euler circuits, Hamiltonian graphs 2

59 Chromatic Numbers 1