Advanced C Programming, Data Structures & Algorithms is a practical continuation of Lite Tech C Programming, Algorithms & Problem Solving. Learners build progressively more complex applications using advanced functions, arrays and strings, pointers and dynamic memory, structures, persistent file processing, searching and sorting algorithms, linked lists, stacks and queues. The course emphasizes practical programming, debugging, laboratories, guided missions, assessments and teacher-reviewed code submissions..
Software
Advanced C Programming, Data Structures & Algorithms
A practical advanced C programming course focused on modular programming, arrays, pointers, dynamic memory, structures, files, searching, sorting and dynamic data structures.
Advanced Functions & Modular Programming 12 lesson(s)
Advanced Function Concepts
Enrolled students
45 minute(s)
Building Programs with Functions
Enrolled students
75 minute(s)
Parameters and Pass by Value
Enrolled students
75 minute(s)
Return Values and Function Composition
Enrolled students
80 minute(s)
Scope, Local and Static Variables
Enrolled students
55 minute(s)
Arrays as Function Arguments
Enrolled students
90 minute(s)
String Processing with Functions
Enrolled students
90 minute(s)
Designing Menu-Driven Applications
Enrolled students
100 minute(s)
Header Files and Multi-File C Programs
Enrolled students
110 minute(s)
Recursion Fundamentals
Enrolled students
60 minute(s)
Recursive Programming Laboratory
Enrolled students
110 minute(s)
Module 1 Practical Project — Modular Sales Analyzer
Enrolled students
150 minute(s)
Advanced Arrays, Strings & Matrix Programming 10 lesson(s)
Advanced One-Dimensional Array Processing
Enrolled students
75 minute(s)
Searching Arrays — Linear and Binary Search
Enrolled students
90 minute(s)
Sorting Arrays — Bubble, Selection and Insertion Sort
Enrolled students
110 minute(s)
Parallel Arrays and Record Processing
Enrolled students
90 minute(s)
Two-Dimensional Arrays and Matrix Representation
Enrolled students
90 minute(s)
Matrix Processing Algorithms
Enrolled students
110 minute(s)
Advanced Character Arrays and Strings
Enrolled students
100 minute(s)
String Searching, Comparison and Manipulation
Enrolled students
100 minute(s)
Frequency Analysis, Duplicates and Array Algorithms
Enrolled students
110 minute(s)
Module 2 Practical Project — Student Result Processing & Analytics System
Enrolled students
180 minute(s)
Pointers & Dynamic Memory Programming 10 lesson(s)
Pointer Fundamentals and Memory Addresses
Enrolled students
90 minute(s)
Dereferencing, Pointer Types and Pointer Safety
Enrolled students
100 minute(s)
Pointer Arithmetic and Arrays
Enrolled students
110 minute(s)
Pointers as Function Arguments
Enrolled students
110 minute(s)
Pointers and Strings
Enrolled students
110 minute(s)
Dynamic Memory with malloc() and calloc()
Enrolled students
130 minute(s)
Resizing Memory with realloc()
Enrolled students
120 minute(s)
Memory Leaks, Dangling Pointers and Safe Deallocation
Enrolled students
120 minute(s)
Dynamic Arrays and Runtime Data Processing
Enrolled students
140 minute(s)
Module 3 Practical Project — Dynamic Student Record Manager
Enrolled students
200 minute(s)
Structures & Record-Based Applications 10 lesson(s)
Introduction to Structures and User-Defined Records
Enrolled students
90 minute(s)
Structure Input, Member Access and Record Validation
Enrolled students
100 minute(s)
Arrays of Structures and Multi-Record Processing
Enrolled students
120 minute(s)
Structures and Functions
Enrolled students
120 minute(s)
Nested Structures and Complex Data Models
Enrolled students
120 minute(s)
Pointers to Structures and the Arrow Operator
Enrolled students
130 minute(s)
Dynamic Arrays of Structures
Enrolled students
150 minute(s)
Searching and Sorting Structure Records
Enrolled students
150 minute(s)
Record Validation and Menu-Driven Applications
Enrolled students
160 minute(s)
Module 4 Practical Project — Academic Record Management System
Enrolled students
240 minute(s)
File Handling & Persistent Applications 10 lesson(s)
Introduction to File Handling and Persistent Data
Enrolled students
100 minute(s)
Opening, Closing and File Access Modes
Enrolled students
110 minute(s)
Writing Text Files with fprintf(), fputs() and fputc()
Enrolled students
120 minute(s)
Reading Text Files with fscanf(), fgets() and EOF Handling
Enrolled students
130 minute(s)
Appending, Updating and Navigating File Content
Enrolled students
140 minute(s)
Binary Files with fread() and fwrite()
Enrolled students
150 minute(s)
Persistent Structure Records and Record Databases
Enrolled students
160 minute(s)
Searching, Updating and Deleting File Records
Enrolled students
170 minute(s)
File Errors, Validation and Recovery Techniques
Enrolled students
160 minute(s)
Module 5 Practical Project — Persistent Student Record Management System
Enrolled students
280 minute(s)
Searching, Sorting & Algorithm Programming 10 lesson(s)
Algorithm Analysis, Dry Runs and Performance Measurement
Enrolled students
110 minute(s)
Linear Search and Sequential Search Techniques
Enrolled students
120 minute(s)
Binary Search and Ordered Data
Enrolled students
140 minute(s)
Bubble Sort and Early-Termination Optimization
Enrolled students
150 minute(s)
Selection Sort and Minimum Selection
Enrolled students
140 minute(s)
Insertion Sort and Incremental Ordering
Enrolled students
150 minute(s)
Comparing Search and Sort Algorithms
Enrolled students
160 minute(s)
Searching and Sorting Structure Records
Enrolled students
170 minute(s)
Algorithm Debugging, Edge Cases and Performance Testing
Enrolled students
170 minute(s)
Module 6 Practical Project — Search & Sort Performance Analyzer
Enrolled students
300 minute(s)
Linked Lists Programming 10 lesson(s)
Introduction to Linked Lists and Dynamic Nodes
Enrolled students
120 minute(s)
Creating Nodes and Managing the Head Pointer
Enrolled students
130 minute(s)
Traversing, Displaying and Counting a Singly Linked List
Enrolled students
130 minute(s)
Inserting Nodes at Beginning, End and Position
Enrolled students
160 minute(s)
Searching and Updating Linked List Nodes
Enrolled students
150 minute(s)
Deleting Nodes Safely from Linked Lists
Enrolled students
170 minute(s)
Reversing, Sorting and Advanced Linked List Operations
Enrolled students
180 minute(s)
Linked Lists with Structure Records
Enrolled students
180 minute(s)
Memory Management, Dangling Links and Linked List Debugging
Enrolled students
190 minute(s)
Module 7 Practical Project — Dynamic Student Linked List Manager
Enrolled students
320 minute(s)
Stacks & Queues Programming 10 lesson(s)
Introduction to Stacks and LIFO Processing
Enrolled students
120 minute(s)
Stack Implementation Using Arrays
Enrolled students
150 minute(s)
Stack Implementation Using Linked Lists
Enrolled students
170 minute(s)
Stack Applications — Reversal, Bracket Matching and Expressions
Enrolled students
180 minute(s)
Introduction to Queues and FIFO Processing
Enrolled students
120 minute(s)
Queue Implementation Using Arrays
Enrolled students
160 minute(s)
Circular Queues and Wraparound Processing
Enrolled students
180 minute(s)
Queue Implementation Using Linked Lists
Enrolled students
180 minute(s)
Stack & Queue Debugging, Applications and Comparisons
Enrolled students
190 minute(s)
Module 8 Practical Project — Task Processing & Service Queue Manager
Enrolled students
340 minute(s)
Related Courses
Continue exploring this learning area.
SOF
FREE
Software
A-Level Computer Science Practical Programming
A laboratory-driven A-Level Computer Science course covering C programming, debugging, expressions, selection,...
SOF
FREE
Software
C Programming, Algorithms & Problem Solving
Professional C programming, algorithms and problem solving for Advanced Level Computer Science, engineering fo...
SOF
FREE
Software
A-Level Computer Science GCE Paper 3 Past Questions & Solutions
A complete GCE Paper 3 preparation course built around genuine past questions, guided solutions, practical wor...