Ayaz

Mehran

Fall 2007

Saturday  8:00 - 10:00  (Theoretical concepts)
Tuesday   8:00 - 10:00  (Tutoring and implementation issues)

University of Tabriz, Department of Computer Science, Room A

Introduction to Algorithms, 2^nd Edition,
T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, MIT Press, 2001.

The aim of this course is to provide students with some basic skills in the domain of data structures and algorithms, enabling them

• To get to know the fundamental data structures,
• To understand the importance of data structures for the development of efficient algorithms,
• To design simple algorithms and perform algorithmic analysis,
• To get acquainted with various problem solving paradigms.

Topics include:

1. Algorithm Analysis
   1. The Role of Algorithms in Computing
   2. Properties of an Algorithm
   3. Time and Space Complexity
   4. Average and Worst Case Analysis
2. Fundamental Data Structures
   5. Lists, Stacks, Queues
   6. Sets, Graphs, Trees
   7. Heaps and Priority Queues
   8. Binary Search Trees
   9. Hash Tables
3. Introductory Notions of Algorithm Design
   10. Recursion and Divide-and-Conquer
   11. Dynamic Programming
   12. Greedy Methods
4. Sorting and Searching
   13. Merge Sort, Quick Sort
   14. Shell Sort, Bucket Sort
   15. Heap Sort

Coursework, Course Policies, Evaluations and Grading...

• Introduction to the Design and Analysis of Algorithms,
  Anany V. Levitin, Addison-Wesley, 2003.
• Data Structures and Their Algorithms,
  Harry R. Lewis and Larry Denenberg, Harper Collins Publishers, 1991.
• Data Structures and Algorithms,
  Alfred V. Aho, Jeffrey D. Ullman, and John E. Hopcroft, Addison-Wesley, 1983.
• And, of course, various resources available on the net, including the publisher's resource site for the textbook.