Spring 2024
Section 001 Lectures Tue,Thu 9:30am-10:50am, CH 106 face-to-face,
Section 002 Lectures Tue,Thu 11am-12:20pm, UH 011 face-to-face
Instructor: Alexandra Stefan
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.
Textbook not required. Optional: Introduction to Algorithms, by Thomas H. Cormen, Charles E. Leiserson, Ronald E. Rivest, Clifford Stein,3rd edition (CLRS). - NOT required. All the material covered in homework and exams/quizzes will be provided in slides and discussed in lectures.
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. - NOT required
Alexandra Stefan | astefan(at)uta.edu | Mon, Wed 2:40-3:40pm, ERB 625, in person Tue, Thu 12:40-1:40pm, ERB 625, in person If there are no students in person, I will be available online as well and use Teams calls to have private meetings with stduents. Send me a chat if you want to talk to me. I can meet outside my office hours, most likely online, by appointment. |
Aryan Mediratta | axm0693(at)mavs.uta.edu | Tue 6-8pm, ERB 570 |
Carl Nguyen | cxn0679(at)mavs.uta.edu | Mon,Wed 11am-12 noon, in ERB 501, in person (and online if available) Mon,Wed 1-2pm, online |
Hananeel Jachin Pankaj (Jack) | hxp6103(at)mavs.uta.edu | Tue,Thu 2-3pm, in person and online Fri, 12-2pm, ERB 501, in person and online |