Problems, Algorithms and Flowcharts

Beginner Level
8 hours to complete 3 weeks at 2 hours a week
Flexible Schedule

Robert Zimmer

What You’ll Learn

In this course you will learn the history of algorithms, discretisation and pseudocode and Euclidean algorithm in pseudocode.

Skills You’ll Gain

Program Development Pseudocode Computer Science Algorithms Data Structures Computational Thinking

Shareable Certificate

Earn a shareable certificate to add to your LinkedIn profile.

Develop Your Specialized Knowledge

Learn new concepts from industry experts

Gain a foundational understanding of a subject or tool

Develop job-relevant skills with hands-on projects

Earn a shareable career certificate

There are 4 modules in this course

This week, we will cover three key concepts: problems in computer science (CS), algorithms in CS, and flowcharts.

This week, we will continue covering the three key concepts: problems in computer science (CS), algorithms in CS, and flowcharts.

This week, we will cover three key concepts: pseudocode, iteration and conversion from flowcharts to pseudocode.

This week, we will continue covering three key concepts: pseudocode, iteration and conversion from flowcharts to pseudocode.