What This Document Is
This is a programming assignment for an upper-level Data Structures and Algorithms course (CS 245) at the University of San Francisco. It focuses on practical application of linked list data structures and explores techniques for optimizing performance. The assignment builds upon a pre-existing “Student Database” program and requires modifications to its core functionality. It’s designed to reinforce understanding of dynamic memory allocation and list manipulation.
Why This Document Matters
This assignment is crucial for students learning to implement and optimize data structures. Successfully completing it demonstrates proficiency in linked list operations, problem-solving, and code modification. It’s particularly valuable for students preparing for software engineering roles where efficient data management is essential. This assignment would be most useful when actively working through the linked list portion of a data structures curriculum, or when preparing for technical interviews.
Common Limitations or Challenges
This document outlines the assignment requirements and grading criteria, but it does *not* provide the complete, runnable code for the “Student Database” program. Students will need access to the original online version to begin. It also doesn’t offer step-by-step solutions or debugging assistance; the expectation is for students to independently develop and test their code. The assignment assumes a foundational understanding of Java programming and linked list concepts.
What This Document Provides
* A detailed description of required modifications to a linked list-based student database program.
* Specific tasks related to implementing dummy nodes (head and tail) for improved efficiency.
* Instructions for incorporating a “free list” to reduce the overhead of node creation.
* Guidance on testing and debugging strategies, emphasizing the importance of handling edge cases.
* Information regarding submission guidelines, deadlines, and grading rubrics.
* Details about available support, including TA office hours.
