Course catalog description: Study of complexity of algorithms and algorithm design. Tools for analyzing efficiency; design of algorithms, including recurrences, divide-and-conquer, dynamic programming, and greedy algorithms.
Class Times and Location: Monday & Wednesday 12:30 - 1:45, Butler Hall 100
Instructor: Eric Hansen
Textbook: The recommended (but not required) textbook is the Algorithms Illuminated book series by Tim Roughgarden. There are many other excellent textbooks and online sources of information, and you are encouraged to read whatever helps you the most in understanding what we cover in class.
Grading:
Prerequisites: CSE 2383 Data Structures and Analysis of
Algorithms, and CSE 2813 Discrete Structures, all with a grade of
C or better. Students are assumed to already be familiar
with elementary data structures, searching, sorting, and basic
terminology involving graphs, including the concepts of
depth-first search and breadth-first search.
University policies: The Mississippi State University Syllabus contains all policies and procedures that are applicable to every course on campus and online. The policies in the University Syllabus describe the official policies of the University and will take precedence over those found elsewhere. It is the student's responsibility to read and be familiar with every policy. The University Syllabus may be accessed at any time on the Provost website under Faculty and Student Resources and at https://www.provost.msstate.edu/faculty-student-resources/university-syllabus