What This Document Is
This is a comprehensive review resource designed to prepare students for the midterm exam in CISC 320, Introduction to Algorithms, at the University of Delaware. It consolidates key concepts and algorithms covered in the first portion of the course, offering a focused study aid for students seeking to solidify their understanding.
Why This Document Matters
This review is invaluable for any student enrolled in CISC 320 who wants to confidently approach the midterm examination. It’s particularly useful for those looking to efficiently recap the core principles and algorithmic techniques discussed in class. Utilizing this resource can help identify areas needing further attention and strengthen overall preparedness, leading to improved exam performance. It’s best used in the days leading up to the midterm as a final consolidation of knowledge.
Topics Covered
* Asymptotic Analysis & Growth of Functions (Big-O, etc.)
* Integer Arithmetic & Modular Mathematics
* Primality Testing & RSA Encryption
* Recurrence Relations & The Master Theorem
* Divide and Conquer Algorithms (Integer & Polynomial Multiplication, Selection)
* Graph Algorithms (Depth First Search, DAGs, Strongly Connected Components)
* Shortest Path Algorithms (Dijkstra’s Algorithm)
What This Document Provides
* A structured overview of the fundamental concepts presented in the first part of the course.
* A catalog of the algorithms introduced, allowing for quick reference and review.
* Guidance on the critical aspects of algorithm analysis, including runtime estimation and input parameter considerations.
* Insight into the types of questions students can expect on the midterm, encompassing multiple choice, short answer, and algorithmic problem-solving.
* A framework for understanding the correctness and underlying principles of each algorithm.
