| 1 - All Notes.html | 102.4 B | ||
| 1 - Binary to Hex and Back.mp4 | 14.1 MB | ||
| 1 - Binary to Hex and Back_en.srt | 17.5 KB | ||
| 1 - Heaps Introduction.mp4 | 7 MB | ||
| 1 - Heaps Introduction_en.srt | 6.7 KB | ||
| 1 - How is Data Stored.mp4 | 12.5 MB | ||
| 1 - How is Data Stored_en.srt | 13.1 KB | ||
| 1 - Introduction to Graphs.mp4 | 5.6 MB | ||
| 1 - Introduction to Graphs_en.srt | 5.3 KB | ||
| 1 - Introduction to Sorting Algorithms.mp4 | 2 MB | ||
| 1 - Introduction to Sorting Algorithms_en.srt | 2.3 KB | ||
| 1 - Introduction.mp4 | 10.2 MB | ||
| 1 - Introduction_en.srt | 2.1 KB | ||
| 1 - Nodes.mp4 | 5.6 MB | ||
| 1 - Nodes_en.srt | 6.6 KB | ||
| 1 - Stacks.mp4 | 13.7 MB | ||
| 1 - Stacks_en.srt | 15.3 KB | ||
| 1 - Thank You.mp4 | 13 MB | ||
| 1 - Thank You_en.srt | 2 KB | ||
| 1 - Trees.mp4 | 10.6 MB | ||
| 1 - Trees_en.srt | 11.7 KB | ||
| 10 - Big O Notation.mp4 | 25.5 MB | ||
| 10 - Big O Notation_en.srt | 19.7 KB | ||
| 10 - Linked List Review.mp4 | 5.6 MB | ||
| 10 - Linked List Review_en.srt | 5.8 KB | ||
| 10 - O(1) Approximation.mp4 | 23.3 MB | ||
| 10 - O(1) Approximation_en.srt | 17.5 KB | ||
| 10 - Recursion.mp4 | 20.7 MB | ||
| 10 - Recursion_en.srt | 16.3 KB | ||
| 10 - Stack and Queue Real World Examples.mp4 | 7.4 MB | ||
| 10 - Stack and Queue Real World Examples_en.srt | 13.2 KB | ||
| 11 - Circular and Dynamic Array Notes.html | 5.7 KB | ||
| 11 - Quick Sort.mp4 | 32.1 MB | ||
| 11 - Quick Sort_en.srt | 23 KB | ||
| 11 - Stacks and Queues Quiz Explanation.mp4 | 14.1 MB | ||
| 11 - Stacks and Queues Quiz Explanation_en.srt | 9.1 KB | ||
| 11 - n-Notation Notes.html | 8 KB | ||
| 12 - Array Review.mp4 | 22.4 MB | ||
| 12 - Array Review_en.srt | 11.8 KB | ||
| 12 - Big O Real-World Example.mp4 | 14.2 MB | ||
| 12 - Big O Real-World Example_en.srt | 16 KB | ||
| 12 - Quick Sort Run Time.mp4 | 36.2 MB | ||
| 12 - Quick Sort Run Time_en.srt | 16.9 KB | ||
| 13 - Array Real World + Code Examples.mp4 | 43.4 MB | ||
| 13 - Array Real World + Code Examples_en.srt | 9.8 KB | ||
| 13 - Quick Sort Notes.html | 3.4 KB | ||
| 14 - Quick Sort Code Example.mp4 | 28 MB | ||
| 14 - Quick Sort Code Example_en.srt | 16.7 KB | ||
| 15 - Merge Sort.mp4 | 31.9 MB | ||
| 15 - Merge Sort_en.srt | 19.3 KB | ||
| 16 - Merge Sort Run Times.mp4 | 12 MB | ||
| 16 - Merge Sort Run Times_en.srt | 11.3 KB | ||
| 17 - Merge Sort Notes.html | 2.6 KB | ||
| 18 - Merge Sort Code Example.mp4 | 32.1 MB | ||
| 18 - Merge Sort Code Example_en.srt | 17.7 KB | ||
| 18 - Merge Sort Code Example_en.vtt | 18.1 KB | ||
| 19 - Stable vs NonStable.mp4 | 17.1 MB | ||
| 19 - Stable vs NonStable_en.srt | 9.1 KB | ||
| 2 - Basic Types of Graphs.mp4 | 17.9 MB | ||
| 2 - Basic Types of Graphs_en.srt | 15 KB | ||
| 2 - Binary Number Introduction.mp4 | 39.5 MB | ||
| 2 - Binary Number Introduction_en.srt | 19.9 KB | ||
| 2 - Binary Search Trees.mp4 | 10.5 MB | ||
| 2 - Binary Search Trees_en.srt | 13.3 KB | ||
| 2 - Bubble Sort.mp4 | 17.6 MB | ||
| 2 - Bubble Sort_en.srt | 16.5 KB | ||
| 2 - Decimal to Hex and Back.mp4 | 13.3 MB | ||
| 2 - Decimal to Hex and Back_en.srt | 17.6 KB | ||
| 2 - Fixed Array Introduction.mp4 | 19.5 MB | ||
| 2 - Fixed Array Introduction_en.srt | 8.6 KB | ||
| 2 - Heap Analysis.mp4 | 17.3 MB | ||
| 2 - Heap Analysis_en.srt | 18.8 KB | ||
| 2 - Introduction to Time-Complexity.mp4 | 3.1 MB | ||
| 2 - Introduction to Time-Complexity_en.srt | 3.4 KB | ||
| 2 - Singly Linked List.mp4 | 21.4 MB | ||
| 2 - Singly Linked List_en.srt | 21.7 KB | ||
| 2 - Stack Examples.mp4 | 19.7 MB | ||
| 2 - Stack Examples_en.srt | 17.1 KB | ||
| 20 - Stable Vs NonStable Notes.html | 4.4 KB | ||
| 21 - Sorting Algorithm Real World Examples.mp4 | 22 MB | ||
| 21 - Sorting Algorithm Real World Examples_en.srt | 6.7 KB | ||
| 3 - Binary Deca Number Conversion.mp4 | 10.9 MB | ||
| 3 - Binary Deca Number Conversion_en.srt | 13.5 KB | ||
| 3 - Binary Search Tree Run Times.mp4 | 13.3 MB | ||
| 3 - Binary Search Tree Run Times_en.srt | 11.9 KB | ||
| 3 - Bubble Sort Coding Example.mp4 | 24.5 MB | ||
| 3 - Bubble Sort Coding Example_en.srt | 17.4 KB | ||
| 3 - Find Max Timing Problem.mp4 | 11.4 MB | ||
| 3 - Find Max Timing Problem_en.srt | 11.8 KB | ||
| 3 - Fixed Array Run Times.mp4 | 23.9 MB | ||
| 3 - Fixed Array Run Times_en.srt | 20.8 KB | ||
| 3 - Graph Terminology.mp4 | 21.1 MB | ||
| 3 - Graph Terminology_en.srt | 19 KB | ||
| 3 - Heaps Real World Examples.mp4 | 9.5 MB | ||
| 3 - Heaps Real World Examples_en.srt | 11.9 KB | ||
| 3 - Linked List Run Times.mp4 | 35.5 MB | ||
| 3 - Linked List Run Times_en.srt | 20.2 KB | ||
| 3 - Math Refresher Logarithmic Functions.mp4 | 16.6 MB | ||
| 3 - Math Refresher Logarithmic Functions_en.srt | 18.9 KB | ||
| 3 - Stack Code Example.mp4 | 17.1 MB | ||
| 3 - Stack Code Example_en.srt | 12.5 KB | ||
| 4 - Binary Number System Notes.html | 6.6 KB | ||
| 4 - Binary Search Algorithm (Fixed Array Sorted Search).mp4 | 18.6 MB | ||
| 4 - Binary Search Algorithm (Fixed Array Sorted Search)_en.srt | 16.1 KB | ||
| 4 - Bonus Lecture.html | 1.2 KB | ||
| 4 - Bubble Sort Notes.html | 3.3 KB | ||
| 4 - Graph Terminology Summary.html | 1.5 KB | ||
| 4 - Heap Notes.html | 3.3 KB | ||
| 4 - Math Refresher Factorial Functions.mp4 | 4.5 MB | ||
| 4 - Math Refresher Factorial Functions_en.srt | 5.5 KB | ||
| 4 - Singly Linked-List Code Example.mp4 | 23.4 MB | ||
| 4 - Singly Linked-List Code Example_en.srt | 15 KB | ||
| 4 - Stack Notes.html | 3.6 KB | ||
| 4 - Tree Code Example.mp4 | 32.4 MB | ||
| 4 - Tree Code Example_en.srt | 20.4 KB | ||
| 5 - Depth First Search.mp4 | 11 MB | ||
| 5 - Depth First Search_en.srt | 10.1 KB | ||
| 5 - Fixed Array Notes.html | 3.2 KB | ||
| 5 - Math Refresher Algebraic Expressions.mp4 | 3.8 MB | ||
| 5 - Math Refresher Algebraic Expressions_en.srt | 4.2 KB | ||
| 5 - Queues.mp4 | 12.1 MB | ||
| 5 - Queues_en.srt | 13.7 KB | ||
| 5 - Selection Sort.mp4 | 12.5 MB | ||
| 5 - Selection Sort_en.srt | 16 KB | ||
| 5 - Singly-Linked List Notes.html | 3.7 KB | ||
| 5 - Tree Notes.html | 5 KB | ||
| 6 - Breadth First Search.mp4 | 12 MB | ||
| 6 - Breadth First Search_en.srt | 9.7 KB | ||
| 6 - Circular Array Intro + Modulo.mp4 | 9 MB | ||
| 6 - Circular Array Intro + Modulo_en.srt | 7.3 KB | ||
| 6 - Doubly Linked Lists.mp4 | 28.3 MB | ||
| 6 - Doubly Linked Lists_en.srt | 12.4 KB | ||
| 6 - Math Refresher Notes.html | 5.6 KB | ||
| 6 - Queue Examples.mp4 | 31.3 MB | ||
| 6 - Queue Examples_en.srt | 14.5 KB | ||
| 6 - Selection Sort Code Example.mp4 | 37.9 MB | ||
| 6 - Selection Sort Code Example_en.srt | 22.1 KB | ||
| 6 - Tree Traversals.mp4 | 25.8 MB | ||
| 6 - Tree Traversals_en.srt | 19.9 KB | ||
| 7 - BFS and DFS Run Times.mp4 | 5.7 MB | ||
| 7 - BFS and DFS Run Times_en.srt | 4.8 KB | ||
| 7 - Circular Array Deep Dive.mp4 | 27.2 MB | ||
| 7 - Circular Array Deep Dive_en.srt | 12.5 KB | ||
| 7 - Queue Code Example.mp4 | 25.4 MB | ||
| 7 - Queue Code Example_en.srt | 11.2 KB | ||
| 7 - Queue Code Example_en.vtt | 12.1 KB | ||
| 7 - Selection Sort Notes.html | 3.8 KB | ||
| 7 - Tail Pointers.mp4 | 8.2 MB | ||
| 7 - Tail Pointers_en.srt | 8.3 KB | ||
| 7 - Tree Real World Examples.mp4 | 7.9 MB | ||
| 7 - Tree Real World Examples_en.srt | 7.3 KB | ||
| 7 - n-notation Introduction.mp4 | 14 MB | ||
| 7 - n-notation Introduction_en.srt | 15.8 KB | ||
| 8 - Circular Array Code Example.mp4 | 5.5 MB | ||
| 8 - Circular Array Code Example_en.srt | 5.3 KB | ||
| 8 - Doubly-Linked List and Tail Pointer Notes.html | 4.8 KB | ||
| 8 - Insertion Sort.mp4 | 11.6 MB | ||
| 8 - Insertion Sort_en.srt | 14.1 KB | ||
| 8 - Queue Notes.html | 3.5 KB | ||
| 8 - n-notation Scaling.mp4 | 23.9 MB | ||
| 8 - n-notation Scaling_en.srt | 20.3 KB | ||
| 9 - Dynamic Arrays.mp4 | 46.5 MB | ||
| 9 - Dynamic Arrays_en.srt | 24.6 KB | ||
| 9 - Insertion Sort Notes.html | 3.4 KB | ||
| 9 - Linked List Real World Examples.mp4 | 4.8 MB | ||
| 9 - Linked List Real World Examples_en.srt | 5.3 KB | ||
| 9 - Queue and Stack Run Times.mp4 | 13.1 MB | ||
| 9 - Queue and Stack Run Times_en.srt | 8.7 KB | ||
| 9 - n-notation Example.mp4 | 21.6 MB | ||
| 9 - n-notation Example_en.srt | 6.7 KB | ||
| Bonus Resources.txt | 307.2 B | ||
| Get Bonus Downloads Here.url | 204.8 B | ||
| ▲ 172 total files | |||
Computer Science 101: Master the Theory Behind Programming
https://TutPig.com
MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz
Language: English | Size: 1.29 GB | Duration: 10h 56m
Computer Science 101: Learn Computer Science to become a better Programmer and Software Engineer.
What you'll learn
Understand the Fundamental Theories of Algorithm Analysis
Be able to Compare Various Algorithms
Understand When to use Different Data Structures and Algorithms
Understand the Fundamentals of Computer Science theory
Understand the Core Sorting Algorithms
A Willingness to Learn New Topics!
No Prior Experience or Knowledge is Needed!
Description
Master the Theory to Becoming a Good Programmer!
If you're looking to learn the theory that makes great programmers, you've come to the right place! This course is perfect for anyone interested in learning the fundamentals to Computer Science Theory.
No Previous Experience Necessary!
| torrent name | size | uploader | age | seed | leech |
|---|---|---|---|---|---|
| 1.3 GB | JackieALF | 1 month | 16 | 1 | |
| 2.2 GB | freecoursewb | 2 months | 0 | 0 | |
| 1.3 GB | freecoursewb | 2 months | 0 | 0 | |
| 579.4 MB | freecoursewb | 3 months | 8 | 3 | |
| 1.8 GB | freecoursewb | 5 months | 6 | 5 |
All Comments