CSE 2320 - Algorithms and Data Structures
Fall 2014


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.
Course web page: http://heracleia2.uta.edu/~Alexandros.Lioulemes/cse2320_fall2014
Lecture times: Monday, Wednesday and Friday, 3:00pm-3:50pm
Classroom: ERB 130
Textbook: Algorithms in C, Parts 1-5, by Robert Sedgewick. 3rd Edition, 2001, Addison-Wesley. ISBN-10: 0201756080. ISBN-13: 978-0201756081. NOTE: this textbook is usually sold as two volumes, one for parts 1-4, and one for part 5.
Grades

Links


Instructor:
Adnan Khan
E-mail: adnan.khan@mavs.uta.edu, adnanrahat2003@gmail.com
Office: ERB 323
Office hours: Monday and Friday 4:00pm - 5:00pm.

Teaching assistant (GTA):
Alexandros Lioulemes
W: http://heracleia2.uta.edu/~Alexandros.Lioulemes/
E:  alexandros.lioulemes@mavs.uta.edu
Office: ERB 304
Office hours: Tuesday and Thursday 4:00pm - 5:30pm