CS 530: Algorithms Analysis and Design (Fall 2003)

Administrative

Instructor

    Badie Sartawi, sartawi@planet.edu

    Office:  by appointment.

    Communication: use your username@science.alquds.edu for telecommunication with class email cs530@science.alquds.edu

Class: M. Sc. Computer Science Major Students.

Time: Saturday 1:00 - 3:30

Prerequisite: Admission to M. Sc. program

Books & References

Text materials for much of the subject matter covered in this course are freely available on the World Wide Web.  Check Links

Sara Base, Allen Van Gelder, Computer Algorithms Introduction to Design & Analysis, Third Edition, Addison Wesley Longman 2000

Steven Skiena, The Algorithm Design Manual, Springer-Verlag New York, Inc., 1998

The course

Description

Analysis of algorithms. Algorithm design techniques. Efficient algorithms for classical problems. Intractable problems and techniques to handle them. See also the full Lecture Schedule

Objectives

In this course, students will study:

1. Advanced data structures
2. General principles in the design of algorithms which are fundamental to computer science
3. The implementation of algorithms and the effective use of data structures
4. The analysis of algorithm complexity.

The primary vehicles to achieve these objectives are the study of general concepts in this area, and the application of them to important computer science areas. 

Course Conduct

The course will consist of lectures, programming project, and term paper.

Grading

Your scores on the programming project, term paper, and exams shall determine your numeric grade as follows:

·         10% Review Exam

·         30% Programming Project and Term Paper

·         30% Midterm Exam

·         30% Final Exam

Beyond the grade you receive on your home works and exams, several other factors can affect your final grade.

Programming Project

There will be one assignment for each student aims at developing part of the algorithms Java library being developed by the students. 

Class Participation

I shall occasionally ask you individually questions in the class, and may ask you to do problems on the board. You are strongly encouraged to ask questions in the class. Simply put, those who participate frequently in class provide me with another source of information as to how well they are learning the material, and how much effort they are putting into the course. I can use this information to help counterbalance a difficulty with exams or other requirements.  Class participation will never harm your grade; always ask any questions you may have about the material.

Academic Dishonesty

Any academic dishonesty will be lead to receiving a failing grade.

Tentative Lecture Schedule  

links 

    General

Dictionary of Algorithms, Data Structures 

Problems by the National Institute of Standards and  Technology    

Data Structures and Algorithms a good online guide, covering many topics from this class

Sorting and Searching Algorithms: A Cookbook by Thomas Niemann

Algorithms and Complexity a full textbook by Herbert S. Wilf.

Analysis of algorithms home page

The Stony Brook Algorithm Repository      

The Avida System                                                                                                               

The Avida project WebPages

Avida Movie (Warning! Very big -- 40Meg)

Binary Search Trees

Tutorial on Binary Search Tree Rotations

Tutorial on AVL trees.

G.A.I.G.S. in Java - a collection of animations demonstrating a variety of tree algorithms.

AVL Trees -- excellent animations, with sound!

Tutorial on Red-Black Trees (Includes details on Insertions and Deletions).

Decomposition    

A Tutorial on Dynamic Programming

Graph Theory

A collection of Tutorials on Graph Theory. This site also contains an excellent Glossary of terms.

Intractability       

A compendium of NP optimization problems

 Students