Scribd
Upload
48 views

Discrete Mathematical Structures With Application To Computer Science

1. The document outlines the objectives, units, and topics covered in a 5 credit semester course on Mathematical Foundations of Computer Science. 2. The course covers mathematical logic, relations and ordering, functions, algebraic structures, graph theory, vector spaces, and linear algebra topics like matrices and eigenvectors. 3. Key concepts include logical statements and inference rules, binary relations and graphs, composition of functions, algebraic systems, representation of graphs and trees, vector spaces, and linear transformations.

Uploaded by

Abinaya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
48 views

Discrete Mathematical Structures With Application To Computer Science

1. The document outlines the objectives, units, and topics covered in a 5 credit semester course on Mathematical Foundations of Computer Science. 2. The course covers mathematical logic, relations and ordering, functions, algebraic structures, graph theory, vector spaces, and linear algebra topics like matrices and eigenvectors. 3. Key concepts include logical statements and inference rules, binary relations and graphs, composition of functions, algebraic systems, representation of graphs and trees, vector spaces, and linear transformations.

Uploaded by

Abinaya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Hours of

No. pf
Semester Subject code Title of the course Teaching Credits
Week
Core MATHEMATICAL
20P1CA3 FOUNDATIONS OF COMPUTER 5
SCIENCE
Objectives:
To know about Mathematical techniques required for computer science.

Unit I
Mathematical logic: statements and notation - connectives n o r m a l forms t h e
theory of inference for the statements calculus t h e predicate calculus inference theory
of the predicate calculus
Unit 1I
Relations and ordering: relations properties of binary relations in a set
relation matrix and the graph of a relation partition and cOvering of a set
equivalence relations compatibility relations composition of binary relationspartial
ordering partially ordered set; representation and associated terminology
Functions: Definition and introduction composition of function -inverse functions
binary and n-array operations.

Unit 11I
Algebraic structures: Algebraic systems: examples and genera properties
definition and examples some simple algebraic systems and general properties
Semi groups and monoids: definition and examples homomorphism of semi groups
submonoids Grammars and languages: discussion of
and monoids sub-groups and
Grammars - formal definition of a language.

Unit IV
Graph of graph
theory: Basic concepts theory: Basic definitions paths,
representation of graphs- trees storage
reachability and connectedness of matrix Trees: their representation and operations.
representation and manipulation graphs:

Unit Tinear
Vector Spaces: Introduction Definitions and examplessubspaces
of Matrices: Simultaneous
transformations span
linear
of a set -

independence TheoryTheorem values and


characteristic equation and Cayley Hamilton Eigen
linear equations-
Eigen vectors.

Text Book: science, J.B.Tremblay


structuress with application to computer
1. Discrete mathematical
international edition, 2004.
and R.Manohar, MCGraw-hill
Unit - II
Chapter.1 (Sec: 1.1 to 1.6)
Chapter.2 (Sec: 2.3,
Sec: 2.4.1 to 2.4.4)
Unit-1 to 3.3.2)
Unit - III Chapter.3 (Sec: 3.1
Unit - IV
Chapter.5 (Sec: 5.1 to 5.2.1)
Scitech publications, 2014.
2. Modern Algebra, Arumugam.s, Isaac.A.T, Chapter.7 (Sec: 7.6 to 7.8)
Unit - V :Chapter.5 (Sec: 5.0 to 5.5),

General Reference:

You might also like