A completion to introductory problem solving and algorithm development. Taught in Java, topics include linked lists, binary trees, stacks, queues and other elementary data structures. Complexity analysis is introduced with an emphasis on searching and sorting algorithms. Note: This course will not count for computer science major or minor credit.
