Data Structure

Fundamentals of Data Structures and Algorithms

4.7(95)4h 56m16 lectures2 sections

What you'll learn

  • Understand basic data structure types
  • Understand expressions and their conversions
  • Learn to build dynamic lists
  • Implement algorithms using stacks
  • Implement algorithms using queues
  • Master algorithms related to data

About this course

The Data Structures course is an educational program aimed at teaching students the fundamentals of data structures and their associated algorithms. The course covers a variety of structures such as linked lists, trees, arrays, and graphs, explaining how to implement these structures and perform basic operations like searching, inserting, and deleting. It aims to equip students with the skills needed to understand and analyze problems and select appropriate data structures to solve them efficiently. By applying the concepts and skills acquired, students can develop effective software programs and improve application performance. Understanding data structures is crucial for software developers and computer engineers across many fields, providing a strong foundation for building computational and analytical thinking and programming skills.

Expected outcomes

  • Master the fundamental concepts of data structures.
  • Implement algorithms using various data structures.
  • Understand how to optimize program performance using appropriate data structures.
  • Use the C programming language to apply the acquired concepts and algorithms.

تقييمات المتدربين

التقييمات هنا من المتدربين الذين اشتروا الدورة وأكملوا50٪من المحتوى على الأقل — لا توجد تقييمات من شخص لم يطلع على المحتوى.
4.7
★★★★★
95 تقييم
5★
67
4★
27
3★
1
2★
0
1★
0
    كن جزءا من تقييمات هذه الدورة

    كل تقييم هنا يساعد متدربا جديدا على الاختيار — شاركنا تجربتك بعد إكمال الدورة.

    Course content

    1

    Data Structure

    15 lectures
    1. Introduction5:05
    2. Data Structures Relationship with Algorithm Design and Programming22:41
    3. Types of Data Structures23:44
    4. Non-Primitive Data Structures (Linear and Non-Linear)24:36
    5. Infix/Prefix/Postfix Expression Representation Concepts23:53
    6. How to Use Stack to Convert from Infix to Postfix24:26
    7. Non-Linear Data Structures19:02
    8. Static and Dynamic Data Structures (Part One)10:48
    9. Static and Dynamic Data Structures (Part Two)21:15
    10. Deep Dive into the Stack Concept27:46
    11. Basic Operations Algorithms for the Stack16:44
    12. Comprehensive Example in C on the Stack13:58
    13. Practical Implementation of Comprehensive Stack Code for Different Cases13:34
    14. Understanding the Queue and How Its Indicators Work25:20
    15. Basic Operations Algorithms for the Queue23:24
    2

    Add-ons

    1 attachments
    1. Download the Workbook

    Instructor

    Dr. Eng. Mohamed Al-Khodour

    Dr. Eng. Mohamed Al-Khodour

    PhD in Communication Engineering with several published research papers in peer-reviewed journals. Lecturer and trainer in computer science.
    2,214 students5 courses