Computer programming is a process that leads from an original formulation of a computing problem to executable computer programs, although to some people it is somewhat a complicated subject. This course will set you on your path to the computer programming field to succeed and become an expert computer programmer.
The Diploma in Computer Programming course will familiarise you with the concepts and terminology of software development and explains the entire idea of programming. You’ll gain the skills needed to write and design a program, understand computer programming, operating systems, database and web technology in an easy-to-grasp method.
Once you finish this course successfully, you’ll have the opportunity to choose a professional option of your choice. Therefore, register immediately and discover what else is in the course.
The course is delivered through our online learning platform, accessible through any internet-connected device. There are no formal deadlines or teaching schedules, meaning you are free to study the course at your own pace.
You are taught through a combination of
To successfully complete the course you must pass an automated, multiple-choice assessment. The assessment is delivered through our online learning platform. You will receive the results of your assessment immediately upon completion.
Upon successful completion, you will qualify for the UK and internationally-recognised certificate and you can choose to make your achievement formal by obtaining your PDF Certificate at a cost of £9 and Hardcopy Certificate for £15.
Whether you’re an existing practitioner or aspiring professional, this course will enhance your expertise and boost your CV with key skills and an accredited qualification attesting to your knowledge.
The Diploma in Computer Programming is open to all, with no formal entry requirements. All you need is a passion for learning, a good understanding of the English language, numeracy and IT, and to be over the age of 16.
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 Part 02 | 00:03:00 | ||
Math Refresher Algebraic Expressions.TS Part 03 | 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 Introduction | 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:00: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 |
No Reviews found for this course.