Computer Science 101: Master the Theory Behind Programming

Computer Science 101: Learn Computer Science to become a better Programmer and Software Engineer.

  • 0.0 (0 Reviews)
  • 0 Students
  • 112 Lessons
  • Kurt Anderson

Course Overview

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! 

Computer science and technology are often thought of as things only for "analytical minds". I believe however that technology and it's theory are for everyone. So I designed this course to teach each topic in a variety of easy to digest ways. Through these multiple reinforcing steps, I believe anyone can follow along and succeed! 

Why is the Theory of Programming Important? 

Understanding Computer Science theory is what sets apart Great programmers from average ones. Programming theory is something that transcends a single programming language. It gives you skills and techniques you can apply to any programming language you touch. Learning the theory behind programming is just as important, if not more important than learning a singular programming language like Java or C++.

Programming is all about problem solving. Analyzing a problem, and being able to figure out a way that a computer can help with that problem. Computer Science is the practice of this analysis process. It goes over the techniques and knowledge necessary to design efficient and sustainable code. 

So if you want to begin setting yourself apart from the average programmers, this is the course for you! 

Enroll Now and you'll Learn: 

  • Binary Number System

  • N Notation

  • Big O Notation

  • How to Analyze a Program

  • Arrays and their Advantages

  • Nodes and their Importance

  • Linked Lists and their Advantages and Implementations

  • Stacks implemented with Arrays and Linked Lists

  • Queues Implemented with Arrays and Linked Lists

  • Various Sorting Algorithms and Their Comparisions

  • Trees and Binary Search Trees

  • And Much Much More! 

My Guarantee

I am so confident you will enjoy this course, I offer a 100% 30-day money-back guarantee through Udemy. If you are not happy with your purchase, I have no problem with giving your money back! 

Are You Ready to Get Started? 

I will be waiting for you inside the course! 

Remember, this is an online course, so you can take it at your own pace. Are you busy right now? That's okay. Enroll today, and take the course at your own pace.

Thanks so much for your interest in this Computer Science 101 Course! 

See you inside!

Kurt


See more

FAQ

FAQ area empty

Course curriculum

12 chương 112 bài học 11 giờ 3 phút 7 bài học thử miễn phí
Chương 1 Introduction
Chương 2 Analyzing Algorithms
Chương 3 Arrays
  • How is Data Stored? 8:05
  • Fixed Array Introduction 5:09
  • Fixed Array Run Times 12:23
  • Binary Search Algorithm (Fixed Array Sorted Search) 9:59
  • Fixed Array Notes
  • Circular Array Intro + Modulo 4:59
  • Circular Array Deep Dive 9:03
  • Circular Array Code Example 3:25
  • Dynamic Arrays 15:51
  • O(1) Approximation 12:07
  • Circular and Dynamic Array Notes
  • Array Review 7:57
  • Array Real World + Code Examples 5:42
  • Array Quiz
Chương 4 Linked Lists
  • Nodes 3:41
  • Singly Linked List 13:36
  • Linked List Run Times 12:46
  • Singly Linked-List Code Example 9:29
  • Singly-Linked List Notes
  • Doubly Linked Lists 8:07
  • Tail Pointers 5:14
  • Doubly-Linked List and Tail Pointer Notes
  • Linked List Real World Examples 3:00
  • Linked List Review 3:31
  • Linked Lists
Chương 5 Stacks and Queues
  • Stacks 9:41
  • Stack Examples 11:05
  • Stack Code Example 7:46
  • Stack Notes
  • Queues 8:48
  • Queue Examples 9:42
  • Queue Code Example 9:12
  • Queue Notes
  • Queue and Stack Run Times 6:03
  • Stack and Queue Real World Examples 7:01
  • Stacks and Queues Quiz
  • Stacks and Queues Quiz Explanation 5:33
Chương 6 Sorting Algorithms
  • Introduction to Sorting Algorithms 1:40
  • Bubble Sort 10:12
  • Bubble Sort Coding Example 11:02
  • Bubble Sort Notes
  • Selection Sort 9:49
  • Selection Sort Code Example 14:07
  • Selection Sort Notes
  • Bubble Sort and Selection Sort Quiz
  • Insertion Sort 9:03
  • Insertion Sort Notes
  • Recursion 10:32
  • Quick Sort 14:38
  • Quick Sort Run Time 10:31
  • Quick Sort Notes
  • Quick Sort Code Example 10:08
  • Insertion Sort and Quick Sort Quiz
  • Merge Sort 11:57
  • Merge Sort Run Times 7:39
  • Merge Sort Notes
  • Merge Sort Code Example 12:18
  • Stable vs NonStable 6:34
  • Stable Vs NonStable Notes
  • Merge Sort and Stability Quiz
  • Sorting Algorithm Real World Examples 4:01
Chương 7 Trees
  • Trees 7:37
  • Binary Search Trees 8:34
  • Binary Search Tree Run Times 7:36
  • Tree Code Example 13:01
  • Tree Notes
  • Tree Quiz
  • Tree Traversals 13:04
  • Tree Real World Examples 4:29
Chương 8 Heaps
  • Heaps Introduction 4:07
  • Heap Analysis 11:34
  • Heaps Real World Examples 6:58
  • Heap Notes
Chương 9 Graphs
  • Introduction to Graphs 3:17
  • Basic Types of Graphs 10:27
  • Graph Terminology 11:40
  • Graph Terminology Summary
  • Depth First Search 6:36
  • Breadth First Search 6:40
  • BFS and DFS Run Times 3:12
Chương 10 Hashing
  • Hashing Overview 8:39
  • Hash Table Overview 9:04
  • Linear Probing 4:43
  • Quadratic Probing 5:26
  • Rehashing 6:50
  • Closed Addressing 3:11
  • Real World Hash Table 4:28
  • Encryption vs Hashing 9:13
  • Hashing Notes
Chương 11 Conclusion
  • Thank You! 1:07
Chương 12 Bonus
  • Binary to Hex and Back 11:05
  • Decimal to Hex and Back 11:19
  • Find Max Timing Problem 6:47
  • Bonus Lecture

Requirment

  • A Willingness to Learn New Topics!

  • No Prior Experience or Knowledge is Needed!

Outcomes

  • 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

Instructor

...
Kurt Anderson

0.0

  • ... 0 Student
  • ... 1 Course
  • ... 0 review

View Details

Reviews

Rate this course :

Remove all