COURSE:  COSI 335 Computer Algorithms 3 Credit Hours

TEXT:     COMPUTER ALGORITHMS    Introduction to Design and Analysis by Sara Baase and Allen Van Gelder
                Third  Edition ADDISON WESLEY 2000  ISBN 0-201-61244-5

CLASS MEETINGS:  T TH  9:30 - 10:45 AM, GOH 114

INSTRUCTOR:     Dr. Vivek S. Savur,  GOH  100 B  Extension 419   Office Hours

PREREQUISITES: COSI 330 Data Structures

COURSE DESCRIPTION: Investigation of various algorithms, their properties, applications, and corresponding data structures.

GOALS & OBJECTIVES:     Students will learn to design and analyze algorithms.  They will be involved in a project where they will select a topic, use their knowledge to prepare an algorithm.  If they wish to they might write a program in any language.  They should present it using web pages, power point, or an overhead projector.  They should also subit a report.

FORMAT & TECHNOLOGY:    There will be three hours of lecture every week.  There will be discussions in which the students are expected to participate.  Student will access my and other web pages to enhance their knowledge.

REQUIREMENT:     Students are expected to participate in class discussions, take quizzes and tests, make a presentation and submit a report.

Assignments         :        10%
Quizzes:                        10%
Mid-term:                      20%
Final:                             20%
Presentation:                  20%
Report:                          20%

Bonus points for class participation.

GRADING:                Over 88%        "A"
                                   75% to 88%    "B"
                                   62% to 74%    "C"
                                   50% to 61%    "D"
                                   Below 49%     "F"

REFERENCES:    Web pages and Journals

COURSE OUTLINE:

Week Chapter  Section           Topic
1         1            1, 2, 3           Introduction, Java pseudocode, Mathematics Background
2         1            4, 5              Analyzing Algorithms and Problems
3         2            All                Data Abstraction and Basic Data Structures
4         3            All                 Recursion and Induction
3         4            1, 2, 3           Sorting Routines
4         4            5, 6, 7
5         4            8, 9, 10, 11
6         5            1, 2, 3           Medians and Order Statistics: Minimum and Maximum, Selection
7         5            4, 5, 6 11 Elementary Data Structures: Stacks, Queues, Linked Lists, Trees
6 13  Binary Search Trees: Querying, Insertion and Deletion
7  Review, Test 1
8 16  Dynamic Programming: Matrix-Chain Multiplication, Longest Common Subsequence, Optimal Polygon Triangulation
9 17 Greedy Algorithms: Activity-Selection Problem, The Knapsack problem
10 19 RB-Trees: Searching the Tree , Inserting and Deleting a Node
11 23, 24 Elementary Graph Algorithms:     Searches Breadth-First Search, Depth-First Search , Minimum Spanning Trees: Other Searches Kruskal and Prim Algorithms. SpreadSheet Method  Spreadsheet method  Critical Path Method    Critical Path MethodCritical Path Method  Critical Path Method   Critical
CPM CLASS PROJECT

CALENDAR OF EVENTS:    Check my web page