Scribd
Upload
132 views2 pages

Advanced Analysis of Algorithms - Outline

This course covers advanced algorithm design techniques and analysis methods. Students will learn to devise algorithms for computational problems and compare their efficiency. They will also be introduced to real-world algorithms like online, streaming, approximation, and pattern matching algorithms. The course objectives, textbooks, contents, grading breakdown, and policies are outlined. Key topics include divide and conquer, greedy methods, dynamic programming, backtracking, branch and bound, amortized analysis, hashing, and string matching algorithms.

Uploaded by

FaisalShamsherAli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
132 views2 pages

Advanced Analysis of Algorithms - Outline

This course covers advanced algorithm design techniques and analysis methods. Students will learn to devise algorithms for computational problems and compare their efficiency. They will also be introduced to real-world algorithms like online, streaming, approximation, and pattern matching algorithms. The course objectives, textbooks, contents, grading breakdown, and policies are outlined. Key topics include divide and conquer, greedy methods, dynamic programming, backtracking, branch and bound, amortized analysis, hashing, and string matching algorithms.

Uploaded by

FaisalShamsherAli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Advanced Analysis of Algorithms

Instructor: Saira Karim

Office Hours: By Appointment

Objectives:
The objective of this course is mainly to teach algorithm design techniques and various analysis
techniques so that students can devise algorithms for the computational problems and compare their
efficiency with respect to various parameters. In addition to this, students will be introduced with various
real world algorithms like online algorithms, streaming algorithms, approximation algorithms and pattern
matching algorithms along with their applications in various fields.

Text Books:

Fundamental of Computer Algorithms: Ellis Horowitz and Sartaj Sahni


Introduction to Algorithms: Cormen, Leiserson and Rivest. McGraw Hill
Algorithms on Strings, Trees and Sequences: Dan Gusfield

Reference Books:
The Design and Analysis of Computer Algorithms by Alferd V. Aho, John E. Hopcroft and Jaffery
D. Ullman
Algorithms by Dasgupta, C. H. Papadimitriou and U. V. Vazirani
Additional Readings

Course Contents
Introduction (Algorithms, worst case Analysis)
Classes of Algorithms
o Divide and Conquer
o Greedy Method
o Dynamic Programming
o Backtracking
o Branch and Bound
Amortized Analysis (Splay Trees)
Hashing
String/pattern matching Algorithms
Online Algorithms
Data Stream Algorithms
Approximation Algorithms (if time permits)

Grading
Assignments 15%
Quizzes 10%
Term Paper/presentation 10%
Mid Term 25%
Final 40%
Important Notes
o Minimum requirement to pass this course is to obtain at least 50%
marks.
o All assignments and course work must be done individually. Plagiarism in any
work (Quiz, Assignment, Midterms, and Final Exam) from any source (Internet
or a Student) will result in severe penalty and may lead to F grade.
o No Late Submission of assignments and No Makeup Quizzes
o All the CS departments grading policies apply.

You might also like