What This Document Is
This document details a programming assignment for CS 201 – Data Structures and Discrete Mathematics I at the University of Illinois at Chicago. It outlines a set of problems designed to reinforce understanding of fundamental data structures and algorithms, specifically focusing on practical implementation in Java. The assignment centers around applying core concepts learned in the course to solve defined computational challenges.
Why This Document Matters
This assignment is crucial for students enrolled in CS 201 seeking to solidify their grasp of data structures and discrete mathematics. Successfully completing this work demonstrates proficiency in translating theoretical knowledge into functional code. It’s particularly valuable for students preparing for more advanced coursework or roles requiring strong programming and problem-solving skills. Reviewing this assignment description *before* beginning work will ensure a clear understanding of expectations and requirements.
Topics Covered
* Linked Lists
* Stacks
* Queues
* Prefix Expression Evaluation
* Algorithm Implementation in Java
* Data Structure Manipulation
* Error Handling in Code
* Code Compilation and Execution
What This Document Provides
* A detailed description of two distinct programming problems.
* Specific requirements for each problem, including expected functionality.
* Information regarding the submission process, including file naming conventions and the use of the `turnin` command.
* Guidance on the development environment (bert.cs.uic.edu) and compilation/execution procedures.
* Important notes regarding code commenting and avoiding external dependencies.
* Point values associated with each problem, indicating their relative weight in the overall grade.