Home / Academy / Core Programming Logic
Course Overview

What You Will Learn

This class builds the fundamental mental framework for solving problems through code. Moving beyond specific syntax, students focus on computational thinking—learning to break down complex tasks, design step-by-step algorithms, and control program flow using loops, conditionals, variables, and functions. Emphasis is placed on logic, debugging, and structured reasoning to create efficient, error-free solutions. Ideal for beginners, this course serves as the essential gateway to mastering any programming language.

Program Curriculum

Course Content

Explore the full learning path section by section and preview what is included in this program.

What is Programming?
Preview Text
Why Programming Logic Matters
Text
Locked
Computational Thinking Basics
Text
Locked
From Real-World Problem to Program
Text
Locked
Problem-Solving in Programming
Text
Locked
What is Pseudocode?
Text
Locked
Writing Clear Pseudocode
Text
Locked
What is an Algorithm?
Text
Locked
Flowcharts and Visual Logic Design
Text
Locked
Comparing Pseudocode and Flowcharts
Text
Locked
Variables and Stored Values
Text
Locked
Constants and Fixed Values
Text
Locked
Expressions and Operators
Text
Locked
Assignment and State Changes
Text
Locked
Input, Output, and Data Flow
Text
Locked
What is Conditional Logic?
Text
Locked
if, elif, else Structures
Text
Locked
Nested Conditions
Text
Locked
Switch and Match Style Logic
Text
Locked
Truth Tables and Boolean Thinking
Text
Locked
Why Loops Matter
Text
Locked
for Loops
Text
Locked
while Loops
Text
Locked
Nested Loops
Text
Locked
Loop Control – break, continue, and flow control
Text
Locked
Common Loop Mistakes
Text
Locked
What is a Function?
Text
Locked
Parameters and Arguments
Text
Locked
Return Values
Text
Locked
Scope – Local vs Global Thinking
Text
Locked
Function Design and Reusability
Text
Locked
Why Data Structures Matter
Text
Locked
Lists and Arrays
Text
Locked
Tuples and Immutable Collections
Text
Locked
Sets and Uniqueness
Text
Locked
Dictionaries and Key-Value Thinking
Text
Locked
Choosing the Right Data Structure
Text
Locked
Stack Concept
Text
Locked
Queue Concept
Text
Locked
Linked List Concept
Text
Locked
Comparing Stack, Queue, and Linked List
Text
Locked
What is Searching in Programming?
Text
Locked
Linear Search
Text
Locked
Binary Search
Text
Locked
What is Sorting?
Text
Locked
Bubble Sort and Insertion Sort
Text
Locked
Merge Sort and Quick Sort
Text
Locked
Comparing Searching and Sorting Strategies
Text
Locked
What is Big-O Notation?
Text
Locked
O(1), O(n), and O(n²)
Text
Locked
Why Time Complexity Matters
Text
Locked
Iteration – Solving Problems with Loops
Text
Locked
Recursion – Functions Calling Themselves
Text
Locked
Recursion vs Iteration
Text
Locked
Memory Management Basics
Text
Locked
References and Mutability
Text
Locked
Stack vs Heap Thinking
Text
Locked
Syntax Errors vs Logic Errors
Text
Locked
Debugging Strategies
Text
Locked
Using Print, Trace, and Step-by-Step Reasoning
Text
Locked
What is Logging?
Text
Locked
Log Levels and Their Meaning
Text
Locked
What is Tracing?
Text
Locked
Logging vs Tracing
Text
Locked
Using Logging for Debugging and Monitoring
Text
Locked
Core Programming Logic Wrap-Up
Text
Locked
Core Programming Logic

Core Programming Logic

$25.00
Not enrolled
Category Software Engineering
Instructor Filimon Shferaw
Lessons 12 Sections
Instructors

Meet the Instructor

  • Filimon Shferaw
    Senior Software Engineer