CISC 4080: Computer Algorithms
An advanced algorithms course analyzing algorithm design strategies (divide-and-conquer, dynamic programming, greedy algorithms), graph algorithms, complexity classes, and NP-completeness.
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: CISC 4080
Study Resources for Computer Algorithms
Final Exam 2017
Midterm (Exam 1) 2015
Midterm (Exam 2) 2015
Midterm (Exam 1) 2017
Midterm (Exam 1) 2018
Midterm (Exam 1) 2019
Midterm (Exam 1) 2020
Worksheet 4
Assessment Inventory for CISC 4080 (8 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 |
| Final Exam 2017 | Final | 2017 | Illustrative Archive |
| Midterm (Exam 1) 2017 | Midterm | 2017 | Illustrative Archive |
| Midterm (Exam 1) 2015 | Midterm | 2015 | Illustrative Archive |
| Midterm (Exam 2) 2015 | Midterm | 2015 | Illustrative Archive |
| Worksheet 4 | Worksheet | — | Illustrative Archive |
Complete inventory of all 8 assessments (sorted by most recent). Select any document to inspect or use the search bar above to filter.
Course Overview & Exam Syllabus
This archive catalogs 8 free educational resources and past exams for CISC 4080 (Computer Algorithms) at Fordham University, containing 6 midterm papers, 1 final examination, and 1 worksheet. Dated documents represent 5 distinct academic years between 2015 and 2020.
Core Exam Topics & Learning Objectives
- Algorithmic design paradigms: divide-and-conquer, greedy optimization, and dynamic programming in CISC 4080
- Network flow, bipartite matching, and polynomial-time reductions (NP-completeness proofs)
- Graph algorithms: Dijkstra, Bellman-Ford, Prim, Kruskal, and topological sorting in Computer Algorithms
- Amortized analysis, randomized algorithms, and recurrence relation solutions via the Master Theorem
Frequently Asked Questions
Which assessment formats are cataloged in this CISC 4080 archive?
This collection for CISC 4080 at Fordham University catalogs 8 total resources across the following formats: Midterms, Finals, Worksheets. 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 CISC 4080 collection?
Dated materials in this archive span from 2015 to 2020, representing 5 distinct academic years. Coverage varies by the records currently cataloged for this course.
How can students access these free CISC 4080 past exams?
All cataloged CISC 4080 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 Fordham University course syllabus.