CS Primer – Algorithms and Data Structures 2024-9

Published on: 2024-09-24 00:44:01

Categories: 28

Descriptions

Algorithms and Data Structures, Algorithms and Data Structures can be a particular rewarding area of study, because it drives at the core of computer programming: solving difficult problems. In the course below, you’ll learn a number of important data structures and algorithms, which we’re sure will prove useful throughout your career. Just as importantly, you’ll develop a stronger ability to understand, break down and solve novel problems, whether inventing your own techniques or repurposing those which you learn here. At the core of this course are the sequences of problems for each topic. You should aim to solve each problem, using the worked solutions and supplementary explainers as needed. For more suggestions on how to approach CS Primer. Also included are seminars recorded with CS Primer students, which you may like to work through as well, by stopping and asking yourself each of the questions we cover together. These were typically recorded after the students completed 1-2 problems in that module, so are designed to reinforce the fundamental concepts and prepare for harder problems.

What you’ll learn

crack a challenging programming problem using some techniques from Polya
convert an integer to Roman numerals without a bunch of “if” statements
implement binary search without any edge case bugs using invariants
assess three different approaches to the same simple problem
given an obvious linear time solution, look for a logarithmic or constant time one!
measure to find out when simple iteration beats binary search

Specificatoin of Algorithms and Data Structures

Publisher : CS Primer
Teacher : CS Primer
Language : English
Level : All Levels
Number of Course : 41
Duration : 26 hours and 32 minutes

Content of Algorithms and Data Structures

001 Staircase ascent
002 Convert to Roman
003 Correct binary search
004 Splitting a chocolate bar
005 What a programmer can learn from Polya
006 Finding duplicates
007 Fizzbuzz sum
008 Just iterate
009 Analysis practice
010 The enormous difference between polynomial and exponential
011 Building an intuition for common running times
012 Best worst and average case
013 The benefits and pitfalls of asymptotic analysis
014 Big O big omega and big theta
015 Parenthesis match
016 Doubly linked list
017 Basic calculator
018 Practice using stacks
019 Hazards of using linkedlists
020 What is an abstract data type
021 Motivating stacks and queues and an intuition for when to use them
022 Motivating linked lists
023 Merge sort
024 Fast exponentiation
025 Quicksort
026 Divide and conquer intuition and convex hull problem
027 Process tree
028 Word ladder
029 Jug pouring
030 Knights tour
031 Maze solver
032 Trees graphs and flipping pancakes
033 Dijkstras algorithm and A search
034 Depth-first and breadth-first search
035 Helping Michael with Word Ladder analysis
036 House robber
037 Perfect squares
038 Minimal grid path
039 Edit distance
040 Introduction to dynamic programming
041 QA problem solving technique and wrapup