Fun with Math and Computing
Fun with Math and Computing
Ready to decode the digital world? Explore modern computing's core ideas and the principles behind your daily systems.
Course Instructor
Prof. Neeldhara
Duration
8 Weeks
Course Fee
500
-
Interested?
Enroll in this Course
About The Course
Fun with Math and Computing, an 8-week course by Prof. Neeldhara (IIT Gandhinagar), explores the fundamental ideas behind modern computing. It begins by examining how computers represent information using binary and other number systems. The course then delves into search algorithms like binary search and KMP pattern matching, illustrated with hands-on activities. It further investigates the challenges of designing fair and secure election systems, including Arrow's impossibility theorem. Finally, the course discusses cryptosystems, leading to RSA and introducing relevant number theory, to understand secure financial transactions.
Course Instructor
Prof. Neeldhara
Associate Professor, IIT Gandhinagar
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book. It has survived not only five centuries, but also the leap into electronic typesetting, remaining essentially unchanged. It was popularised in the 1960s with the release of Letraset sheets containing Lorem Ipsum passages, and more recently with desktop publishing software like Aldus PageMaker including versions of Lorem Ipsum.
Content Overview
Course Duration: 8 Weeks
Week 1-2: How do computers represent information?
- Topics: binary number system, more general bases (like factoradics, etc.), and some activities based on binary representations.
Week 3-4: How do computers find things?
- The first part will be about traditional search methods like binary search and then we talk about KMP-style pattern matching algorithms.
- Hands-on activities will include the 21 card trick and we will revisit ternary bases in this demonstration.
Week 5-6: How can computers help with elections?
- Challenges with coming up with voting systems, will explore issues around holding secure and fair elections, and finally a discussion of Arrow’s impossibility theorem.
Week 7-8: What makes financial transactions secure?
- A discussion of cryptosystems, leading up to RSA and introducing some number theory along the way.
Live Sessions: Weekly live interactive sessions on Saturdays
Course Eligibity
Students from partnered schools in any stream of Class X, XI and XII
Assessment Layout
Assignments: The course includes the release of 4 bi-weekly online assignments (every alternate week). Students need to attempt at least 3 of these assignments and must achieve a minimum score of 40 marks in each to be eligible for the certificate.
Take-Home Project: An optional project consisting of questions that cover all the topics from the theory videos, accompanied by a small project report.
Final Exam: An optional online final exam designed to assess the knowledge gained throughout the course, which can only be attempted after completing and submitting the required assignments and the take-home project.
Certificate Acquisition
Participation Certificate - Check Sample Certificate
To receive this participation certificate, a student must pass 3 out of 4 assignments with an average score of at least 40 marks.Completion Certificate - Check Sample Certificate
To receive this completion certificate, a student must fulfill the following criteria:
- A student must pass 3 out of 4 assignments with an average score of at least 40 marks.
- Submission of the take-home project is mandatory for the student.
- Once the above two conditions are satisfied, the student should attempt the final exam and must receive a minimum score of 40 marks.