Data Structures & Algorithms (CS600)


Course Instructor
Ann Mooney

The complexity and correctness of algorithms: big oh, big omega and big theta notations, recurrence relations and their solutions. Worst, average and amortized analysis of algorithms with examples. Basic and advanced data structures for searching, sorting, compression and graph algorithms. Students will be given programming assignments on a regular basis. Prerequisites: CS 590.


The course discussion questions encouraged everyone to talk. I am surprised at the amount of similarities between everyone’s respective fields."
Print This PageE-Mail This Page