Scribd
Upload
4 views2 pages

Mathematics for Computer Science

The document outlines the syllabus for the Mathematics for Computer Science course in the MCA program, taught by Dr. Puneeth V. It includes five units covering topics such as discrete relations, propositional logic, algebraic structures, combinatorics, and graph theory. The grading policy consists of continuous assessment (30%) and end semester examination (70%), with minimum score requirements for formative and summative assessments to pass the course.

Uploaded by

apurva3296
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
4 views2 pages

Mathematics for Computer Science

The document outlines the syllabus for the Mathematics for Computer Science course in the MCA program, taught by Dr. Puneeth V. It includes five units covering topics such as discrete relations, propositional logic, algebraic structures, combinatorics, and graph theory. The grading policy consists of continuous assessment (30%) and end semester examination (70%), with minimum score requirements for formative and summative assessments to pass the course.

Uploaded by

apurva3296
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

Course: Mathematics for Computer Science

Program: MCA
Professor: Dr. Puneeth V

Syllabus
Unit Module Name Module Inclusions
Elementary Theory of Sets - Set Rules and Set
Combinations
Relations Equivalence Relations
Partial Order Relations
Discrete Theory, Total Order Relation
1 Relations and
Functions- Types of Functions
Functions
Injective Functions
Surjective Function
Bijective Functions
Function Composition
Introduction to Logic
Symbolization of Statements
Equivalence of Formula
2 Propositional Logic Propositional Logic
Theory of Inference
Predicate Logic-Inference
Theory of Predicate Logic
Introduction
Groups-Semi Groups
Complexes
3 Algebraic Structure
Product Semi Groups-Permutation
Groups-Order of a Group- Sub Groups
Cyclic Groups
Combinatorics-Permutation and Combinations,
Partitions
Permutations and
4 Pigeonhole Principle
Combinations
Inclusion-Exclusion Principle
Generating Functions, Recurrence Relations
Graph Theory - Graphs and Digraphs
Eulerian Cycle and Hamiltonian Cycle
5 Graph Theory Adjacency and Incidence Matrices, Vertex Colouring
Planarity, Trees -Transitive Closure: Warshal’s
Algorithm
Course: Mathematics for Computer Science
Program: MCA
Professor: Dr. Puneeth V

Grading Policy

Sl. No. Assessment Type Weightage

1 Continuous Assessment 30%

2 End Semester Examination 70%

Total 100%

Note: To successfully pass the course, learners must meet the following criteria:

1. Formative Assessments:
Minimum Score: 40%
Includes: Mid-course Assessment and Engagement Assessments (Participation in online
discussions, attendance at live sessions, and completion of feedback surveys)

2. Summative Assessment:
Minimum Score: 40%
Includes-End-course assessment

3. Overall Course Score:


Minimum Total: 50%

You might also like