Complete Intro to Computer Science, v2

Ever been asked a dumb interview question about arcane computer science concepts that you haven’t ever learned and you question why they’re asking? We’re going to learn both how to ace those interviews and why those concepts are still useful to you! Four more semesters of computer science! This class will cover additional concepts not covered by the first part. It is not required that you take both or even in order. So come in and learn the sorts of things they’ll ask you in technical interviews and that will help you be a better programmer.

• Algorithms and Big O Analysis
• Recursion
• Sorting: Bubble, Insertion, Merge & Quick
• Data Structures: Stacks, Queues and Priority Queues, Maps and Sets, Hash Tables, Array Lists, Linked Lists, Binary Search Trees & AVL Trees
• Functional Programming 101: Map, Reduce & Filter
• Bloom filters, Tree traversals, Path finding, Maze generation, and Graphs
• NP (nondeterministic polynomial time), NP-Hard, NP-Complete problems (like traveling salesman)
• More sorting!