Course Description
Summary
A survey of the most common patterns of storing digital information and the recipes to search, process, and access that information. Topics include data structures such as arrays, linked lists, stacks, queues, hash tables, and trees and algorithms such as brute force, divide and conquer, and recursion. Students will learn to compare the efficiency of these recipes and storage techniques, as well as how and when to use them. This intermediate level course will use a combination of the Python and C languages, reviewing and explaining specific features as needed and also practicing programming in those languages.
Students will require a MacOS, Windows, or Linux computer.
