Data Structures and Algorithms

Get an overview and hands-on experience with some of the more popular data structures, algorithms, design techniques and tools used in the industry today. The course curriculum focuses on the fundamental data structures and algorithms knowledge that every software engineer must have: arrays; strings; linked lists; stacks; queues; trees; tries; graphs; compression, etc.; and the algorithms associated with working with them (e.g., searching, sorting, depth first search, breadth first search, topological sort, minimum spanning trees, etc.). In addition, you research applications of these data structures and algorithms in the context of various real-world situations that you may find yourself in while on the job. For example, applications could include operating systems fundamentals, concurrency and parallelism, networks, distributed systems, and relational and NoSQL databases. While working through problem sets and assignments, you also gain hands-on experience with the tools and best practices that software engineers use to work with each other (e.g., command line environment, ticketing systems, version control systems, code review, unit testing, integration testing, design patterns, etc.).

The course is offered in Java and requires completion of weekly readings, discussions, homework assignments and programming assignments. Prior Java knowledge or experience is not required.