
Overview
Overview
وصف المقرر:
في هذا المقرر ستتعلم أساسيات تصميم الهياكل البرمجية المختلفة لتنظيم البيانات وتحليل الخوارزميات.
يركز المقرر على تزويدك بالمهارات العملية التي تساعدك في اختيار التركيب والخوارزمية المثلى لحل المشكلات البرمجية بكفاءة.
يتم تقديم المحتوى بأسلوب واضح مع أمثلة عملية تسهل الفهم والتطبيق.
عند الاشتراك في هذا المقرر سوف تحصل على:
- ستصبح جزءًا من مجتمع الطموحين: مجتمع تعليمي داعم يساعدك على التفاعل مع زملائك والاستفادة من خبراتهم وتجاربهم.
- فيديوهات شرح قصيرة: تغطي كافة مواضيع المادة بأسلوب سلس ومنظم.
- تدريبات عملية وحل أمثلة: لتطوير مهاراتك البرمجية وتحسين فهمك للمفاهيم.
- حلول لاختبارات سابقة: لفهم أنماط الأسئلة وتحسين أدائك.
- مجموعة واتساب خاصة: للتفاعل ومناقشة المادة مع زملائك.
- شرح مفصل للمشاريع: للحصول على توضيحات وحلول تسهل عليك فهم متطلبات المشاريع البرمجية.
المنهج:
- Introduction to Data Structures: Understanding the basics of data structures and their importance.
- Linked Lists: Singly linked lists, doubly linked lists, and circular linked lists.
- Stacks and Queues: Implementation and applications of stacks and queues, including priority queues.
- Trees: Binary trees, binary search trees, AVL trees, and their operations.
- Graphs: Representation of graphs, traversals (BFS and DFS), and shortest path algorithms.
- Hashing: Hash functions, collision resolution techniques, and applications.
- Algorithm Analysis: Big-O notation, time and space complexity, and optimization techniques.
ملاحظات هامة:
- الاشتراك في المقرر لمدة ترم واحد فقط
- الاشتراك لا يحتوي بثوث مباشرة
- الاشتراك لا يشمل حل الواجبات نيابة عنك.
Course Features
- Lectures 217
- Quiz 0
- Duration 22 weeks
- Skill level Intermediate
- Language Arabic
- Students 119
- Assessments Yes
Curriculum
Curriculum
Curriculum
- 20 Sections
- 217 Lessons
- 22 Weeks
Expand all sectionsCollapse all sections
- Review of Fundamental Java Concepts4
- Lists (شابتر خاص بالبنات)22
- 2.1Lists | Overview1 Minute
- 2.2Generic3 Minutes
- 2.3Singly Linked List | Node4 Minutes
- 2.4Singly Linked List | Methods8 Minutes
- 2.5Singly Linked List | Add Methods14 Minutes
- 2.6Singly Linked List | Remove Method3 Minutes
- 2.7Singly Linked List | How to search (Very important)5 Minutes
- 2.8Circular Linked List | Idea1 Minute
- 2.9Circular Linked List | Methods4 Minutes
- 2.10Circular Linked List | Add Methods8 Minutes
- 2.11Circular Linked List | Remove Method8 Minutes
- 2.12Circular Linked List | How to search (Very important)3 Minutes
- 2.13Double Linked List | Idea1 Minute
- 2.14Double Linked List | Node class4 Minutes
- 2.15Double Linked List | Methods3 Minutes
- 2.16Double Linked List | Add Methods7 Minutes
- 2.17Double Linked List | Remove Methods7 Minutes
- 2.18Double Linked List | How to search (very important)2 Minutes
- 2.19Lists | Search (طريقه سهله للبحث)3 Minutes
- 2.20Lists | Add middle11 Minutes
- 2.21Lists | Exerices17 Minutes
- 2.22Lists | تجميعات13 Minutes
- Lists | (شابتر خاص بالعيال)12
- 3.1Singly Linked List | Node5 Minutes
- 3.2Singly Linked List | Idea5 Minutes
- 3.3Singly Linked List | Add Methods15 Minutes
- 3.4Singly Linked List | Remove Method7 Minutes
- 3.5Singly Linked List | How to search (Very important)2 Minutes
- 3.6Singly Linked List | Add Middle11 Minutes
- 3.7Doubly Linked List | Idea+Node4 Minutes
- 3.8Doubly Linked List | Add Methods15 Minutes
- 3.9Doubly Linked List | Remove Methods5 Minutes
- 3.10Doubly Linked List | How to search (Very important)4 Minutes
- 3.11Doubly Linked List | Add Middle8 Minutes
- 3.12CIRCULAR LINKED LISTS
- Quiz 1 | Exercises7
- Projects-110
- 5.1Project 1 | 2023 Male (First semester)63 Minutes
- 5.2Project 1 | 2023 Male (First semester) main class13 Minutes
- 5.3Project 1 | 2023 Male (First semester) Files
- 5.4Project 1- | 2023 Female (First semester)18 Minutes
- 5.5Project 1 | 2023-2024 Male (Second semester) (شرح المشروع)13 Minutes
- 5.6Project 1 | 2023 Male-2024 (Second semester) (شرح الكود + ملفات الحل)25 Minutes
- 5.7Project 1 | 2023-2024 Female (Second semester) (شرح الكود + ملفات الحل)24 Minutes
- 5.8Project 1 | 2024-2025 Female (First semester) Riyadh Train Composition System (شرح الكود + ملفات الحل)21 Minutes
- 5.9Project 1 | 2024-2025 Male (First semester) (شرح المشروع)12 Minutes
- 5.10Project 1 | 2024-2025 Male (First semester) (شرح الكود)21 Minutes
- Analysis of Algorithms6
- Recursion5
- Major 1 | Reviews (شابتر مهم جدا )26
- 8.1Review | Lists25 Minutes
- 8.2Review | Analysis of Algorithms & Recursion16 Minutes
- 8.3تجميعات | FS(2023-2024) (Write Code List)11 Minutes
- 8.4تجميعات | FS(2023-2024) (Trace Code List)3 Minutes
- 8.5تجميعات | FS(2023-2024) (Find T(n) + Big(O) )13 Minutes
- 8.6تجميعات | FS(2023-2024) (recursion )6 Minutes
- 8.7تجميعات | FS(2023-2024) (Prove Big(O) +Find)8 Minutes
- 8.8تجميعات | SS(2023-2024) (Write Code List)18 Minutes
- 8.9تجميعات | SS(2023-2024) (Trace Code List using Recursion)8 Minutes
- 8.10تجميعات | SS(2023-2024) (MCQ)10 Minutes
- 8.11تجميعات | SS(2023-2024) (Find T(n) + Big(O) )8 Minutes
- 8.12تجميعات | SS(2023-2024) (recursion )9 Minutes
- 8.13تجميعات | SS(2023-2024) (Prove BigO)4 Minutes
- 8.14تجميعات | Lists +BigO13 Minutes
- 8.15تجميعات | BigO Prove13 Minutes
- 8.16تجميعات | Recursion9 Minutes
- 8.17تجميعات | DDL14 Minutes
- 8.18Recursion | (تجميعات) output+BigO+T(n)9 Minutes
- 8.19CLL | (تجميعات) Write a code to insert10 Minutes
- 8.20تجميعات | Convert Lists to Array7 Minutes
- 8.21تجميعات | Convert Array to List4 Minutes
- 8.22تجميعات | Skitch Lists9 Minutes
- 8.23تجميعات | Recursion12 Minutes
- 8.24Quick-Examples |BigO7 Minutes
- 8.25تجميعات | Lists-Merge7 Minutes
- 8.26Major-1 | نصايح مهمه للجميع1 Minute
- Sorting Algorithms11
- 9.1Sort | Overview2 Minutes
- 9.2Selection Sort | Idea10 Minutes
- 9.3Selection Sort | Code10 Minutes
- 9.4Selection Sort | Example12 Minutes
- 9.5Insertion_Sort | Idea+Code12 Minutes
- 9.6Insertion_Sort | Example5 Minutes
- 9.7Selection Sort Vs Insertion_Sort | Big(O)2 Minutes
- 9.8Merge Sort | Top Down (Idea+Example)7 Minutes
- 9.9Merge Sort | Bottom Up (Idea+Example)11 Minutes
- 9.10Merge Sort | (Code+Big(O))2 Minutes
- 9.11Quick Sort | Idea+Example13 Minutes
- Stacks and Queues11
- 10.1Stacks and Queues | Overview2 Minutes
- 10.2Stack | Introduction+Idea7 Minutes
- 10.3Stack | Methods+Example9 Minutes
- 10.4Queue | Introduction+Idea6 Minutes
- 10.5Queue | Methods+Example6 Minutes
- 10.6Stack | Array-based on Stack7 Minutes
- 10.7Queue | Array-based on Queue6 Minutes
- 10.8Stacks and Queues | Exercises (Methods)7 Minutes
- 10.9Stacks and Queues | Write Code (Revese Stack + Revese Stack using Queue)13 Minutes
- 10.10Stacks and Queues | Exercises (Scenario)6 Minutes
- 10.11Array-based on Queue | Exercises6 Minutes
- Trees and Binary Trees8
- 11.1Trees | Overview5 Minutes
- 11.2Trees | Introduction3 Minutes
- 11.3Binary Tree | Introduction3 Minutes
- 11.4Trees | (PreOrder,PostOrder,InOrder)8 Minutes
- 11.5Binary Tree | Represent expression6 Minutes
- 11.6Binary Tree | Exercise (Represent expression)9 Minutes
- 11.7Binary Tree | Exercise (PreOrder,PostOrder,InOrder)10 Minutes
- 11.8Binray Tree | Exercise (Convert Array To BT)10 Minutes
- Binary Search Trees7
- Major 2 | Reviews (شابتر مهم جدا )14
- 13.1Quick Sort | تجميعات (شرح تفصيلي)14 Minutes
- 13.2Binray Tree | (تجميعات) Draw the expression + Find the postfix10 Minutes
- 13.3Binray Search Tree | (تجميعات) Draw +Maximum possible depth of any leaf node8 Minutes
- 13.4Binray Tree | (تجميعات) Write a code10 Minutes
- 13.5Binray Tree | (تجميعات) Give Pre,In Order +represent array10 Minutes
- 13.6Binray Tree | (تجميعات) Draw the expression + Find the postfix(Post order)8 Minutes
- 13.7Stack & Queue | Convert To achieve result7 Minutes
- 13.8Queue , Stack | (تجميعات ) Write a code11 Minutes
- 13.9Major2 | BigO (Review)11 Minutes
- 13.10Major2 | (تجميعات) BigO9 Minutes
- 13.11Binray Tree | (تجميعات) Find PreOrder,PostOrder + Represent array7 Minutes
- 13.12Sort | Quick sort (طريقتين للحل )25 Minutes
- 13.13Binray Tree | (تجميعات) Draw the expression4 Minutes
- 13.14Stack & Queue | (تجميعات) True false + Convert To achieve result7 Minutes
- AVL Tree7
- Projects-29
- 15.1BST Male | شرح المشروع + الميثود23 Minutes
- 15.2BST Male | شرح المين +تعبئة الجدول والريبورت12 Minutes
- 15.3BST Male | الأكواد
- 15.4BST & AVL | مشروع البنات
- 15.5Sort | مشروع البنات (2023-2024 S )8 Minutes
- 15.6Sort | مشروع ميس سوسن (2023-2024 S )19 Minutes
- 15.7Graph | مشروع باسط (2023-2024 S )13 Minutes
- 15.8Hash | مشروع ميس سوسن (2023-2024 S )6 Minutes
- 15.9Hash | مشروع سيد (2023-2024 S )10 Minutes
- Heaps, Priority Queues11
- 16.1Heaps | Overview7 Minutes
- 16.2Heaps | Min insert11 Minutes
- 16.3Heaps | Max insert (Number represent by array)5 Minutes
- 16.4Heaps | Remove5 Minutes
- 16.5Heaps | Exercise insert5 Minutes
- 16.6Heaps | Exercise Remove3 Minutes
- 16.7Priority Queue4 Minutes
- 16.8Heaps & Priority Queue | How to represent5 Minutes
- 16.9Heaps & Priority Queue | Exercise insert5 Minutes
- 16.10Heaps & Priority Queue | Exercise Remove3 Minutes
- 16.11Heaps & Priority Queue | Exercise (Full example)10 Minutes
- Hash-Tables5
- Graphs12
- 18.1Graphs | Overview6 Minutes
- 18.2Graphs | Represent (Adjacency Matrix)6 Minutes
- 18.3Graphs | Represent (Adjacency List)4 Minutes
- 18.4Graphs | BFS5 Minutes
- 18.5Graphs | DFS5 Minutes
- 18.6Graphs | Exercise (Adjacency Matrix+Draw Graph)6 Minutes
- 18.7Graphs | Exercise (Draw Graph using Adjacency List)5 Minutes
- 18.8Graphs | Exercise (DFS)4 Minutes
- 18.9Graphs | Exercise (BFS)4 Minutes
- 18.10Graphs | Exercise (BFS & DFS (Graph with weight ))8 Minutes
- 18.11Graphs | Exercise (Adjacency Matrix+Draw directed Grpah)5 Minutes
- 18.12Graphs | Exercise ( DFS (directed Graph with weight ))5 Minutes
- Final | Reviews (شابتر مهم جدا )29
- 19.1Cs210 | Final (مقطع مهم جدا)5 Minutes
- 19.2Review | Lists25 Minutes
- 19.3Review | Analysis of Algorithms & Recursion14 Minutes
- 19.4Binray Tree | (تجميعات) Draw Tree6 Minutes
- 19.5Heap | (تجميعات) Insert,Remove9 Minutes
- 19.6AVL Tree | (تجميعات) Insert,Remove9 Minutes
- 19.7Graph | (تجميعات) Adjacency List+DFS10 Minutes
- 19.8Merge Sort | (تجميعات) Sort the array11 Minutes
- 19.9MCQ (اسئله منوعه) |(تجميعات)10 Minutes
- 19.10Hash | (تجميعات) Separate Chaining+Linear Probing9 Minutes
- 19.11Hash | (تجميعات) Double Hash5 Minutes
- 19.12CLL | (تجميعات) Write a code to insert10 Minutes
- 19.13Stack & Queue | (تجميعات) Trace the code5 Minutes
- 19.14Tree | Mirror (تجميعات)7 Minutes
- 19.15Graph | (تجميعات) Adjacency List+DFS10 Minutes
- 19.16AVL Tree | (تجميعات) Insert,Remove9 Minutes
- 19.17AVL Tree | (تجميعات) Write a method to Ancestors7 Minutes
- 19.18Heap | (تجميعات) Insert,Remove6 Minutes
- 19.19Convert List To Stack And Reverse | (تجميعات)6 Minutes
- 19.20MCQ Big(O) (اسئله منوعه) |(تجميعات)10 Minutes
- 19.21Hash | (تجميعات) Separate Chaining+Linear Probing11 Minutes
- 19.22Recursion | (تجميعات) output+BigO+T(n)9 Minutes
- 19.23MCQ Big(O) (اسئله منوعه) |(تجميعات)7 Minutes
- 19.24Graph | (تجميعات) Draw a graph + Adjacency List (with edge-weights)12 Minutes
- 19.25Graph | (تجميعات) DFS+BFS(with edge-weights)9 Minutes
- 19.26Graph | directed graph13 Minutes
- 19.27Heap | Insert,Remove5 Minutes
- 19.28AVL,Binary Tree | Insert remove + Draw a BT tree12 Minutes
- 19.29MCQ | تجميعات منوعه18 Minutes
- Cs210 End Of Course | (كلام من قلب للجميع 💙)1
Instructor
Instructor