Fall 2025
Section 001 Lectures Tue,Thu 9:30am-10:50am, NH 106 face-to-face,
Section 002 Lectures Tue,Thu 11am-12:20pm, NH 106 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
| OFFICE HOURS by NAME | |
| Alexandra Stefan astefan(at)uta.edu | Mon, Wed 2:40 - 3:10, ERB 625
Tue, Thu 12:40 - 1:40, ERB 625 |
| Aryan Mediratta axm0693(at)mavs.uta.edu | Tue,Thu 4 - 6 ERB 501 |
| Jack Pankaj hxp6103(at)mavs.uta.edu | Mon, Wed 11:20am - 12:50pm ERB 501
Fri 12 - 1pm, online on Teams
|
| Sam Mach sxm7324(at)mavs.uta.edu | Tue, Thu 12:30 - 1:50 and 3:30 - 4:10, ERB 501 |
The TA room is 501. This semester 512 is lab space for a faculty member.