Measuring and Analyzing Data Structure Performance Without AI Tools

Example developed based on CLOs from: CS 162 – Introduction to Computer Science II.

Purpose

This assignment challenges students to measure and analyze the performance of different data structures manually.

It emphasizes the human capacity to critically evaluate efficiency and understand the practical implications of computational choices.

Learning Outcomes

• Measure and compare the performance of data structures such as arrays, stacks, queues, and linked lists.
• Analyze the suitability of data structures for specific use cases.
• Reflect on the insights gained from performance analysis and their application to problem-solving.

Instructions

Format (Final Deliverable)

1. Performance Analysis
   • Measure the performance (e.g., time complexity, memory usage) of arrays, stacks, queues, and linked lists for operations like insertion, deletion, and traversal.
   • Collect data from experiments conducted using test cases provided by the instructor.
   • Compare the performance metrics and analyze the efficiency of each data structure for various scenarios.
2. Use Case Evaluation
   • For each data structure, identify a suitable use case based on your performance analysis.
   • Write a report summarizing your findings, including:
     • The strengths and weaknesses of each data structure.
     • Recommendations for selecting the most appropriate data structure for specific problem scenarios.
3. Reflection
   • Write a 300-word reflection addressing:
     • Challenges faced during the performance analysis.
     • Insights gained about the trade-offs between different data structures.
     • The importance of manual performance evaluation in understanding computational efficiency.

Grading Criteria

• Accuracy and depth of performance analysis (40%)
• Relevance and clarity of use case evaluation (30%)
• Quality and organization of the written report (20%)
• Insightfulness of reflection (10%)

Resources

• Test case templates provided by the instructor.
• Programming resources, such as GeeksforGeeks Data Structures Guide, for reference.