What This Document Is
This document outlines a programming assignment for CS 201 – Data Structures and Discrete Mathematics I at the University of Illinois at Chicago. It focuses on applying the core programming concept of recursion to solve practical problems using the Java programming language. This assignment is designed to be completed individually and assesses your ability to translate theoretical knowledge into functional code.
Why This Document Matters
This assignment is crucial for students enrolled in CS 201 who are looking to solidify their understanding of recursion. Successfully completing this assignment demonstrates proficiency in a fundamental problem-solving technique widely used in computer science. It’s particularly beneficial to review this assignment description before beginning to code, during the development process to ensure adherence to requirements, and as a reference for submission guidelines. Students preparing for more advanced data structures and algorithm courses will find a strong grasp of recursion invaluable.
Topics Covered
* Recursive Function Design
* String Manipulation
* Algorithmic Problem Solving
* Change-Making Algorithms
* Java Programming Fundamentals
* Program Submission Procedures
What This Document Provides
* Detailed problem descriptions for two distinct programming challenges.
* Specific requirements regarding the programming language (Java) and implementation approach (recursion).
* Clear instructions on how to submit your completed work using the `turnin` command-line tool on the `bert.cs.uic.edu` server.
* Information regarding the use of MOSS for plagiarism detection.
* Guidance on compiling and running your code within the course environment.
* Important reminders about code commenting and avoiding infinite loops.
