Description

The Computer Science and Programming Diploma course covers the fundamental theories of Algorithm Analysis. If you want to explore the concepts and methods that make a good programmer, then the course is designed for you.

Programming is all about how to solve a problem. Programming theory is not confined to a single language; rather it applies to all programming languages. By understanding the right programming theory, you will be able to analyse a problem and also able to find out the probable solution.

The course teaches you these Programming theories covering Algorithm analysis, Binary Number System, Arrays and their Advantages, the process of analysing a problem, Nodes and their Importance, various sorting algorithms and their comparisons, and more.

Upon completion, you will be able to understand the core theories of computer science.

What Will I 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

Requirements

A Willingness to Learn New Topics!

No Prior Experience or Knowledge is Needed!

Module: 01
	Kurt Anderson - 1 Introduction	FREE	00:01:00
	Kurt Anderson - 2 Binary System	FREE	00:11:00
	Kurt Anderson - 3 Complexity Introduction		00:02:00
	Kurt Anderson - 4 Math Refresher Logarithmic Functions		00:11:00
	Kurt Anderson - 5 Math Refresher Factorial Functions.TS 007		00:03:00
	Kurt Anderson - 6 Math Refresher Algebraic Expressions.TS		00:03:00
	Kurt Anderson - 7 n-notation		00:19:00
	Kurt Anderson - 8 Big O		00:13:00
	Kurt Anderson - 9 Big O Real World Example		00:10:00
Module: 02
	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
	Kurt Anderson - 16 Linked List		00:12:00
	Kurt Anderson - 16 Nodes		00:04: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
Module: 03
	Kurt Anderson - 20 Linked List Real World Examples		00:03:00
	Kurt Anderson - 20 Stack Example		00:11:00
	Kurt Anderson - 21 Linked List Review		00:04:00
	Kurt Anderson - 22 Stacks		00:10: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
	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
Module: 04
	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
	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
Module: 05
	Kurt Anderson - 40 Tree Traversals		00:13:00
	Kurt Anderson - 41 Tree Real World Examples		00:05:00
	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
	Kurt Anderson - 45 Thank You		00:01:00

Course Images

Computer Science and Programming Diploma

By iStudy UK

Booking options

Highlights

Description

About The Provider

Tags

Reviews