CPET125C: Data Structures

Credits 3 Lab/Practicum/Clinical Hours 3 Lecture Hours 2
Search for Available CoursesRegister for This Course

Introduces students to abstract data types, object-oriented programming, and algorithm analysis. Students will use procedural and object-oriented techniques to program stacks, queues, linked lists, hash tables, and binary trees. Asymptotic (Big O) notation will be used to analyze data structures and sort algorithms. The effective use of C++ topics such as pointers, operator overloading, and templates will be covered. Students will write programs in C++ and Java.

Prerequisites

Students are required to pass prerequisite courses with a grade of C or higher. Exceptions apply; please consult your department chair.