Data Structures - 2024 CS212T
Learning Data structures in the right way is not an easy task, this course will teach everything needed to master linked lists, stacks, queues, trees, and graphs along with their algorithms.
- جامعة الأميرة نورة بنت عبدالرحمن
- Created by Eng.Naif AlShehri
- Last update 2024-06-14
- العربية English
-
-
CH1: Introduction to Data Structures and Arrays
- Chapter-1 - Part #1 22:15
- Chapter-1 - Part #2 16:04
- Chapter-1 - Part #3 16:46
- Chapter-1 - Arrays #1 25:07
- Chapter-1 - Arrays #2 23:41
- Chapter-1 - Searching Arrays 35:58
- Exercises 01:51:45
-
CH2: Recursion
- Recursion Part#1 33:27
- Recursion Part #2 44:23
- Recursion Part #3 34:29
- Exercises 43:43
- Exercises : Searching array using Recursion - Linear search 13:54
- Exercises : Man - Max in Array using Recursion 15:06
- Exercises : Product and Power using Recursion 11:01
- Recursion with 2D : #Important 23:17
- Recursion with 2D Array : Left to Right Traversing 05:16
- Recursion with 2D Array : printReverse - printSum - printOdd 05:17
- Recursion with 2D Array : countSum - countOdd-count8 07:14
- Recursion with 2D Array : sum - sumEven - sumOdd 05:42
- Recursion with 2D Array : search 08:43
- Exercises and Previous Exams 01:45:12
-
CH3: Linked Lists
- SinglyLinkedList: Part#1 39:37
- SinglyLinkedList: Part#2 22:51
- SinglyLinkedList: Part#3 45:56
- 👩🏻💻🐥 SinglyLinkedList: Part#4- Using ADT 21:14
- Circularly LinkedList 19:27
- Doubly LinkedList: Part#1 22:20
- Doubly LinkedList: Part#2 28:47
- Sorting LinkedList 06:03
- Exercises 30:37
- Circular List, Doubly List and Previous Exams 02:09:36
-
CH4: Stacks and Queues
- 🐥 Stack Part#1 31:28
- 🐥 Stack Part#2 27:53
- 🐥 Stack Part#3 17:43
- 🐥 Stack Part#4 18:02
- 👩🏻💻🐥 📌 Stack Agreement 11:28
- 🐥 Stack Applications & Exercises 14:21
- 🐥 Stack Implementation: Nodes 14:01
- 🐥 Queue Part#1 17:57
- 🐥 Queue Part#2 16:28
- 🐥 Array-based Queue 31:15
- 🐥 LinkedList-based Queue & Applications 23:30
- 🐥 Exercises 06:33
- 👩🏻💻🐥 Queue Lab Exercises 12:32
- 👩🏻💻🐥 Stack Example: Reversing String 08:49
- 👩🏻💻🐥 Stack Example: Sorting 14:59
- 🐥 📌 Stack Recap and Previous Exam 01:56:29
-
CH5: Trees
- 🐥 General Trees 16:56
- 🐥 Binary Trees 05:50
- 🐥 Binary Tree ADT 27:02
- 🐥 Binary Tree Applications 18:43
- 🐥 Proper Binary Tree Properties 07:02
- 🐥 Implementing Trees and Binary Trees 18:25
- 🐥 Tree Traversal Algorithms 22:30
- 🐥 In-order Traversal Applications 20:53
- 🐥 Euler Tour Traversal 28:05
- 🐥 Exercises 12:55
- 🐥 Building Tree Using ADT Example 09:30
-
CH6: Graphs
- Introduction To Graphs 18:57
- Subgraph 10:55
- Data Structures for Graph 28:15
- Depth First Search - DFS 28:45
- Breadth First Search - BFS 21:13
- More Examples about BFS 15:10
- Exercises 16:47
- Weighted graph and Spanning Tree 09:26
- Minimum Spanning Trees : Kruskal's Algorithm 30:34
- Minimum Spanning Trees : Prim's Algorithm 16:03
- Shortest Path Problem : Dijkstra's Algorithm 32:33
-
CH7: Hash Tables
- Complete Chapter 01:42:25
- HashTable Exercises 37:31
-
Labs
- Lab #01 55:43
- Lab #02: Binary Search 36:19
- Lab #03 Recursion 39:32
- Lab #04: Binary Recursion 26:17
- Lab#03-2023 01:15:03
- Lab#05: Singly LinkedList 57:53
- Lab#06: Doubly LinkedList 40:13
- Lab#07: Stack 36:19
- Lab#08: Queue 35:26
- Lab#09: Trees 27:15
-
Previous Exams - تجميعات
- Quiz #1 50:17
- CH1-CH2: Lab and Eval Revision 01:24:44
- Mid#1 : LinkedList - Prev Exams 01:01:51
- مراجعة تشابتر السنقلي والسركولار لنكد لست 01:22:54
- 🐥 Mid 2 Previous Exam 01:05:32
- 🐥 Mid 2 Previous Exam (B) 47:19
- Final: Prev Exams 01:50:10
- 📌 Mid 1 Previous Exam 24:14
- 📌Quiz 1 : Recursion and Arrays 35:17
- 2022 Mid #1 Solution 15:01
- 📌 Quiz 1 Samples New 01:30:20
- 🐥 📌 Quiz 2: Graph and Tree 32:26
- 🐥 📌 Quiz 2 Model B: Graph and Tree 35:42
- 📌 Mid Solution 2022 Fall 55:48
- 📌 Final Exam 2022 Spring 54:41
- 📌 Final Lab 2023 01:39:26
- 📌🔗 Mid 1 new (2023) 34:42
- 🔴 Mid #1 Revision 2024 01:26:27
- 🔴 Mid #1 Prev Exam 2024 28:59
- 🔴 🔴 Mid 1 Final Review 01:54:21
- 🔴 Mid #2 Revision 2024 01:13:47
-
Extra Exercises
- Doubly LinkedList 40:21
- 🐥 Stack and Queue 10:30
- 🐥Trees 22:26
-
Final Lab
- Tree Lab Review 01:23:23
- Graph Lab Review 29:51
- 👩🏻💻🐥 Queue Lab: Prev Exam 29:55
- Code Tracing Examples 01:37:08
- Final Lab Revision - New 51:20
-
👩🏻💻 🐥📌 Lab Revision
- Chapter#1 Lab Recap 01:22:05
- Chapter#2 Lab Recap 01:38:28
- CH 1 and CH2 Full Example 35:14
- Chapter#3 Lab Recap 01:54:59
- Stack and Queue Recap 01:46:33
- 👩🏻💻🐥 📌 Quiz 2 Sample Exams 01:34:21
- Tree Lab Recap 01:35:08
- 👩🏻💻 🐥 Lab Eval Part#1: Binary Search, Rec and LinkedList 01:30:52
- 👩🏻💻 🐥 Lab Eval Part#2: Stack and Queue 48:15
- 🔴 Lab Quiz Revision 2024 01:17:16
- 🔴 Lab Quiz Revision 2024 II 53:01
- 🔴 Lab Quiz Revision 2024 III 01:50:42
- 🔴 Lab Quiz Revision 2024 IIII 54:45
-
Tutorials (Optional) اختياري
- CH1: Binary Search Tutorial: Theory 58:58
- CH2: Recursion - Coding #1 01:34:59
- CH2: Recursion - Coding #2 01:02:22
- CH2: Recursion - Tracing and Visualization 01:43:37
- CH2: Recursion - Theory 01:22:21
- CH3: SinglyLinkedList - Coding #1: Remove From Middle 01:13:37
- CH3: SinglyLinkedList - Coding #2: Add To Middle+Reverse 38:31
- CH3: SinglyLinkedList - Coding #3: Retrieve From Middle 01:02:01
- CH3: SinglyLinkedList - Coding #4: Traversing 40:25
- CH3: DoublyLinkedList - Coding #5: Traversing 23:33
- CH3: CircularlyLinkedList - Coding #6: Traversing 44:56
- CH3: LinkedList(All) - Coding #7: Static methods 32:58
- CH3: LinkedList(All) - Coding #8: Book Exercises 01:04:45
- CH3: LinkedList(All) - Coding #9: Recursion 32:05
- CH3: LinkedList -Tracing 01:35:27
- CH3: LinkedList(All) - Theory 01:13:31
- Mid I Revision 01:57:29
- 📕👩🏻💻🐥 CH4: Stack- Coding 01:40:15
- 👩🏻💻🐥 CH5: Queue- Coding 01:15:13
- 🐥 CH4: Stack - Theory 01:13:48
- 🐥 CH5: Queue - Theory 01:25:10
- 🐥 CH6: Trees - Theory 01:44:32
- 🐥 Tree Coding 01:35:08
- Medium-Level Tree Coding 01:57:03
- Hashtable Tutorial Part 2 01:23:04
- CH7: Graph 01:08:40
- CH8: Hash Table- Theory 12:55
-
Project
- General Guidelines 32:50
- Project-A-Beauty Salon Appointment System 35:44
- Project-B-Library Book Management System 31:25
- Project-C-Bank Account Management System 20:38
- Project-D-Airline Flight Management System 27:31
- Project-E-Phone Directory Program 19:03
- Project-F-Grocery Store System 18:34
- Airline Flight Management System 38:58
-
CH1: Introduction to Data Structures and Arrays
- Learning Data structures in the right way is not an easy task, this course will teach everything needed to master linked lists, stacks, queues, trees, and graphs along with their algorithms.
-
Naif works as a software engineer. He likes designing, building, and developing highly scalable and secured systems along with testing.
He's a professional certified Java programmer by Oracle. He has rich knowledge in programming languages {such as Java, Python, C, Swift, etc} advanced algorithms & data structures. Naif has the passion to work as an instructor, he has more than 9 years of experience in the field.
He likes to teach people how to program, how to build robust systems, and how should they think logically during the systems development and the right usage of data structures.
Most of his interests now are iOS Development, Backend Engineering, Backend Technologies, Cloud-Native Apps and Tools -
Student feedback
5.00Course Rating
500 SAR -50%
Original Price 1000 SAR - Hurry up!
Lectures
158 Videos
Duration
119:57:18
Material
33 Files
Assignments
Yes, Completely
Labs
Yes, Completely
Project
Yes, Completely
Certificate
Not Applicable
Reviews (25)
Real reviews from real students.
من أفضل وأرتب الكورسات، اللي تبي تضمن الـ أ+ تسجل معاه وتتابع أول بأول وتشوف التتوريالز
شرح جميل جدا ووافي وكافي الله يعطيك العافية وشكرا لك م/نايف ، انا سبق وحذفت المادة لصعوبتها وماكنت فاهمة شيء فيها ومن بداية الترم اشتركت بالمقرر والحمدلله نجحت بهذه المادة اولا بفضل ربي شرح ميسر والمعلومة تدخل غصب ماشاء الله والحمدلله مبسوطة جدا .
ممتاز جدا
.
.
.
شرح يجنن وشامل للمنهج كامل ومشكور المهندس مايقصر معنا ابدا يساعدنا ويشرح لنا كل شيء مانفهمه باذن الله قريد يفتح النفس
حتى لو الاساس صفر مع شرح تيتشر نايف ومساعدته اتوقع كل احد بيقدر يجيب A+
مهندس نايف المعروف لا يعرف هو شرح هو تتوريالات هو هو اتمنى لو انه كل موادي يدرسني هو كان انا A+ فيهم كلهم وطبعا ماننسى غاليه المتواجده المتعاونه المساعدة دااااائممما ماابالغ اذا قلت دائممما شكرا على جهودكم ماندمت اني دفعت ولا ريال ومنجد انصحكم وبلا تفكير لا تتعدون الكورس بدونهم او مع احد غيرهم ❤️
شرح يجنن ودائما متواجدين للمساعده❤️
أشكركم على جهودكم معنا، شرح واضح متكامل ماشاءالله …و جدا متعاونين🤍
كورس كامل متكامل ، شرح رائع جداً وتتوريالز تغطي كل الأفكار وتثبت المعلومات ومراجعات وملخصات شاملة ! شكرًا لكم
شرح واضح جداً ويبسط المعلومات بشكل شكراً لكم
الكورس مره مرتب ومثااالي والشرح واضح ومتكامل ما قصروا مهندس نايف وتيتشر غاليه دااايم متعاونين معنا 🤍
اشرح واضح وكامل زي دايم شكراً لكم 🙏🏻💗
مررره انصح في هذا الكورس. المعلومات واضحه ومرتبه وساعدني مره
.
شرح جدا جميل وتتوريالز تثبت المعلومه غصب
جميل كالعادة والتتوريالز شاملة كل شي الله يعطيهم العافية
.
طبعا مهندس نايف غني عن التعريف تبون شرح تبون تتوريال تبون تجميعات كل شي موجود
.
👍
الافضل للبرمجه وبلكورس امشوا معاه ومع مقاطع الي يحددها لكم كلها وبتطلعون يقريييد اهم شيي تمشون معه صح شامل كل شي
شكراً أستاذ نايف أستفدت جداً من الشروحات المجانية الله يجزاك خيرها، لو أن المادة تسمح لاشتركت