Start off with a basic introduction to topics covered in this course and the overall content structure, including an explanation of expected Swift knowledge.
Overview
Syllabus
- Introduction and Efficiency
- Start off with a basic introduction to topics covered in this course and the overall content structure, including an explanation of expected Swift knowledge.
- List-Based Collections
- Learn the definition of a list in computer science, and see definitions and examples of list-based data structures, arrays, linked lists, stacks, and queues.
- Searching and Sorting
- Explore how to search and sort with list-based data structures, including binary search and bubble, merge, and quick sort. Learn how to use recursion.
- Maps and Hashing
- Understand the concepts of sets, maps (dictionaries), and hashing. Examine common problems and approaches to hashing, and practice with examples.
- Trees
- Learn the concepts and terminology associated with tree data structures. Investigate tree types, such as binary search trees, heaps, and self-balancing trees.
- Graphs
- Examine the theoretical concept of a graph and understand common graph terms, coded representations, properties, traversals, and paths.
- Case Studies in Algorithms
- Explore famous computer science problems, specifically the Shortest Path Problem, the Knapsack Problem, and the Traveling Salesman Problem.
- Technical Interviewing Techniques
- Learn about the “algorithm” for answering common technical interviewing questions. Practice and get tips for giving interviewers what they’re looking for.
Taught by
Jarrod Parkes and James Parkes