Mathematical Foundations of Computer Science detailed syllabus for Master of Computer Applications(MCA), R22 regulation has been taken from the JNTUH official website and presented for the students affiliated to JNTUH course structure. For Course Code, Subject Names, Theory Lectures, Tutorial, Practical/Drawing, Credits, and other information do visit full semester subjects post given below. The syllabus PDF files can also be downloaded from the universities official website.
For all other MCA 1st Year 1st Sem syllabus for R22 regulation JNTUH, do visit MCA 1st Year 1st Sem syllabus for R22 regulation JNTUH subjects. The detailed syllabus for mathematical foundations of computer science is as follows.
Prerequisites:
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.
Course Objectives:
To learn
- 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:
After learning the contents of this paper the student must be able to
- Ability to understand and construct precise mathematical proofs.
- Ability to use logic and set theory to formulate precise statements.
- Ability to analyze and solve counting problems on finite and discrete structures.
- Ability to describe and manipulate sequences.
- Ability to apply graph theory in solving computing problems.
Unit -I
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Unit -II
Basic Structures, Sets, Functions, Sequences, Sums, Matrices and Relations: Sets, Functions, Sequences and 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
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
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
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. Trees: Introduction to Trees, Applications of Trees, Tree Traversal, Spanning Trees, Minimum Spanning Trees.
Text Books:
- Discrete Mathematical Structures with Applications to Computer Science: J.P. Tremblay, R. Manohar, McGraw-Hill, 1st ed.
- Discrete Mathematics for Computer Scientists and Mathematicians: Joe l. Mott, Abraham Kandel, Teodore P. Baker, Prentis Hall of India, 2nd ed.
Reference Books:
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
For detail syllabus of all other subjects of Master of Computer Applications 1st Year, visit MCA 1st Year syllabus subjects.
For all MCA results, visit JNTUH MCA all years, and semester results from direct links.