Scribd
Upload
160 views1 page

Syllabus MFCS

Uploaded by

outofworld1100
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
160 views1 page

Syllabus MFCS

Uploaded by

outofworld1100
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

R21 Regulations

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY ANANTAPUR


(Established by Govt. of A.P., ACT No.30 of 2008)
ANANTHAPURAMU 515 002 (A.P) INDIA

MASTER OF COMPUTER APPLICATIONS


Course Code MATHEMATICAL FOUNDATIONS OF COMPUTER L T P C
21F00101 SCIENCE 4 0 0 4
Semester I

Course Objectives:
Introduces the elementary discrete mathematics for computer science and engineering.
Topics include formal logic notation, methods of proof, induction, sets, relations, graph theory,
permutations and combinations, counting principles; recurrence relations and generating functions
Course Outcomes (CO): Student will be able to
Demonstrate the ability to understand and construct precise mathematical proofs
Demonstrate the ability to use logic and set theory to formulate precise statements
Acquire the knowledge to analyse and solve counting problems on finite and discrete structures
Demonstrate the ability to describe and manipulate sequences
Demonstrate the ability to apply graph theory in solving computing problems
UNIT I Lecture Hrs:
The Foundations Logic and Proofs: Propositional Logic, Applications of Propositional Logic,
Propositional Equivalence, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference,
Introduction to Proofs, Proof Methods and Strategy.
UNIT II Lecture Hrs:
Basic Structures, Sets, Functions, Sequences, Sums, Matrices and Relations: Sets, Functions, Sequences &
Summations, Cardinality of Sets and Matrices Relations, Relations and Their Properties, n-ary Relations
and Their Applications, Representing Relations, Closures of Relations, Equivalence Relations, Partial
Orderings.
UNIT - III Lecture Hrs:
Algorithms, Induction and Recursion: Algorithms, The Growth of Functions, Complexity of Algorithms.
Induction and Recursion: Mathematical Induction, Strong Induction and Well-Ordering, Recursive
Definitions and Structural Induction, Recursive Algorithms, Program Correctness
UNIT IV Lecture Hrs:
Discrete Probability and Advanced Counting Techniques: An Introduction to Discrete Probability,

Advanced Counting Techniques: Recurrence Relations, Solving Linear Recurrence Relations, Divide-and-
Conquer Algorithms and Recurrence Relations, Generating Functions, Inclusion-Exclusion, Applications
of Inclusion-Exclusion.
UNIT V
Graphs: Graphs and Graph Models, Graph Terminology and Special Types of Graphs, Representing
Graphs and Graph Isomorphism, Connectivity, Euler and Hamilton Paths, Shortest-Path Problems, Planar
Graphs, Graph Coloring.
TEXTBOOKS
1. Discrete Mathematics and Its Applications with Combinatorics and Graph Theory- Kenneth H Rosen,
7thEdition, TMH.
REFERENCES
1. Discrete Mathematical Structures with Applications to Computer Science-J.P. Tremblay and R.
Manohar, TMH,
2. Discrete Mathematics for Computer Scientists & Mathematicians: Joe L. Mott, Abraham Kandel,
Teodore P. Baker, 2nd ed., Pearson Education.
3. Discrete Mathematics- Richard Johnsonbaugh, 7th ed., Pearson Education.
4. Discrete Mathematics with Graph Theory- Edgar G. Goodaire, Michael M. Parmenter.
5. Discrete and Combinatorial Mathematics - an applied introduction: Ralph.P. Grimald, 5th edition,
Pearson Education.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy