Data Structures and Algorithms II
Second Semester (Spring)

Instructor
Ayaz
Teaching Assistant
Mehran
Semester
Spring 2007
Class Time
Saturday  8:00 - 10:00   (Theoretical concepts)
Tuesday   8:00 - 10:00* (Tutoring and implementation issues)
Class Location
University of Tabriz, Department of Computer Science, Room A
Textbook
Introduction to Algorithms, 2nd Edition,
T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, MIT Press, 2001.
Course Objectives
The aim of this course is to provide students with some advanced topics in the domain of data structures and algorithms, enabling them
  • To get to know some advanced data structures,
  • To understand the importance of data structures for the development of efficient algorithms,
  • To design some advanced algorithms and perform algorithmic analysis,
  • To learn more about various problem solving paradigms.
Course Contents
Topics include:
  1. Advanced Data Structures
    1. B-Trees
    2. Binomial Heaps
    3. Fibonacci Heaps
    4. Data Structures for Disjoint Sets
  2. Graph Algorithms
    1. Elementary Graph Algorithms
    2. Minimum Spanning Trees
    3. Single-Source Shortest Paths
    4. All-Pairs Shortest Paths
    5. Maximum Flow
  3. Selected Topics
    1. Sorting Networks
    2. Matrix Operations
    3. Linear Programming
    4. Polynomials and the FFT
    5. Number-Theoretic Algorithms
    6. String Matching
Grading
Coursework, Course Policies, Evaluations and Grading...
Additional References and Resources
  • 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.
Back to Homepage

Ayaz Isazadeh
March, 2007