Course Schedule - Fall Semester 2019

     

COMP 382 002 (CRN: 11854)

REASONING ABOUT ALGORITHMS

Long Title: REASONING ABOUT ALGORITHMS
Department: Computer Science
Instructors:
Burke, Mike
Chaudhuri, Swarat
Meetings:
10:50AM - 12:05PM TR DCH 1055 (26-AUG-2019 - 6-DEC-2019) 
4:00PM - 5:15PM R BRK 101 (26-AUG-2019 - 6-DEC-2019) 
Session: Full Term
Grade Mode: Standard Letter
Course Type: Lecture/Laboratory
Language of Instruction: Taught in English
Method of Instruction: Face to Face
Credit Hours: 4
Course Syllabus:
Course Materials: Rice Campus Store
 
Restrictions:
Must be enrolled in one of the following Level(s):
Undergraduate Professional
Visiting Undergraduate
Undergraduate
Prerequisites: COMP 182
Section Max Enrollment: 110
Section Enrolled: 104
Total Cross-list Max Enrollment: 220
Total Cross-list Enrolled: 150
Enrollment data as of: 25-OCT-2021 10:15PM
 
Additional Fees: None
 
Final Exam: Scheduled Final Exam-OTR Room
Final Exam Times:
18-DEC-2019  
7:00PM - 10:00PM W DCH 1064
 
18-DEC-2019  
7:00PM - 10:00PM W DCH 1055
 
 
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.