Scribd
Upload
87 views2 pages

Course Handbook: CS-835 Algorithmic Thinking: Template Version Number 1.6 Template Update Date 07 Mar 2013

This 3-4 credit course titled "Algorithmic Thinking" will be taught in Term II of the 2018-19 academic year. It aims to build problem solving skills using computational tools through topics like divide and conquer, dynamic programming, randomized algorithms, and more. Assessments include 4 assignments, a midterm exam, and a final exam or optional seminar/paper. The course references multiple resources and has no single textbook. It is designed for students with basic data structures knowledge and programming experience.

Uploaded by

peerlessdeepaks
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
87 views2 pages

Course Handbook: CS-835 Algorithmic Thinking: Template Version Number 1.6 Template Update Date 07 Mar 2013

This 3-4 credit course titled "Algorithmic Thinking" will be taught in Term II of the 2018-19 academic year. It aims to build problem solving skills using computational tools through topics like divide and conquer, dynamic programming, randomized algorithms, and more. Assessments include 4 assignments, a midterm exam, and a final exam or optional seminar/paper. The course references multiple resources and has no single textbook. It is designed for students with basic data structures knowledge and programming experience.

Uploaded by

peerlessdeepaks
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
You are on page 1/ 2

Course Handbook : CS-835 Algorithmic Thinking

Course Name Algorithmic Thinking


Course Proposer Name(s) Ashish Choudhury
Course Instructor Name(s) Prof. C. Pandu Rangan
Course Type Special topics
Credits 4
Grading Scheme A, A-, B+, B, B-, C+, C, D, F
Points as per IIIT-B Default Scheme
Area of Specialization (if applicable) CS
CS – Computer Science
DS – Data Science
ES – Embedded Systems
ITS – IT & Society
NC – Networking & Communication
SE – Software Engineering
Semester Term II, Academic Year 2018-19
Pre-Requisites (where applicable, specify exact course names)
Knowledge of basic data structures and some programming experience plus lots of
mathematical maturity is needed.
Course Description
This course aims to build a new style of thinking appropriate for problem solving using
Computers. While mathematical-thinking is needed for problem solving, algorithmic
thinking is for problem solving using tools ( parallel or distributed, security, in any context
for that matter). So, algorithmic thinking will be a great value.

Similar course has been already offered by the instructor at various IITs and IISc with
tremendous success. The course will have minimal overlap with the topics covered in a
typical algorithm or advanced algorithms course. Similar course has been also offered for
the industry people in the past, for example at IBM Tokyo, Samsung South Korea, Infosys,
TCS and NTT, Docomo labs Japan, just to name few industries, where the course contents
and overall offering has been widely appreciated.

Course Content
The following is the tentative list of topics to be covered in this course.

• Review of basic paradigms - incremental, decremental, pruning, Divide and conquer,


Dynamic programming, preprocessing, Lazy computations. Here we will have
Template Version Number
1.6
Template update date
07 Mar 2013
completely different set of case studies and examples with only 20% overlap with
any traditional books/course coverage. The objective here is to promote advanced
problem solving skills and intuition development. insight and connections and
patterns of thoughts are most important here.
• Intermediate algorithmic design - reductions and transformations (case studies),
Methods of iterated improvements, Matching, network flows, LP , unifying
techniques of combinatorial optimization
• Advanced algorithms - Approximate algorithms, greedy paradigm, layering
technique, local search, Primal dual strategies
• Randomized algorithms - Las vegas, Monte carlo methods, Chernoff type bounds
and their applications in analysis, Randomized attrition paradigm, one-sided and two
sided errors, abundance of witness for Monte Carlo algorithms (case studies from
Number theory on primality test, discrete log, factoring and quadratic residuacity),
randomized incremental methods and backward analysis (sampling strategies)
Assessments
The tentative assessment plan is as follows:

4 assignments (30 marks), mid semester exam (30 marks) and final exam (40 marks).
Exam questions will be based on class room discussions and assignments. A small set of
exceptional students may be given the option of seminar and term paper in place of final
exam.
Text Book / References
There is no single text book covering all the topics. We will be covering various topics from
various resources, which will be discussed as and when a particular topic will be covered.

Template Version Number


1.6
Template update date
07 Mar 2013

You might also like