CSCI-UA 310: Basic Algorithms
A rigorous study of algorithmic design paradigms and theoretical complexity analysis. Topics encompass divide-and-conquer strategies, greedy algorithms, dynamic programming, graph algorithms (shortest paths, minimum spanning trees, flow networks), and an…
Independent study archive Learn more
Materials are uploaded by users for self-study purposes. PwnHero is an independent platform, not affiliated with, sponsored by, or endorsed by any university or institution.
Common aliases: CSCI-UA 310
Study Resources for Basic Algorithms
Midterm (Exam 1) 2017
Midterm (Exam 2) 2016
Final Exam 2016
Midterm (Exam 1) 2018
Midterm (Exam 1) 2019
Midterm (Exam 1) 2020
Quiz 8
Assessment Inventory for CSCI-UA 310 (7 Documents)
| Document | Format | Year | Access |
|---|---|---|---|
| Midterm (Exam 1) 2020 | Midterm | 2020 | Illustrative Archive |
| Midterm (Exam 1) 2019 | Midterm | 2019 | Illustrative Archive |
| Midterm (Exam 1) 2018 | Midterm | 2018 | Illustrative Archive |
| Midterm (Exam 1) 2017 | Midterm | 2017 | Illustrative Archive |
| Midterm (Exam 2) 2016 | Midterm | 2016 | Illustrative Archive |
| Final Exam 2016 | Final | 2016 | Illustrative Archive |
| Quiz 8 | Quiz | — | Illustrative Archive |
Complete inventory of all 7 assessments (sorted by most recent). Select any document to inspect or use the search bar above to filter.
Course Overview & Exam Syllabus
Course Description
A rigorous study of algorithmic design paradigms and theoretical complexity analysis. Topics encompass divide-and-conquer strategies, greedy algorithms, dynamic programming, graph algorithms (shortest paths, minimum spanning trees, flow networks), and an introduction to computational complexity (P vs. NP and NP-completeness).
This archive catalogs 7 free educational resources and past exams for CSCI-UA 310 (Basic Algorithms) at New York University (NYU), containing 5 midterm papers, 1 final examination, and 1 quiz. Dated documents represent 5 distinct academic years between 2016 and 2020.
Core Exam Topics & Learning Objectives
- Algorithmic design paradigms: divide-and-conquer, greedy optimization, and dynamic programming in CSCI-UA 310
- Network flow, bipartite matching, and polynomial-time reductions (NP-completeness proofs)
- Graph algorithms: Dijkstra, Bellman-Ford, Prim, Kruskal, and topological sorting in Basic Algorithms
- Amortized analysis, randomized algorithms, and recurrence relation solutions via the Master Theorem
Frequently Asked Questions
Which assessment formats are cataloged in this CSCI-UA 310 archive?
This collection for CSCI-UA 310 at New York University (NYU) catalogs 7 total resources across the following formats: Midterms, Finals, Quizzes. Each document is listed in the assessment inventory table with its individual format tag and academic year where recorded.
What academic years are covered in this CSCI-UA 310 collection?
Dated materials in this archive span from 2016 to 2020, representing 5 distinct academic years. Coverage varies by the records currently cataloged for this course.
How can students access these free CSCI-UA 310 past exams?
All cataloged CSCI-UA 310 past exams and study materials are free to request. The catalog, metadata, assessment inventory, and illustrative thumbnails are public; source documents are not shown on this page. Use the connect options to request a study resource, and confirm current course topics and grading policies with the New York University (NYU) course syllabus.