Fundamentals of Algorithms

The course material and news regarding the Algorithms Design course presented at Tehran Technical University of Dr. Shariaty (دانشکده فني شريعتي) could be found here.

The lecture notes presented here are those regarding the Fundamentals of Algorithms using C++ Pseudocode reference book, the material for CLRS Introduction to Algorithms book are only used in the class and as are not electronically available they could not be fully provided here.



TA:
 F. Davodi (ftmh_davodi [at] yahoo [dot] com)

Course Lecture Notes (PPT):
 Chapter 0 - Introduction to the Course
Chapter 1 - Algorithms Efficiency, Analysis, and Order
Recurrence, Summations
Heapsort
Randomized Quicksort
Sorting in Linear Time
Bucketsort
Chapter 2 - Divide-and-Conquer
Chapter 4 - Greedy Approach
Chapter 3 - Dynamic Programming
Chapter 5 - Backtracking

Projects:
 Programming Project #1 (PDF) - Problem D - Used in Sharif reginal ACMICPC 2009. Due Date: Azar 26, 1388. Send your solutions and the source codes to eam.projects[at]gmail[dot]com, a quick presentation of the code and the algorithms will also be asked in the class, from every individual.


Assignements:
 Generally, disscused in the class sessions. Please send all the assignements to this (hw [at] adeli [dot] ir) email.

Final Grades (XLSX):
 Download the Excel File.

Material Regarding the Reference Books (Password Protected 7ZIP):
 1- Fundamentals of Algorithms Using C++ Pseudocode
2- Introduction to Algorithms (CLRS)

Introduction to Algorithms Book Cover