CSE 373 - Syllabus

CSE Home

About Us

Search

Contact Info

Course Description

In this course, we will explore several fundamental algorithms and data structures in computer science. You will implement some algorithms in Java (preferred) or C++. Some of the data structures we will encounter include linked lists, stacks, queues, trees, heaps, hash tables, and graphs. We will study and analyze algorithms for searching, traversing trees, hashing, manipulating priority queues, sorting, finding shortest paths in graphs, and much more.

The basic idea of this course is to help you understand many of the fundamental data structures of computer science. With an appreciation for data structures and algorithms and practical experience in implementing them you can be a much more effective designer, developer, or customer for new applications. Elegant algorithms are also a nice counterpoint to the crufty code and weird features we encounter in daily work.

The textbook for this course is Data Structures and Algorithm Analysis in Java, by Mark Allen Weiss, 1999, Addison-Wesley. Errata. The Java source code for examples in the textbook is available.

If you prefer C++, an alternative is Data Structures and Algorithm Analysis in C++, also by Mark Allen Weiss. See the errata or example source code.

We'll be covering material from chapters 1-9. Specific topics include:

• Algorithm Analysis
• Lists, Stacks, Queues
• Trees
• Heaps and Priority Queues
• Hash Tables
• Sorting Algorithms
• Union-Find Algorithms
• Graphs and Shortest Path Algorithms

The programming language for this class is simple pseudocode. Pseudocode is not a specific language, but a notation to specify well algorithms so that they can be effectively be translated to actual code. pseudocode manual