Instructor:
Isaac Batts
Kenneth L Calvert
315
Credits:
3.0
001
Building:
Bill Gatton Student Center
Room:
Rm.WORSHAM
Semester:
Spring 2025
Start Date:
End Date:
Name:
Algorithm Dsgn/Analysis
Requisites:
Prereq: CS 215, CS 275, and engineering standing.
Class Type:
LEC
12:30 pm
1:45 pm
Days:
TR
Introduction to the design and analysis of algorithms. Asymptotic analysis of time complexity. Proofs of correctness. Algorithms and advanced data structures for searching and sorting lists, graph algorithms, numeric algorithms, and string algorithms. Polynomial time computation and NP-completeness.
Introduction to the design and analysis of algorithms. Asymptotic analysis of time complexity. Proofs of correctness. Algorithms and advanced data structures for searching and sorting lists, graph algorithms, numeric algorithms, and string algorithms. Polynomial time computation and NP-completeness.
CS