Pointers and dynamic memory allocation in C/C++, recursion, stacks, queues, heaps, binary and multiway trees, graphs, hash tables. Sorting and searching algorithms. Course Information: Prerequisite(s): Grade of C or better in MCS 260 and Grade of C or better in MCS 275. Class Schedule Information: To be properly registered, students must enroll in one Discussion/Recitation and one Lecture.