Scribd
Upload
109 views2 pages

W.E.F.2010 Jawaharlal Nehru Technological University, Kakinada II B.Tech. CSE. I.Sem & II Sem

The document outlines the course content for the mathematical foundations of computer science engineering course. It covers topics such as propositional calculus, predicate logic, number theory, set theory, graph theory, algebraic structures including groups and rings, combinatorics, and recurrence relations. The course aims to introduce foundational mathematical concepts and proofs that are essential for understanding computer science.

Uploaded by

Srikanth Malladi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
109 views2 pages

W.E.F.2010 Jawaharlal Nehru Technological University, Kakinada II B.Tech. CSE. I.Sem & II Sem

The document outlines the course content for the mathematical foundations of computer science engineering course. It covers topics such as propositional calculus, predicate logic, number theory, set theory, graph theory, algebraic structures including groups and rings, combinatorics, and recurrence relations. The course aims to introduce foundational mathematical concepts and proofs that are essential for understanding computer science.

Uploaded by

Srikanth Malladi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

w.e.f.

2010

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, KAKINADA II B.Tech. CSE. I.Se ! II Se .

2.1." #ATHE#ATICAL $OUNDATIONS $OR CO#%UTER SCIENCE ! ENGINEERING UNIT I&#'(he '()c'* L+,)c : Propositional Calculus: Statements and Notations, Connectives, Truth Tables, Tautologies, Equivalence of Formulas, Dualit la!, Tautological "mplications, Normal Forms, Theor of "nference for Statement Calculus, C+-.).(e-c/ +f %0e ).e., I-1)0ec( #e(h+1 +f %0++f. %0e1)c'(e c'*c2*2.& Predicative #ogic, Statement Functions, $ariables and %uantifiers, Free & 'ound $ariables, "nference theor for predicate calculus( UNIT II &N2 3e0 The+0/ ! I-12c()+-& Properties of integers, Division Theorem, The )reatest Common Divisor, Euclidean *lgorithm, #east Common +ultiple, Testing for Prime Numbers, The Fundamental Theorem of *rithmetic, +odular *rithmetic , Fermat-s Theorem and Euler .s Theorem/ #'(he '()c'* I-12c()+-& %0)-c)4*e +f #'(he '()c'* I-12c()+-,e5e0c).e. UNIT III&Se( The+0/& "ntroduction, 0perations on 'inar Sets, Principle of "nclusion and E1clusion 2elations: Properties of 'inar 2elations, 2elation +atri1 and Digraph, 0perations on 2elations, Partition and Covering, Transitive Closure, Equivalence, Compatibilit and Partial 0rdering 2elations, 3asse Diagrams( $2-c()+-.: 'i4ective Functions, Composition of Functions, "nverse Functions, Permutation Functions, 2ecursive Functions UNIT IV&G0'4h The+0/& 'asic Concepts of )raphs, Sub graphs, +atri1 2epresentation of )raphs: *d4acenc +atrices, "ncidence +atrices, "somorphic )raphs, Paths and Circuits, Eulerian and 3amiltonian )raphs, +ultigraphs, ,Problems and Theorems !ithout proofs/ UNIT V&G0'4h The+0/ II& Planar )raphs, Euler-s Formula, )raph Colouring and Covering, Chromatic Number,, Problems and Theorems !ithout proofs/ Trees, Directed trees, 'inar Trees, Decision Trees, Spanning Trees: Properties, *lgorithms for Spanning trees and +inimum Spanning Tree( UNIT VI& A*,e30')c S(02c(20e.& L'(()ce& Properties, #attices as *lgebraic S stems, *lgebraic S stems !ith one 'inar 0peration, Properties of 'inar operations, Semi groups and +onoids: 3omomorphism of Semi groups and +onoids, )roups: *belian )roup, Cosets, Subgroups , Definitions and E1amples of all Structures/ *lgebraic S stems !ith t!o 'inar 0perations: 2ings

UNIT VII& C+ 3)-'(+0)c.& 'asic of Counting, Permutations, Derangements, Permutations !ith 2epetition of 0b4ects, Circular Permutations, 2estricted Permutations, Combinations, 2estricted Combinations, Pigeonhole Principle and its *pplication( 'inomial Theorem, 'inomial and +ultinomial Coefficients, )enerating Functions of Permutations and Combinations, The Principles of "nclusion 5 E1clusion( UNIT VIII& Rec200e-ce Re*'()+-& )enerating Function of Sequences, Partial Fractions, Calculating Coefficient of )enerating Functions 2ecurrence 2elations, Formulation as 2ecurrence 2elations, Solving linear homogeneous recurrence 2elations b substitution, generating functions and The +ethod of Characteristic 2oots( Solving "nhomogeneous 2ecurrence 2elations TE6T BOOKS & 6( Discrete +athematical Structures !ith *pplications to Computer Science, Trembla , +anohar, T+3 7( Discrete +athematics for Computer Scientists & +athematicians, 78e, +ott, 9andel, 'a:er, P3" RE$ERENCE BOOKS& 6( Discrete +athematics, S(Santha, Cengage 7( Discrete +athematics !ith *pplications, Thomas 9osh , Elsevier ;( Discrete +athematics,78e, <9 Sharma ,+acmillan

You might also like