COMPSCI 130 - Software Fundamentals

At the end of this course, students will be able to:

1. Use common programming statements to implement iterative and recursive algorithms. [1, 2, 3]
2. Demonstrate how typical data structures are modelled in memory. [1]
3. Write programs that use standard abstract data types (lists, stacks, queues, priority queues, dictionaries). [1, 2, 3]
4. Implement standard abstract data types using standard data structures such as arrays, linked lists, hash tables and trees. [1, 2, 3]
5. Export and import data structures (via file or console I/O) using standard text-based data formats. [1, 2, 3]
6. Decompose a problem into several smaller tasks, design and implement a function for each task, and compose these functions into a program that solves the problem. [1,2, 3]
7. Use simple testing and debugging strategies to correct faulty programs. [1, 2]
8. Provide a useful level of documentation for all programs developed. [4]
9. Work together with peers to collaboratively develop, and review, programs. [4]