CSCI0302A-F23
Algorithms and Complexity
Algorithms and Complexity
This course focuses on the development of correct and efficient algorithmic solutions to computational problems, on the underlying data structures to support these algorithms, and on the social implications of algorithms. Topics include computational complexity, analysis of algorithms, proof of algorithm correctness, some advanced data structures, algorithmic techniques including greedy and dynamic programming, and the consequences of real-world applications of algorithms. The course complements the treatment of NP-completeness in CSCI 0301. (CSCI 0200 and CSCI 0201) 3 hrs. lect./disc.
This course focuses on the development of correct and efficient algorithmic solutions to computational problems, on the underlying data structures to support these algorithms, and on the social implications of algorithms. Topics include computational complexity, analysis of algorithms, proof of algorithm correctness, some advanced data structures, algorithmic techniques including greedy and dynamic programming, and the consequences of real-world applications of algorithms. The course complements the treatment of NP-completeness in CSCI 0301. (CSCI 0200 and CSCI 0201) 3 hrs. lect./disc.
- Term:
- Fall 2023
- Location:
- 75 Shannon Street 203(75SHS 203)
- Schedule:
- 9:45am-11:00am on Tuesday, Thursday (Sep 11, 2023 to Dec 11, 2023)
- Type:
- Lecture
- Course Modality:
- In-Person
- Instructors:
- Ananya Das
- Subject:
- Computer Science
- Department:
- Computer Science
- Division:
- Natural Sciences
- Requirements Fulfilled:
- DED
- Levels:
- Undergraduate
- Availability:
- View availability, prerequisites, and other requirements.
- Course Reference Number (CRN):
- 92612
- Subject Code:
- CSCI
- Course Number:
- 0302
- Section Identifier:
- A