IST 146 - Programming and Problem-Solving II (3)

Prerequisite: IST 145 .
A continuation of IST 145 . This course further examines data and procedural abstraction and the design, implementation and analysis of algorithms. Upon completion of this course, the student will have gained experience with the object-oriented paradigm, a more modern program design technique, as an alternative to top-down and structured design. In addition, students will learn basic searching and sorting algorithms, sequential and random access file algorithms, dynamic memory allocation techniques, and basic data structures such as linked lists and binary trees.

Print-Friendly Page (opens a new window)