CPET 125C
2
3
3

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 sorting 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: CPET 107C or permission of the Department Chair of Computer Engineering Technology)