Overview
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.
Who is this course for?
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.
Requirements
Our Computer Science 101 is open to all from all academic backgrounds and there is no specific requirements to attend this course. It is compatible and accessible from any device including Windows, Mac, Android, iOS, Tablets etc.
CPD Certificate from Course Gate
At the successful completion of the course, you can obtain your CPD certificate from us. You can order the PDF certificate for £9 and the hard copy for £15. Also, you can order both PDF and hardcopy certificates for £22.
Career path
This course opens a new door for you to enter the relevant job market and also gives you the opportunity to acquire extensive knowledge along with required skills to become successful. You will be able to add our qualification to your CV/resume which will help you to stand out in the competitive job industry.
Course Curriculum
Introduction | |||
Kurt Anderson – Promo | 00:02:00 | ||
Introduction | 00:01:00 | ||
Binary System | 00:11:00 | ||
Analyzing Algorithms | |||
Complexity Introduction | 00:02:00 | ||
Math Refresher Factorial Functions.TS | 00:03:00 | ||
Math Refresher Factorial Functions.TS | 00:03:00 | ||
Math Refresher Algebraic Expressions.TS | 00:03:00 | ||
n-notation | 00:18:00 | ||
Big O | 00:13:00 | ||
Big O Real World Example | 00:10:00 | ||
Arrays | |||
How is Data Stored | 00:09:00 | ||
Fixed Arrays | 00:20:00 | ||
Circular Arrays | 00:08:00 | ||
Dynamic Arrays | 00:16:00 | ||
Array Review | 00:08:00 | ||
Array Real World Examples | 00:06:00 | ||
Linked Lists | |||
Nodes | 00:04:00 | ||
Linked List | 00:14:00 | ||
Linked List Run Times | 00:15:00 | ||
Doubly Linked Lists | 00:08:00 | ||
Tail Pointer | 00:05:00 | ||
Linked List Real World Examples | 00:03:00 | ||
Linked List Review | 00:04:00 | ||
Stacks and Queues | |||
Stacks | 00:10:00 | ||
Stack Example | 00:11:00 | ||
Queues | 00:09:00 | ||
Queue Examples | 00:10:00 | ||
Queue and Stack Run Times | 00:06:00 | ||
Stack and Queues Real World Examples | 00:07:00 | ||
Sorting Algorithms | |||
Sorting Algorithm Introdcution | 00:02:00 | ||
Bubble Sort | 00:10:00 | ||
Selection Sort | 00:10:00 | ||
Insertion Sort | 00:09:00 | ||
Quick Sort | 00:15:00 | ||
Quick Sort Run Times | 00:10:00 | ||
Merge Sort | 00:12:00 | ||
Merge Sort Run Times | 00:08:00 | ||
Stable vs Nonstable | 00:07:00 | ||
Sorting Algorithm Real World Examples | 00:04:00 | ||
Trees | |||
Basics of Trees | 00:08:00 | ||
Binary Search Tree | 00:09:00 | ||
BST Run Times | 00:08:00 | ||
Tree Traversals | 00:13:00 | ||
Tree Real World Examples | 00:05:00 | ||
Heaps | |||
Heap Introduction | 00:04:00 | ||
Heap Step by Step | 00:12:00 | ||
Heap Real World Examples | 00:07:00 | ||
Conclusion | |||
Thank You | 00:01:00 | ||
Certificate and Transcript | |||
Order Your Certificates or Transcripts | 00:00:00 |
Course Reviews
No Reviews found for this course.