CS11F - Computer Programming II | ![]() |
This course uses the following course codes:
- COMP 1200
- CS11F
Number of credits: 6
This course has the following prerequisites:
This course has no corequisites.
The assessment for the course is as follows:
This course has coursework assessment.
In course assignments weight: 25%
Final exam: 75%
Course syllabus
- Classes, objects, fields and methods
Constructor, accessor and mutator methods.
- Inheritance, abstract classes and polymorphism
Interfaces, inner classes and contracts
- Information hiding
Data encapsulation The concept of an Abstract Data Type Specification and implementation of stacks Queues and Lists Collection classes
- The Graphical User Interface
Components Layouts and event handling. Resursion
- Arrays
Sequential and binary search Simple sorting methods, e.g. selection, insertion, bubble Merging of ordered lists
- Files and exception handling.
- Two-dimensional arrays.
- Application of the above principles to solving a wide variety of problems.




