Learn Data Structures using C in Arabic – for beginners

Learn Data Structures using C in Arabic – for beginners, available at $19.99, has an average rating of 4.7, with 41 lectures, based on 5 reviews, and has 406 subscribers.

You will learn about 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 This course is ideal for individuals who are Computer science students. or Those who want to learn data structures using C language. or Those who want to learn the concept and idea of data structures regardless the language. It is particularly useful for Computer science students. or Those who want to learn data structures using C language. or Those who want to learn the concept and idea of data structures regardless the language.

Enroll now: Learn Data Structures using C in Arabic – for beginners

Summary

Title: Learn Data Structures using C in Arabic – for beginners

Price: $19.99

Average Rating: 4.7

Number of Lectures: 41

Number of Published Lectures: 41

Number of Curriculum Items: 41

Number of Published Curriculum Objects: 41

Original Price: $19.99

Quality Status: approved

Status: Live

What You Will 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

Who Should Attend

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.

Target Audiences

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.

In this course, you will learn Data structures using C in Arabic!

[The course recording is not finished yet.]

The content of the course as in sections and videos;

01: Introduction.

02: Time complexity.

03:

1- Abstract Data Types (ADT) and encapsulation.

2- User and implementation files creation.

04:

1- Stack – Idea & applications.

2- Array-based stack – idea.

3- Array-based stack – implementation.

4- Challenge.

5- Task.

05:

1- Queue – Idea & applications.

2- Array-based queue – Idea.

3- Array-based queue – implementation.

4- Challenge.

5- Task.

06:

1- List – Idea & applications.

2- Array-based list – idea.

3- Linked-based list – idea.

4- Linked-based list – implementation.

5- Challenge.

6- Task.

07:

1- Linked-based stack – idea.

2- Linked-based stack – implementation.

08:

1- Linked-based queue – idea.

2- Linked-based queue – implementation.

09: Revision.

10:

1- Tree – idea & applications.

2- Binary Search Tree (BST).

3- Binary Search Tree – implementation.

11:

1- Dictionaries.

2- AVL.

3- Hashing.

4- Hash table.

12: Graphs.

13: Revision.

14: What’s next.

=============

Notes:

If you want to learn data structures using C, you need to know the C language important topics like pointers and struct. And if you want to learn the concepts of data structures regardless the language, you are welcome, you will know the idea of each data structure, when, where and why to use it.

To get the most benefit from the course, please watch the videos, read the external resources, think and try to solve the challenges and tasks.

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction

Chapter 2: [Exclusive & temp] Summer 23' Online Camp recording

Lecture 1: Day 1

Lecture 2: Day 2 – Task 1 review

Lecture 3: Day 2 – Session

Lecture 4: Day 3

Lecture 5: Day 4

Lecture 6: Day 5

Lecture 7: Day 6

Lecture 8: Day 7

Chapter 3: Time complexity

Lecture 1: Time complexity

Chapter 4: ADT & Encapsulation

Lecture 1: ADT & Encapsulation

Lecture 2: User & implementation files creation

Chapter 5: Stack – Part 1

Lecture 1: Stack – Idea & Applications

Lecture 2: Array-based Stack – Idea

Lecture 3: Array-based Stack – Implementation

Chapter 6: Queue – Part 1

Lecture 1: Queue – Idea

Lecture 2: Queue – Applications

Lecture 3: Queue – Variations

Lecture 4: Array-based Queue – Idea

Lecture 5: Array-based Queue – Implementation

Lecture 6: Array-based Queue – Implementation Cont.

Lecture 7: Array-based Queue – Implementation Cont.

Lecture 8: Array-based Queue – Challenge

Lecture 9: Array-based Queue – Task

Chapter 7: Dictionaries, AVL & Hashing

Lecture 1: Dictionaries

Lecture 2: AVL tree

Lecture 3: Hashing

Lecture 4: Hash tables

Lecture 5: Hash table – insertion

Lecture 6: Hash table – collision handling

Lecture 7: Hash table – search and deletion

Chapter 8: Graph

Lecture 1: Graph usage

Lecture 2: Graph components

Lecture 3: Directed VS undirected graph

Lecture 4: Weighted VS unweighted graph

Lecture 5: Successor and predecessor vertices

Lecture 6: Cyclic VS acyclic graph

Lecture 7: Adjacent vertices

Lecture 8: Simple path & simple cycle

Lecture 9: Types of graph

Lecture 10: Task

Instructors

CS Empire
Technical training
Ahmed Hatem
Programming instructor

Rating Distribution

1 stars: 0 votes
2 stars: 0 votes
3 stars: 0 votes
4 stars: 3 votes
5 stars: 2 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!

Menu