Stacks and their implementations. Prefix, postfix, and infix notation. Queues and linked lists and their implementations. Binary and general trees and their implementations and traversals. Sorting and searching techniques. Graph algorithms.
Office hours are available for students who need further clarification of concepts presented in lecture, or have made solid attempts on the homework assignments or other practice problems and require further assistance understanding how to approach such problems.
Q&A Discussion Board
(access code: bulldogs)
Schedule (Suggested readings are listed on the schedule)
Workbook of Practice Problems (Purchase PDF)
By the end of the course, students should be able to: