Computer Science 101

4.9( 7 REVIEWS )
395 STUDENTS

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.

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
Kurt Anderson – 1 Introduction 00:01:00
Kurt Anderson – 2 Binary System 00:11:00
Analyzing Algorithms
Kurt Anderson – 3 Complexity Introduction 00:02:00
Kurt Anderson – 5 Math Refresher Factorial Functions.TS 00:03:00
Kurt Anderson – 5 Math Refresher Factorial Functions.TS 00:03:00
Kurt Anderson – 6 Math Refresher Algebraic Expressions.TS 00:03:00
Kurt Anderson – 7 n-notation 00:18:00
Kurt Anderson – 8 Big O 00:13:00
Kurt Anderson – 9 Big O Real World Example 00:10:00
Arrays
Kurt Anderson – 10 How is Data Stored 00:09:00
Kurt Anderson – 11 Fixed Arrays 00:20:00
Kurt Anderson – 12 Circular Arrays 00:08:00
Kurt Anderson – 13 Dynamic Arrays 00:16:00
Kurt Anderson – 14 Array Review 00:08:00
Kurt Anderson – 15 Array Real World Examples 00:06:00
Linked Lists
Kurt Anderson – 16 Nodes 00:04:00
Kurt Anderson – 16 Linked List 00:14:00
Kurt Anderson – 17 Linked List Run Times 00:15:00
Kurt Anderson – 18 Doubly Linked Lists 00:08:00
Kurt Anderson – 19 Tail Pointer 00:05:00
Kurt Anderson – 20 Linked List Real World Examples 00:03:00
Kurt Anderson – 21 Linked List Review 00:04:00
Stacks and Queues
Kurt Anderson – 22 Stacks 00:10:00
Kurt Anderson – 20 Stack Example 00:11:00
Kurt Anderson – 23 Queues 00:09:00
Kurt Anderson – 24 Queue Examples 00:10:00
Kurt Anderson – 25 Queue and Stack Run Times 00:06:00
Kurt Anderson – 26 Stack and Queues Real World Examples 00:07:00
Sorting Algorithms
Kurt Anderson – 27 Sorting Algorithm Introdcution 00:02:00
Kurt Anderson – 28 Bubble Sort 00:10:00
Kurt Anderson – 29 Selection Sort 00:10:00
Kurt Anderson – 30 Insertion Sort 00:09:00
Kurt Anderson – 31 Quick Sort 00:15:00
Kurt Anderson – 32 Quick Sort Run Times 00:10:00
Kurt Anderson – 33 Merge Sort 00:12:00
Kurt Anderson – 34 Merge Sort Run Times 00:08:00
Kurt Anderson – 35 Stable vs Nonstable 00:07:00
Kurt Anderson – 36 Sorting Algorithm Real World Examples 00:04:00
Trees
Kurt Anderson – 37 Basics of Trees 00:08:00
Kurt Anderson – 38 Binary Search Tree 00:09:00
Kurt Anderson – 39 BST Run Times 00:08:00
Kurt Anderson – 40 Tree Traversals 00:13:00
Kurt Anderson – 41 Tree Real World Examples 00:05:00
Heaps
Kurt Anderson – 42 Heap Introduction 00:04:00
Kurt Anderson – 43 Heap Step by Step 00:12:00
Kurt Anderson – 44 Heap Real World Examples 00:07:00
Conclusion
Kurt Anderson – 45 Thank You 00:01:00
Assessment
Assignment – Computer Science 101 00:00:00
Course Certification
Order your Certificate 00:00:00

Course Reviews

4.9

4.9
7 ratings
  • 5 stars0
  • 4 stars0
  • 3 stars0
  • 2 stars0
  • 1 stars0

No Reviews found for this course.

TAKE THIS COURSE

Instructors

395 STUDENTS ENROLLED

© Course Gate Edukite Ltd, Reg no: 11378092