What Do CS1 Syllabi Reveal About Our Expectations of Introductory Programming Students?
Stevens Institute of Technology - Introduction to Programming, Data structures and Algorithms
| Country: | USA |
| University: | Stevens Institute of Technology |
| Course code: | CS 570 |
| Course title: | Introduction to Programming, Data structures and Algorithms |
| Date of Syllabus: | |
| Source: | Manual search |
| Associated Degrees: | Computer Science |
| Prerequisits: | no |
| Course for Majors: | |
| Course stage: | |
| Semester: | |
| Programming language: | None |
| Language of Instruction: | English |
| URL: | https://web.stevens.edu/academic_files/courses/outcome/CS570.pdf |
| Explicit or !Explicit LOs: | Explicit |
| Learning Outcomes: |
Write programs using basic statements, data types, expressions, control flow, library functions, and I/O functions Write classes and use inheritance to extend an existing class Write programs that include recursive algorithms Describe the notion of abstract data types and their use in object-oriented designs Implement basic data structures such as vectors, linked lists, stacks, and queues Use and/or implement basic tree data structures such as binary trees, priority queues, and balanced trees Use and/or implement hashing Use and/or implement fundamental graph algorithms such as topological sort, shortest path, depth-first search, and breadth-first search |
| LO categories: |
Writing programs Classes & objects Inheritance Data Structures (general or implied complex like stacks, queues etc) Control Structures & logic (if/else etc) Functions, methods and procedures Variables, assignment, arithmetic expressions, declarations, data types Sorting Algorithms File handling & I/O |