Get updates on Eligibility, Admission, Placements Fees Structure
Quick Facts
| Medium Of Instructions | Mode Of Learning | Mode Of Delivery |
|---|---|---|
| English | Self Study | Video and Text Based |
Course Overview
Mathematics and computer science have entrenched relationships as math forms an important background in the field of computer science and computer science also has a lot of applicability math. As math is abstract, it helps in learning all the other programming languages.
Mathematical thinking is critical in all the crucial areas of computer science like bioinformatics, data science, machine learning, algorithms, computer graphics, etc. In this course, Mathematical Thinking in Computer Science by Coursera, you will be taught the most significant and paramount tools used in discrete mathematics like recursion, logic, examples, induction, optimality.
In this course, we apply a practical approach: try-this-before-we-explain-everything. Due to such a practice, you will be solving a plethora of interactive and mobile-friendly puzzles. These are carefully designed to give you a chance and opportunity to invent many of the crucial ideas and concepts by yourself.
The Highlights
- 100% online.
- Deadlines are flexible
- Beginner-level course.
- Approx. 41 hours are required for the course completion.
- A shareable certificate is awarded at the end of the course.
- Subtitles available in English, Arabic, and Vietnamese
- Shareable Certificate
Programme Offerings
- practical test
- student support
- enhanced technical support
- assignments
- peer reviews
- Shareable Certificate
- one on one doubt sessions
- Flexible Deadlines.
Courses and Certificate Fees
| Certificate Availability | Certificate Providing Authority |
|---|---|
| yes | UC San DiegoCoursera |
- Unlimited access to all the given courses in the specialization.
- You can cancel anytime without any penalties.
- You will be rewarded with a certificate after the course completion.
Mathematical Thinking in Computer Science fees details:
Particulars | Amount |
1 Month | Rs. 6,634 |
3 Month | Rs. 13,268 |
6 Month | Rs. 19,903 |
Eligibility Criteria
Eligibility Criteria
To pursue the course, students need to have an understanding of basic mathematics like what is square or how to add fractions. Students also need a basic understanding of programming languages as some quizzes need programming in Python.
Certificate Qualifying Detail
To get the certificate, students need to opt for the specialisation course. Students will get a certificate when they complete the work. The certificate will be added to the page of accomplishments. Students can visit this page from where they can share the certificate on their LinkedIn Page.
What you will learn
After completing the course, students will learn the following:
- Understand the concepts of Mathematical Induction
- Become fluent in important tools used in discrete mathematics such as induction, recursion, logic, and invariants.
- Get an in-depth understanding of the concepts of proof theory
- Learn to solve interactive puzzles that have been designed to allow you to innovate different ideas and concepts
Who it is for
The course is ideal for beginners and professionals. Furthermore, if you have any of the below-mentioned job roles, this course is for you -
- Computer hardware engineer
- Cloud computing specialist
- Software programmers
Mathematical Thinking in Computer Science is for anybody (beginners and professionals) who has a keen interest in learning discrete maths and its applications in the field of computer science. This course will be very helpful to those who are looking to make a successful career in this industry.
Admission Details
You can get yourself enrolled in this self-paced online course. There are no such formalities required to be enrolled for Mathematical Thinking in Computer Science by Coursera.
Application Details
Step 1: Log on to the Coursera website
Step 2: Look for Mathematical Thinking in Computer Science course using the search
Step 3: You can either opt for the free trial or subscribe to the specialisation. When you opt for the subscription, you need to pay the fee to get a certificate and get access to all the course material.
Step 5: If you are already registered, use your id and password to log in. If you have not registered, create a new one. You can also use your Gmail, Facebook, or Apple Id to login.
Step 6: Go to the course and click ‘Enroll’
Step 7: Buy the course
The Syllabus
Videos
- Promo Video
- Proofs?
- Proof by Example
- Impossibility Proof
- Impossibility Proof, II and Conclusion
- One Example is Enough
- Splitting an Octagon
- Making Fun in Real Life: Tensegrities (Optional)
- Know Your Rights
- Nobody Can Win All The Time: Nonexisting Examples
Readings
- Companion e-book
- Active Learning
- Python Programming Language
- Slides
- Slides
- Acknowledgements
Quizzes
- Puzzle: Tile a Chessboard
- Tiles, dominos, black and white, even and odd
- Puzzle: Two Congruent Parts
- Puzzle: Splitting
Videos
- Magic Squares
- Narrowing the Search
- Multiplicative Magic Squares
- More Puzzles
- Integer Linear Combinations
- Paths In a Graph
- Warm-up
- Subset without x and 100-x
- Rooks on a Chessboard
- Knights on a Chessboard
- Bishops on a Chessboard
- Subset without x and 2x
- N Queens: Brute Force Search
- N Queens: Backtracking: Example
- N Queens: Backtracking: Code
- 16 Diagonals
Readings
- Slides
- Slides
- N Queens: Brute Force Solution Code
- N Queens: Backtracking Solution Code
- 16 Diagonals: Code
- Slides
Quizzes
- Puzzle: Magic Square 3 times 3
- Puzzle: Different People Have Different Coins
- Puzzle: Free Accommodation
- Is there...
- Maximum Number of Two-digit Integers
- Maximum Number of Rooks on a Chessboard
- Maximum Number of Knights on a Chessboard
- Maximum Number of Bishops on a Chessboard
- Subset without x and 2x
- Puzzle: N Queens
- Puzzle: 16 Diagonals
- Puzzle: Maximum Number of Two Digit Integers
- Number of Solutions for the 8 Queens Puzzle
Videos
- Recursion
- Coin Problem
- Hanoi Towers
Readings
- Two Cells of Opposite Colors: Hints
- Slides
- Why Induction?
- What is Induction?
- Arithmetic Series
- Plane Coloring
- Compound Interest
- Inequality Between Arithmetic and Geometric Mean
- More Induction Examples
- Where to Start Induction?
- Triangular Piece
- Proving Stronger Statements May Be Easier!
- What Can Go Wrong with Induction?
Quizzes
- Largest Amount that Cannot Be Paid with 5- and 7-Coins
- Puzzle: Hanoi Towers
- Puzzle: Two Cells of Opposite Colors
- Puzzle: Guess a Number
- Puzzle: Connect Points
- Induction
- Pay Any Large Amount with 5- and 7-Coins (Optional)
- Two Cells of Opposite Colors: Feedback
- Puzzle: Local Maximum (Optional)
Videos
- Intro
- Examples and Counterexamples
- Logic
- Summary
- Reductio ad Absurdum
- Balls in Boxes
- Numbers in Tables
- Pigeonhole Principle
- An (-1,0,1) Antimagic Square
- Handshakes
Quizzes
- Puzzle: Always Prime?
- Examples, Counterexamples and Logic
- Puzzle: Balls in Boxes
- Puzzle: Numbers in Boxes
- Puzzle: Numbers on the Chessboard
- Numbers in Boxes
- How to Pick Socks
- Pigeonhole Principle
- Puzzle: An (-1,0,1) Antimagic Square
- Girls, Boys, and Two Languages
Readings
- Double Counting
- `Homework Assignment' Problem
- Coffee with Milk
- More Coffee
- Debugging Problem
- Termination
- Arthur’s Books
- Even and Odd Numbers
- Summing up Digits
- Switching Signs
- Advanced Signs Switching
Quizzes
- Puzzle: Sums of Rows and Columns
- 'Homework Assignment' Problem
- 'Homework Assignment' Problem
- Chess Tournaments
- Debugging Problem
- Merging Bank Accounts
- Puzzle: Arthur's Books
- Puzzle: Piece on a Chessboard
- Operations on Even and Odd Numbers
- Puzzle: Summing Up Digits
- Puzzle: Switching Signs
- Recolouring Chessboard
- Girls and Boys
- Coffee with Milk
- More Coffee
- Football Fans
Videos
- The Rules of 15 Puzzles
- Permutations
- Proof: The Difficult Part
- Mission Impossible
- Classify a Permutation as Even/Odd
- Bonus Track: Fast Classification
- Project: The Task
- Quiz Hint: Why Every Even Permutation Is Solvable
Readings
- Reading
- Slides
- Even permutations
- Bonus Track: Finding The Sequence of Moves
Quizzes
- Puzzle: 15
- Transpositions and Permutations
- Neighbor transpositions
- Is a permutation even?
- Bonus Track: Algorithm for 15-Puzzle
Instructors
UC San Diego Frequently Asked Questions (FAQ's)
If you choose to take a course in the audit mode, you will be able to see most of the course materials at no cost. To get access to the graded assignments and to get rewarded with a certificate, you will be required to push the certificate experience which can be either during your audit or after.
You can apply for it by clicking on the Financial Aid link situated beneath the “Enroll” button on the left side. After that, you will be prompted to complete an application and you will get a notification if your application has been approved.
When you get yourself enrolled in the course, you will receive access to all the courses in Specialization. You will also be rewarded with a certificate on the completion of the work given. Your electronic Certification will be added to your Accomplishments page from where you can get it printed. This certificate can be added to your LinkedIn profile, printed resume, and CVs.
Binary math, college algebra, statistics, discrete math, and calculus are required for an integrated study of computer science.
Mathematical thinking is applied in all the important areas of computer science. Discrete mathematics is crucial in studying and describing objects and problems in fields such as computer algorithms, cryptography, programming languages, software development, etc.
The University of California San Diego and National Research University Higher School of Economics offers this course to learners on Coursera
There are 3 instructors in total who are teaching the course. They are -
- Alexander S. Kulikov
- Vladimir Podolski
- Michael Levin
Yes, this course can help launch your career as a software engineer and security analyst.
Ideally, you would be required to spend at least 41 hours a week completing the course.
While it obviously depends upon the learner, Coursera recommends that the learner takes the course in the specified order since all the concepts taught under each module builds upon previously taught concepts within the syllabus.