100+ Computer Science Concepts Explained

16 insights saved from this video by @technology

@technology
Dynamic programming stores solved subproblems through memoization instead of computing the same results repeatedly.
@technology
Passing objects by reference lets multiple variables use one heap object without duplicating its memory.
@technology
Backtracking algorithms test possible options incrementally, returning to alternatives when a path fails.
@technology
A hash, map, or dictionary finds values through user-defined keys instead of integer indexes.
@technology
A stack serves the newest item first. A queue serves the oldest item first.
@technology
A recursive function without a base condition continues indefinitely and can cause a stack overflow.
@technology
A linked list stores each item with a pointer to the next item instead of relying on indexes.
@technology
Recursion begins when a function calls itself. Without a terminating condition, it becomes an infinite loop.
@technology
Every recursive algorithm needs a base condition that tells it when to stop.
@technology
A while loop repeats until its condition becomes false. A for loop commonly visits every item in an iterable.
@technology
A shell accepts text commands and returns output through a command-line interface to the operating-system kernel.
@technology
Programming languages make computers practical by hiding lower-level systems behind simpler layers of abstraction.
@technology
Character encodings such as ASCII and UTF-8 turn typed characters into binary values.
@technology
Data structures organize data. Algorithms are the code that uses it to solve problems.
@technology
A function is named code that accepts inputs, performs an operation, and returns an output.
@technology
A variable gives reusable names to data values stored somewhere in computer memory.

Post on X

Keep what you found in 100+ Computer Science Concepts Explained

A free account saves any of these cards to your Collection, and Korva resurfaces them so you actually remember.