CISP 1020 - Computer Science II

4 sem hrs cr

This course is provides advanced topics in C++ programming that will include records, files, and dynamic memory allocation. Data structures including arrays, character strings, stacks, queues, linked lists, and binary trees. Each structure is presented in its abstract form and its C++ implementation. Prerequisite: CISP 1010  

In rare and unusual circumstances, a course prerequisite can be overridden with the permission of the Department Lead for the discipline.

Transfer (UT) or Non-Transfer Course (UN): UT

By the end of the course, students will be able to…

• describe basic object-oriented programming concepts: classes, objects, inheritance, friends, constructors, accessors, mutators, destructors, etc.
• write source code with the basic data structures used in programming. These include arrays, vectors, pointers, structs, strings, stacks, queues, linked lists, binary trees, and binary search trees.
• choose the most efficient and useful data structure to represent a given collection of data.
• be proficient in the use of pointer variables and memory addressing.
• use recursion as a means of problem solving.
• read data from files, write data to files, and perform advanced file operations.