🔧

Intermediate C Concepts

Take your C skills to the next level with dynamic memory allocation, structs, unions, function pointers, and error handling techniques.

9 ArticlesIntermediate100% Free

Course Content

9 lessons

Mastering Error Handling Techniques in C - Intermediate C Concepts Part 8

Learn essential error handling techniques in C to write robust and reliable software. This detailed guide covers return codes, the errno variable, perror(), assertions, and best practices for gracefully managing errors in your C programs.

Function Pointers in C - Intermediate C Concepts Part 7

C programming with function pointers! This comprehensive guide explains how to declare, assign, and use function pointers to create flexible and dynamic code, including practical examples and use cases like callbacks.

Bitwise Operations (Low-Level Manipulation) in C Intermediate C Concepts Part 6

Bitwise operations in C. This detailed guide covers AND, OR, XOR, NOT, left shift, and right shift operators, along with practical use cases for efficient low-level programming.

Graphs Implementation and Algorithms in C Intermediate C Concepts Part 5

Explore the Graph data structures in C. Learn key terminology, understand different representations like Adjacency Matrices and Adjacency Lists, and master fundamental traversal algorithms: Depth-First Search (DFS) and Breadth-First Search (BFS).

Trees Implementation and Algorithms in C Intermediate C Concepts Part 4

Non-linear data structures with Trees in C. Learn essential terminology, explore Binary Trees and Binary Search Trees (BSTs), master traversal algorithms (DFS, BFS), and implement core BST operations like insertion, search, and deletion.

Implementing Stacks and Queues in C Intermediate C Concepts Part 3

Learn how to implement fundamental Abstract Data Types (ADTs) - Stacks (LIFO) and Queues (FIFO) - in C using both arrays and linked lists. Understand their operations, applications, and trade-offs.

Working with Linked Lists in C Intermediate C Concepts Part 2

Explore the fundamental data structure: the Linked List in C. Learn how to create, insert, delete, traverse, and search nodes using pointers and dynamic memory allocation. Understand the advantages over arrays.

Dynamic Memory Allocation in C Intermediate C Concepts Part 1

Learn about dynamic memory allocation using malloc(), calloc(), realloc(), and free() to manage memory on the heap effectively and avoid common pitfalls like memory leaks.

Intermediate C Concepts: Your Guide to Advanced C Programming

This repository post compiles all the articles in our 'Intermediate C Concepts' series, covering dynamic memory, linked lists, trees, graphs, and more!

Back to All Courses