Teach on Udemy

Turn what you know into an opportunity and reach millions around the world.

Learn More

Your cart is empty.

Keep shopping

Learn Data Structures using C in Arabic - for beginners

Name: Learn Data Structures using C in Arabic - for beginners
Rating: 4.7 (14 reviews)

هياكل البيانات باستخدام لغة C

Created byCS Empire, Ahmed Hatem

Last updated 11/2023

English

What you'll learn

Time complexity analysis basics
ADT & Encapsulation idea
Array-based stack
Array-based queue
Array-based list
Linked-based stack
Linked-based queue
Linked-based list
Binary Search Tree (BST)
Dictionaries
AVL trees
Hash tables
Graphs

Course content

8 sections • 41 lectures • 15h 7m total length

Introduction6:19
Master core data structures in C in Arabic for beginners, covering primitive data types, arrays, stacks, queues, linked lists, trees, graphs, and hash tables, with practical insertion and deletion concepts.

Day 12:41:32
Day 2 - Task 1 review21:45
Day 2 - Session51:10
Day 32:04:49
Explore implementing and using linked lists and arrays in C, with insert and delete operations, dynamic memory and pointers, and queue, stack, and sorted/doubly linked list concepts.
Day 41:32:57
Day 51:49:00
Explore stacks, queues, and linked lists in C, including circular queues and memory concepts. Practice insertion and deletion, and understand overflow and underflow conditions.
Day 62:12:14
Day 71:09:27

Queue - Idea1:35
Explore the queue as a linear data structure with front and rear, applying first in, first out, and compare it to a stack's last in, first out.
Queue - Applications3:15
Queue - Variations0:32
Explore variations of queues in data structures, including simple queues, circular queues, priority queues, and a doubly ended priority queue, with focus on length, time, and insertion.
Array-based Queue - Idea5:04
Explore the array-based queue concept and its circular implementation in C, covering front and rear indices, memory layout, and queue operations.
Array-based Queue - Implementation3:34
Array-based Queue - Implementation Cont.6:35
Learn how to implement a circular queue using an array in C, manage the front and rear indices, and apply modulus with the maximum size to control element insertion.
Array-based Queue - Implementation Cont.3:29
Array-based Queue - Challenge6:33
Array-based Queue - Task6:51

Dictionaries3:06
AVL tree1:42
Hashing3:21
Hash tables3:11
Hash table - insertion3:00
Learn how a hash table handles insertion by using a hash function to derive an index, apply modulus with the table size, and place data at the computed slot.
Hash table - collision handling4:22
Learn how hash tables handle collisions using open addressing and chaining with linked lists, covering insertion, deletion, and hash function behavior.
Hash table - search and deletion4:19

Graph usage1:06
Graph components0:27
Explore graph components by identifying vertices, nodes, and edges within a graph, and understand how components define the graph structure.
Directed VS undirected graph1:42
Weighted VS unweighted graph2:18
Explore weighted versus unweighted graphs in data structures, comparing edge costs, nodes, and shortest paths from A to C, and learn how weights influence path selection.
Successor and predecessor vertices1:09
Cyclic VS acyclic graph1:08
Adjacent vertices2:30
Simple path & simple cycle3:38
Types of graph1:05
Task0:47

Requirements

Having a PC / laptop.
Knowledge of C language basics is preferred.
Knowledge of functions, pointers & struct is mandatory.
Knowledge of any programming language logic and concepts.

Description

In this course, you will learn Data Structures using the C programming language, explained step by step in Arabic.

This course focuses on building a strong conceptual understanding of data structures while also providing practical C implementations. It is suitable for learners who want to understand how data structures work internally, when to use them, and why they matter in real-world programming.

Note: The course recording is still in progress, and new content will be added gradually.

What You Will Learn

Core concepts of data structures and their applications
Time complexity and performance analysis
Abstract Data Types (ADT) and encapsulation
Implementation of data structures using C
Practical problem-solving through challenges and tasks

Course Content

Section 01: Introduction

Section 02: Time Complexity

Section 03: Abstract Data Types

Abstract Data Types (ADT) and encapsulation
Creating user and implementation files

Section 04: Stack (Array-Based)

Stack concept and applications
Array-based stack idea
Array-based stack implementation
Challenge
Task

Section 05: Queue (Array-Based)

Queue concept and applications
Array-based queue idea
Array-based queue implementation
Challenge
Task

Section 06: List

List concept and applications
Array-based list idea
Linked-based list idea
Linked-based list implementation
Challenge
Task

Section 07: Stack (Linked-Based)

Linked-based stack idea
Linked-based stack implementation

Section 08: Queue (Linked-Based)

Linked-based queue idea
Linked-based queue implementation

Section 09: Revision

Section 10: Trees

Tree concept and applications
Binary Search Tree (BST)
Binary Search Tree implementation

Section 11: Advanced Data Structures

Dictionaries
AVL Trees
Hashing
Hash Tables

Section 12: Graphs

Section 13: Revision

Section 14: What’s Next

Prerequisites

Basic knowledge of the C programming language
Understanding of pointers and structures is recommended

If your goal is to learn data structures concepts regardless of the programming language, you are still welcome. This course explains the idea behind each data structure, when to use it, where it fits, and why it is important.

How to Get the Most Out of This Course

To maximize your learning experience:

Watch the videos carefully
Read the provided external resources
Think deeply about the concepts
Try to solve the challenges and tasks on your own

Who this course is for:

Computer science students.
Those who want to learn data structures using C language.
Those who want to learn the concept and idea of data structures regardless the language.

Learn Data Structures using C in Arabic - for beginners

What you'll learn

Explore related topics

Course content

Introduction1 lecture • 6min

[Exclusive & temp] Summer 23' Online Camp recording8 lectures • 12hr 43min

Time complexity1 lecture • 8min

ADT & Encapsulation2 lectures • 20min

Stack - Part 13 lectures • 33min

Queue - Part 19 lectures • 37min

Dictionaries, AVL & Hashing7 lectures • 23min

Graph10 lectures • 16min

Requirements

Description

Who this course is for: