Course Schedule and Catalog
Course Schedule - Fall Semester 2017
Meeting location information can now be found on student schedules in ESTHER (for students) or on the Course Roster in ESTHER (for faculty and instructors).Additional information available here.
Meeting location information can now be found on student schedules in ESTHER (for students) or on the Course Roster in ESTHER (for faculty and instructors).Additional information available here.
COMP 382 002 (CRN: 15791)
REASONING ABOUT ALGORITHMS
Long Title: REASONING ABOUT ALGORITHMS
Department: Computer Science
Instructors:
Meetings:
10:50AM - 12:05PM TR (21-AUG-2017 - 1-DEC-2017)
4:00PM - 5:15PM R (21-AUG-2017 - 1-DEC-2017)
Part of Term: Full Term
Grade Mode: Standard Letter
Course Type: Lecture
Language of Instruction: Taught in English
Method of Instruction: Face to Face
Credit Hours: 4
Course Syllabus:
Course Materials: Rice Campus Store
Restrictions:
May not be enrolled in one of the following Level(s):
Graduate
Prerequisites: COMP 182
Section Max Enrollment: 75
Section Enrolled: 53
Total Cross-list Max Enrollment: 150
Total Cross-list Enrolled: 96
Enrollment data as of: 3-DEC-2024 12:16AM
Final Exam: Scheduled Final Exam-OTR Room
Final Exam Time:
7-DEC-2017
9:00AM - 12:00PM R
Description: Writing algorithms is fun, but how are you sure that the algorithm you wrote is flawless? Are there computing tasks for which it is impossible to produce an efficient algorithm, or, for that matter, any algorithm? To answer these questions, you have to learn to perform mathematical reasoning about algorithmic problems and solutions COMP 382 is an introduction to such reasoning techniques. Topics covered would include elementary logic, analysis of the correctness and efficiency of algorithms, and formal computational models like finite automata and Turning machines. On the way, you are also going to learn some new algorithm design techniques. Cross-list: COMP 382.