Chat with us, powered by LiveChat
  • LOGIN
  • No products in the cart.

Diploma in Computer Programming

Diploma in Computer Programming

8 STUDENTS ENROLLED

Introduction

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.

Description

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.

Course design

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

  • Video lessons
  • Online study materials
  • Mock exams
  • Multiple-choice assessment

How is the course assessed?

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.

Will I receive a certificate of completion?

Upon successful completion, you will qualify for the UK and internationally-recognised professional qualification and you can choose to make your achievement formal by obtaining your PDF Certificate at a cost of £9 and Hardcopy Certificate for £15.

Why study this course

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.

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:00: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
Mock Exam
Final Exam

Course Reviews

4.9

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

No Reviews found for this course.

TAKE THIS COURSE

COPYRIGHT © 2018 One Education