| Main & Syllabi | Schedule | Resources | Scans | Homework | Exam | Code | Office hours for instructor and TAs |

CSE 2320
Algorithms and Data Structures

Fall 2019
Section 001 Lectures Tue,Thu 9:30am-10:50am, Room CH 106
Section 002 Lectures Tue,Thu 11am-12:20pm, Room LS 124

Instructor: Alexandra Stefan

Section 001 Syllabus
Section 002 Syllabus

Office hours for instructor and TAs You can see any TA for help, not only the ones assigned to your section.

Contact info:
Alexandra Stefan ERB 625 astefan@uta.edu
Shivanshi Pandya (TA, 001) ERB 501 shivanshi.pandya@mavs.uta.edu
Bhuwan Kc (TA, 001) ERB 501 bhuwan.kc@mavs.uta.edu
David Miller (TA, 002) ERB 501 david.miller2@mavs.uta.edu
Xin Miao(TA, 002) ERB 422 xin.miao@mavs.uta.edu

Textbook: Introduction to Algorithms, by Thomas H. Cormen, Charles E. Leiserson, Ronald E. Rivest, Clifford Stein,3rd edition (CLRS).
Other reference: Algorithms in C, Parts 1-5, by Robert Sedgewick. 3rd Edition, 2001, Addison-Wesley. ISBN-10: 0201756080. ISBN-13: 978-0201756081. NOTE: this book is usually sold as two volumes, one for parts 1-4, and one for part 5. Most of the class topics are covered in part 1. This is a good text book with interesting code (available online as well) and algorithms.

This course teaches students how to design, choose, and evaluate appropriate algorithms when designing and implementing software. Students will learn a broad set of algorithms covering different problems, including sorting, search, spanning trees, and network flow. Students will also learn about basic data structures, such as linked lists, stacks, and queues. The course will also teach students basic methods for analyzing algorithmic properties such as time and space complexity.