KEMBAR78
Final Activity For Data Structures and Algorithms | PDF | Computer Program | Programming
Scribd
Upload
16 views2 pages

Final Activity For Data Structures and Algorithms

The final activity for Data Structures and Algorithms requires students to choose and implement one of three programming problems: a library catalog, a to-do list, or a contact list. Students must utilize appropriate data structures, document their implementation, and present their work to the class. Grading will be based on program implementation, documentation, and presentation, with submissions due between May 5-9, 2025.

Uploaded by

carltanalgo21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
16 views2 pages

Final Activity For Data Structures and Algorithms

The final activity for Data Structures and Algorithms requires students to choose and implement one of three programming problems: a library catalog, a to-do list, or a contact list. Students must utilize appropriate data structures, document their implementation, and present their work to the class. Grading will be based on program implementation, documentation, and presentation, with submissions due between May 5-9, 2025.

Uploaded by

carltanalgo21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Final Activity for Data Structures and Algorithms

Objective: To assess the student's basic understanding of data structures


and their ability to implement them to solve a simple problem.
Instructions:
1. Problem Selection: Students will choose one of the following
problems:
o Option 1: Simple Library Catalog: Create a program to
manage a small library catalog. The program should allow the
user to add books (title, author, ISBN), search for books by title,
and display all books in the catalog.
o Option 2: Basic To-Do List: Design a program to manage a to-
do list. The program should allow the user to add tasks, mark
tasks as complete, and display all tasks.
o Option 3: Contact List: Implement a program to manage a
contact list. The program should allow the user to add contacts
(name, phone number, email), search for contacts by name, and
display all contacts.
2. Implementation:
o Students must use appropriate data structures to implement the
chosen program. This includes:
 Selecting a suitable data structure (e.g., arrays, linked lists)
to store the data.
 Implementing the basic functionalities (e.g., add, search,
display).
o The implementation should be well-documented and follow good
programming practices.
o Students can use any programming language they are proficient
in (e.g., Java, C++, Python).
3. Documentation:
o Students will submit a short report that includes:
 A brief description of the program and its functionalities.
 An explanation of the data structure used and why it was
chosen.
 Code snippets of key implementations.
 Sample input and output to demonstrate the program's
functionality.
 Use a short-size bond paper.
 It must be placed on a white folder with a clip.
4. Presentation:
o Students will present their program to the class, including:
 A brief overview of the program.
 A demonstration of the program's functionalities.
Grading Rubric:
 Program Implementation (60%):
o Correctness and functionality of the program.
o Appropriate use of data structures.
o Code quality and documentation.
 Documentation (20%):
o Clarity and organization of the report.
o Explanation of data structure choice.
 Presentation (20%):
o Clarity of the presentation.
o Demonstration of program functionality.
Additional Notes:
 Students can work individually or in pairs.
 The instructor will provide guidance and support.
 This activity focuses on the practical application of basic data
structures in a simple programming task.
 Submission and Presentation on May 5-9, 2025

Prepared by:

DR. RENANTE A. DIAMANTE


Dean, CICT
Mentor

You might also like