What Do CS1 Syllabi Reveal About Our Expectations of Introductory Programming Students?
Dublin City University - Computing Programming 2
Country: | Ireland |
University: | Dublin City University |
Course code: | CA 117 |
Course title: | Computing Programming 2 |
Date of Syllabus: | |
Source: | Manual search |
Associated Degrees: | Computer Science |
Prerequisits: | no |
Course for Majors: | yes |
Course stage: | 1 |
Semester: | 2 |
Programming language: | Python |
Language of Instruction: | English |
URL: | https://www.dcu.ie/registry/module_contents.php?function=2&subcode=CA117 |
Explicit or !Explicit LOs: | Explicit |
Learning Outcomes: |
Demonstrate a solid understanding in the selection and application of basic programming language constructs and data types required to write a simple program. Define instance methods and classes, and use them in writing programs of small to moderate size. Use the standard programming libraries, and in particular those parts of dealing with files and collections. Write programs that employ reading and writing text files, reading and writing sequential and random binary files, and accessing the web. Design and implement simple algorithms for searching, sorting, text handling, and arithmetic, and assess their time complexity. Given a particular problem (e.g. searching, sorting), be able to implement both iterative and recursive solutions. Write basic programs that use the most important data structures, including lists, sets and maps. Proceed from informal descriptions of simple problems to design and implementation of programming solutions. Comply with good software engineering principles in making programs, such as readability, maintainability, information hiding, and levels of abstraction. |
LO categories: |
Developing good program Design methodology & styling Problem Solving (also things like computational thinking) Abstraction Classes & objects Data Structures (general or implied complex like stacks, queues etc) Variables, assignment, arithmetic expressions, declarations, data types Searching algorithms Sorting Algorithms File handling & I/O Evaluating Time/Space Complexity Recursion |