Discrete Mathematics

Start Date
15/07/2018

End Date
06/10/2018

Enrollment End Date
06/10/2018

No. of
Enrollments
1424 students

Course Syllabus
(PDF Format)

Created by

MINIRANI S
Narsee Monjee Institute of Management Studies
3.6
out of 5
Based on 5 ratings
5 star 2
4 star 1
3 star 1
2 star 0
1 star 1
Course Language
English
Course Type
Scheduled
Video transcripts
English
Course Category
Engineering, Mathematics
Learning Path
Course Length
80 Hours
Weekly time commitments
7 Hours
Course Completion
Yes, after passing all tests.
Exam Date
01/12/2018
Credits
4

108

Tutorials

0

Test

10

Assignments

0

Article

0

Overview

DISCRETE MATHEMATICS

Course Description: Discrete mathematics involves the study of objects which are separated or spaced apart from each other. For example, finite sets and the set of integers are discrete sets, while the set of real numbers would be considered to be a continuous, or non-discrete, set of objects. The difference between discreteness and continuity can also be seen in distinguishing between digital signals (discrete) and analog signals (continuous). As these examples suggest, discrete mathematics forms a conceptual complement to the continuous processes which underlie the study of calculus. Discrete sets often carry additional structures such as an operation (addition, multiplication, concatenation, union or intersection, for example) or an inequality relationship, and, when present, these structures are instrumental in developing deeper theories. With both the subject itself, as well as the experience of working with mathematical arguments, the course will provide a foundation for moving into higher level mathematics courses such as real analysis, abstract algebra, math modelling, geometry and topology.

List of Course Topics:

·         Sets and Propositions

·         Computability and Formal Languages

·         Permutations, Combinations and Discrete Probability

·         Relations and Functions

·         Graphs and Trees

·         Finite State Machines

·         Analysis of Algorithms

·         Generating Functions

·         Recurrence relations and Recursive algorithms

·         Groups and Rings

·         Boolean Algebra

To access the content, please enroll in the course.

Faculty

MINIRANI S

Dr. Minirani S is currently working as an Assistant Professor in the Department of Basic sciences and Humanities at Mukesh Patel school of Technology Management and Engineering, SVKM's NMIMS Deemed to be University, Mumbai. She has completed her Undergraduate and Master's degree programs in Mathematics from the University of Calicut and her Doctoral Program from National Institute of Technology Calicut in the area of Fractal Geometry.

FAQs

No FAQ has been added to this course yet.