Scribd
Upload
61 views3 pages

CS G526-Handout

This document provides details for the Advanced Algorithms & Complexity course. The course will cover randomized data structures, algorithm design techniques, NP-complete problems, and approximation algorithms. It will introduce techniques like randomized binary search trees, treaps, skip lists, dynamic programming, and greedy algorithms. Students will learn about hard computational problems, NP-completeness, and how to solve NP-hard problems using approximation and randomized algorithms. The course will be evaluated based on a mid-semester test, quizzes, and a comprehensive exam.

Uploaded by

xedale7959
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
61 views3 pages

CS G526-Handout

This document provides details for the Advanced Algorithms & Complexity course. The course will cover randomized data structures, algorithm design techniques, NP-complete problems, and approximation algorithms. It will introduce techniques like randomized binary search trees, treaps, skip lists, dynamic programming, and greedy algorithms. Students will learn about hard computational problems, NP-completeness, and how to solve NP-hard problems using approximation and randomized algorithms. The course will be evaluated based on a mid-semester test, quizzes, and a comprehensive exam.

Uploaded by

xedale7959
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/ 3

Birla Institute of Technology & Science, Pilani

K K Birla Goa Campus

First Semester 2021-2022

Course Handout (Part-II)

In addition to part I (General Handout for all courses appended to the time table) this
portion gives further specific details regarding the course.

Course Number : CS G526


Course Title : Advanced Algorithms & Complexity
Instructors : Bharat Deshpande (IC)

 Course Description:
Randomized data structures, Algorithmic Design Techniques, Optimization
problems, hard problems, NP Class, NP Complete class, Examples of problems
belonging to NP Complete class, Reducibility, Approximation algorithms for NP
hard problems, Randomized Algorithms.

 Objective
1. To introduce various algorithms design techniques to solve optimization
problems.
2. To introduce the notion of hard problems and the technique to prove
hardness of the problem.
3. Study approximation algorithm and randomized algorithms to solve hard
problems

 Text Book
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest & Clifford Stein
Introduction to Algorithms
Third Edition, PHI Learning Private Limited, 2015

 Reference Book
Rajeev Motwani & Prabhakar Raghavan
Randomized Algorithms
Cambridge University Press, 2000
 Lecture Modules:

S.No. Module Learning Objective


1 Randomized Data Structures Introduce advanced randomized data structures
(7 lectures)
2 Algorithm Design Techniques Review of algorithm design techniques and using them
(8 lectures) to solve optimization problems
3. NP-Completeness Introduce the concept of hardness in problems and to
(12 lectures) study some well-known hard problems
4. Approximation Algorithms Introduce the concept of Approximation algorithms and
(10 lectures) apply them to solve hard problems

 Lecture Schedule:

Module Lecture Topic Reference


Number Number (Sections of the
text/reference book)
1 1-2 Introduction & Motivation Class notes
3 Randomized Binary Search tree T-12.4
4-6 Treaps R-8.2
7-8 Skip Lists R-8.3
2 9 Introduction to Algorithm Design Techniques Class notes
10-13 Dynamic Programming T (15.2-15.5)
14-16 Greedy Algorithms T (16.1-16.3)
3 17-18 Introduction to notion of hard problems T-34.1
19 Defining NP & NP Complete class T (34.2-34.3)
20-21 Formula Satisfiability & 3-CNF Satisfiability T-34.4
22-23 Clique & Vertex Cover problem T-34.5
24-25 Hamiltonian Cycle problem & Travelling Salesman T-34.5
Problem (TSP)
26-27 Subset-Sum Problem & Set Covering Problem T-34.5
28-29 Bin packing & 0-1 Knapsack problems Class notes
4 30 Approximation Algorithms – Introduction T-35.1
31-32 Approximation Algorithm for Vertex Cover T (35.1-35.2)
Problem & TSP
33 Approximation Algorithm for Set covering T-35.3
Problem
34 Randomized Approximation algorithm for MAX- T-35.4
3-CNF
35 Approximation Algorithm for Subset-Sum problem T-35.5
36-37 Approximation Algorithm for Bin Packing & 0-1 Class Notes
Knapsack Problem
 Evaluation Scheme

 Components

Component Mode Duration Date Weightage


Mid-Sem Test Open Book See Time Table See Time Table 30%
Quiz Open Book To be announced To be announced 30%
Comprehensive Open Book See Time Table See Time Table 40%

 Notice: All notices for this course will be posted on Google Classroom/Quanta page.

Instructor-in-Charge
CS G526

You might also like