Undergraduate Computer Science

CS U215: Algorithms and Data Structures for Engineers

Introduces algorithms and data structures for engineering students. Discusses data structures such as arrays, stacks, queues, and lists and the algorithms that manipulate these structures. Introduces simple algorithm analysis. Discusses classes and objects and presents the basic material about encapsulation, inheritance, and polymorphism. Introduces software development practices such as modular design, use of libraries, testing methods, and debugging techniques.
Prerequisites:
Restricted to Engineering students who have completed the introductory Engineering problem solving course (GEU 111) or the equivalent. May not be taken by majors in Computer or Information Science.
Credit hours: 4 SH
Course offerings: