Computer Science 101

Learn how to perform a significant task in a computing system with the help of programming and become a renowned programmer through our Computer Science 101 course. The lucid contents of the course will enrich your knowledge to kick-start your career as a professional programmer.

In the beginning, the course guides you with different program theories to analyze, summaries, detect problems, and find the best solution in different ways. Following that, it extracts you the algorithm theories, Number system, and Arrays along with their multiple advantages. Furthermore, studying the contents of the course, you can analyze the problems and make sure an ultimate solution. Finally, it makes you confident to write a program, maintain computer database, find troubleshoot, and become an exponential programmer.

Overall, the course will enrich your ability to mastery over computer science becoming an expert programmer.

Computer Science 101 is suitable for anyone who wants to gain extensive knowledge, potential experience and professional skills in the related field. This course is CPD accredited so you don't have to worry about the quality.

CPD

Introduction:

• Kurt Anderson - Promo
• Kurt Anderson - 1 Introduction
• Kurt Anderson - 2 Binary System

Analyzing Algorithms:

• Kurt Anderson - 3 Complexity Introduction
• Kurt Anderson - 5 Math Refresher Factorial Functions.TS
• Kurt Anderson - 5 Math Refresher Factorial Functions.TS
• Kurt Anderson - 6 Math Refresher Algebraic Expressions.TS
• Kurt Anderson - 7 n-notation
• Kurt Anderson - 8 Big O
• Kurt Anderson - 9 Big O Real World Example

Arrays:

• Kurt Anderson - 10 How is Data Stored
• Kurt Anderson - 11 Fixed Arrays
• Kurt Anderson - 12 Circular Arrays
• Kurt Anderson - 13 Dynamic Arrays
• Kurt Anderson - 14 Array Review
• Kurt Anderson - 15 Array Real World Examples

Linked Lists:

• Kurt Anderson - 16 Nodes
• Kurt Anderson - 16 Linked List
• Kurt Anderson - 17 Linked List Run Times
• Kurt Anderson - 18 Doubly Linked Lists
• Kurt Anderson - 19 Tail Pointer
• Kurt Anderson - 20 Linked List Real World Examples
• Kurt Anderson - 21 Linked List Review

Stacks and Queues:

• Kurt Anderson - 22 Stacks
• Kurt Anderson - 20 Stack Example
• Kurt Anderson - 23 Queues
• Kurt Anderson - 24 Queue Examples
• Kurt Anderson - 25 Queue and Stack Run Times
• Kurt Anderson - 26 Stack and Queues Real World Examples

Sorting Algorithms:

• Kurt Anderson - 27 Sorting Algorithm Introdcution
• Kurt Anderson - 28 Bubble Sort
• Kurt Anderson - 29 Selection Sort
• Kurt Anderson - 30 Insertion Sort
• Kurt Anderson - 31 Quick Sort
• Kurt Anderson - 32 Quick Sort Run Times
• Kurt Anderson - 33 Merge Sort
• Kurt Anderson - 34 Merge Sort Run Times
• Kurt Anderson - 35 Stable vs Nonstable
• Kurt Anderson - 36 Sorting Algorithm Real World Examples

Trees:

• Kurt Anderson - 37 Basics of Trees
• Kurt Anderson - 38 Binary Search Tree
• Kurt Anderson - 39 BST Run Times
• Kurt Anderson - 40 Tree Traversals
• Kurt Anderson - 41 Tree Real World Examples

Heaps:

• Kurt Anderson - 42 Heap Introduction
• Kurt Anderson - 43 Heap Step by Step
• Kurt Anderson - 44 Heap Real World Examples

Conclusion:

• Kurt Anderson - 45 Thank You

What’s the most important thing we could possibly have on our mind? The answer to that is easy: your learning needs. Years ago, we thought about what and how people wish to learn. Since then, we have worked tirelessly to create a platform on which we offer a range of detailed, excellent quality, and competitively priced online courses available to all people irrespective of their geographical location, skills and experience, and learning level and ability. Coursegate is now synonymous with all of this.