The second in a sequence of courses for majors in Computer Science. Covers: design and implementation of large-scale problems; abstract data types; data structures (files, sets, lists, stacks, queues, and trees); program verification and complexity; recursion; dynamic concepts (memory, scope, block structures); text processing; and an introduction to searching and sorting algorithms. This course should use the same programming language as CS 911 - Computer Science I. Students should complete BOTH CS 911 and CS 912 at the same school before transferring to the degree-granting school. (Prerequisite: CS 911 - Computer Science I.)
Students will be able to:
1. Use pointers (where language applicable) and function arguments.
2. Identify fundamental memory concepts of stack and heap.
3. Use data models with functions in object-oriented design.
4. Identify fundamental concepts of data structures.
5. Use dynamic memory to write link lists.
6. Write and use basic operations (insert, delete) on linked lists.
7. Apply object-oriented principles.
8. Use and write simple classes.
9. Explain the concepts of separating implementation from the programming interface with classes.
10. Design and write object-oriented programs with separate class files.
11. Explain the concept of information hiding including the difference between public and private variables and methods.
12. Explain and write class methods with emphasis on constructors (and destructors where language applicable).
13. Explain and use reference variables, static variables and methods.
14. Apply function overloading (and operator overloading where language applicable).
15. Write methods for object assignment, copy constructors.
16. Use stream I/O
17. Identify and explain concepts and application of inheritance.
18. Design and develop simple class hierarchies.
19. Apply concepts of dynamic binding and polymorphism (and virtual functions where language applicable).
20. Apply concepts of concrete/abstract classes (and interfaces where language applicable).
21. Write basic examples of stack and queue classes.
22. Write a binary tree class.
23. Apply recursive programming techniques.
24. Apply and use concepts of templates (or generics where language applicable).
25. Implement various sort and search algorithms with an introduction to program verification and complexity.
26. Employ multiple file compilations.
REVISED FALL 2015
Copyright © 1996 - 2018 iTransfer.
If you have questions about transferring in Illinois, we may be able to help. Reach
us at email@example.com, Phone:
Illinois Board of Higher Education,
Illinois Community College Board
Illinois State Board of Education
Saturday, January 20, 2018
Site disclaimer statement