Course Content
DS- L1 Introduction
0/4
Introduction
00:00
Data Structures Examples | امثلة علي هياكل البيانات
00:00
Operation on Data Structures | العمليات علي هياكل البينات
00:00
ملخص DS- Lec 1 Introduction v1.1
00:00
DS- L2 Array
0/12
1. Arrays
00:00
2. Example 1 solution
00:00
Example 1 solution تطبيق عملي
00:00
3. Example 2 solution
00:00
Example 2 solution تطبيق عملي
00:00
4. Example 3 solution (const size)
00:00
Example 3 solution تطبيق عملي
00:00
5. Example 4 solution (Sum of Array)
00:00
Example 4 solution تطبيق عملي
00:00
6. Example 5 solution (Array of Strings)
00:00
7. Memory Representation of 1D Array
00:00
8. Multiple-Subscripted Arrays (2D Arrays)
00:00
DS- L2 Array حلول كويزات
0/1
quiz solution
00:00
DS- L3 Pointers
0/13
1. Intro to Pointers
00:00
2. Pointer Variable & Syntax
00:00
3. Pointer Assignment
00:00
4. Pointers to Pointer Pointer (Double Pointer)
00:00
5. Pointers Function arguments (a) Example 1
00:00
5. Pointers Function arguments (b) Example 2
00:00
6. Pointers & Arrays
00:00
7. Pointer Arithmetic
00:00
8. Predict the Output (a) Example 1
00:00
8. Predict the Output (b) Example 2
00:00
8. Predict the Output (c) Example 3
00:00
8. Predict the Output (d) Example 4
00:00
9. More About Pointers Examples
00:00
DS- L3 Pointers حلول كويزات
0/1
quiz solution
00:00
DS- L4 Structures
0/9
1. Structure (struct) Definition
00:00
2. Accessing Structure Members
00:00
3. Array in Structures
00:00
4. Array of Structures
00:00
5. Structure Assignment
00:00
6. Arithmetic in Structures
00:00
7. Nested Structures
00:00
8. Pointers to Structures
00:00
9. Structures & Functions
00:00
DS- L4 Structures حلول كويزات
0/1
DS- L4 Structures quiz solution
00:00
DS- L5 Linked Lists
0/9
1. Linked List Intro.
00:00
2. Linked Lists
00:00
3. Linked List Operations (a) Create a node, create linked list
00:00
3. Linked List Operations (b) Display items of the linked list (Traversing the list)
00:00
3. Linked List Operations (c) Add or Append a node in the list
00:00
3. Linked List Operations (d) Insert a node into the list
00:00
3. Linked List Operations (e) Delete a node from the list
00:00
4. Types of Linked Lis
00:00
5. Array vs. Linked Lists
00:00
DS- L5 Linked Lists حلول كويزات
0/2
6. تمارين اختياري علي linked list
00:00
quiz 1 solution
00:00
Mid Term Exam 2021
0/3
Question 1 Array and Structures
00:00
Question 2 Pointers
00:00
Question 3 Linked list
00:00
Mid Term Exam 2023 G2
0/5
Question 1 (MCQ)
00:00
Question 2 [Fill the black \ What the output of the code ]
00:00
Question 3 [True/False]
00:00
Question 4.1 [Lec 4 Structures]
00:00
Question 4.2 [Lec 4 Linked List]
00:00
Mid Term Exam 2024 (45-46H)
0/4
Question 1 [MCQ اختياري ]
00:00
Question 2 – (a) [1. Look at the following structure declaration: ]
00:00
Question 2 – (b) [Write a function that takes a pointer to the first node of a linked list and prints all the values of the nodes in the list. ]
00:00
Question 2.(c) Linked List Output
00:00
Mid Term Exam 2025
0/7
Question 1 [Choose the correct answer]
00:00
Question 2.a part 1 [What is the output of the code]
00:00
Question 2.a part 2 [What is the output of the code]
00:00
Question 2.b [1. creates an array of the linked list nodes]
00:00
Question 2.b [2. print the positive values in linked list]
00:00
Question 2.b [3. print all the odd numbers in linked list]
00:00
Question 2.b [4. returns the sum of all integer values in linked list]
00:00
DS- L6 part 1 [Stack]
0/7
1. Introduction to Stacks and Queues
00:00
2. Stack Operations
00:00
3. Implementation of the Stack
00:00
4. Stack Application (a) Checking for Balanced Braces
00:00
4. Stack Application (b) Expression notation (Infix – Postfix – Prefix)
00:00
4. Stack Application (b) ii. Evaluating Postfix Expressions
00:00
4. Stack Application (b) iii. Infix to Postfix Example
00:00
DS- L6 part 1 [Stack] حلول كويزات
0/2
DS- L6 Stacks (infix to Postfix) quiz solution
00:00
DS- L6 Stacks ( Postfix to infix) quiz solution
00:00
DS- L6 part 2 [Queues]
0/8
1. Queue
00:00
Implementation of Queue [Array vs Linked]
00:00
Queue Array Implementation
00:00
3. Queue Operations [Enqueue and Dequeue]
00:00
4. Stack and Queue – Exercise [1]
00:00
4. Stack and Queue – Exercise [2]
00:00
4. Stack and Queue – Exercise [3]
00:00
4. Stack and Queue – Exercise [4]
00:00
Mid Term Exam 2023 G1
0/3
Question 1 [MCQ اختياري + True/False صخ و خطأ ]
00:00
Question 1 – (a) [Convert the following infix expression into postfix expression using stack.]
00:00
Question 2.b (on Queue)
00:00
DS- L7 Trees
0/11
1. Trees
00:00
2. Binary Search Trees (BST)
00:00
3. Types of Binary Trees [Degenerate – Complete – Balanced]
00:00
4. Binary Search Trees insertion
00:00
5. Binary Search Trees deletion
00:00
6. Balanced Search Tree
00:00
7. Tree Traversal [Preoder- Inorder – Postorder]
00:00
8. Preoder Examples
00:00
9. Inoder Examples
00:00
10. Postoder Examples
00:00
11. Tree Array Representation
00:00
DS- L7 Trees حلول كويزات
0/1
DS- L7 Trees quiz solution
00:00
DS- L8 [ Priority Queues – Heaps ]
0/7
1. Priority Queues
00:00
2. Heaps (Max heap vs Min heap)
00:00
3. Heap as an Array
00:00
4. Operations on Heaps (a) DeleteMin
00:00
4. Operations on Heaps (b) Insert
00:00
5. Building a Heap (a) Min Heap Example
00:00
5. Building a Heap (b) Max Heap Example
00:00
DS- L8 [ Priority Queues – Heaps ] حلول كويزات
0/1
DS- L8 [ Priority Queues – Heaps ] quiz solution
00:00
Queue + heap + tree quiz
0/1
Queue + heap + tree quiz
00:00
DS- L9 Search Algorithms
0/3
1. Introduction to Searching
00:00
2. Sequential (Linear) Search
00:00
3. Binary Search
00:00
DS- L10 Sort Algorithms
0/5
1. Bubble Sort
00:00
2. Selection Sort
00:00
3. Insertion Sort
00:00
4. Merge Sort
00:00
5. Quick Sort
00:00
DS- L11 Algorithm Analysis
0/1
DS- L11 Algorithm Analysis
00:00
Revision
0/9
Question [Lec 6 Stack] (a) Infix to Postfix
00:00
Question [Lec 6 Stack] (b) Postfix Calculator.
00:00
Question [Lec 7 Tree]
00:00
Question [Lec 11 Algorithm analysis]
00:00
Question [Lec 3 Pointer
00:00
Question [Lec 5 Linked List] displayNode_count
00:00
Question [Lec 6 Queue] displayNode_count
00:00
Question [Lec 6 Stack and Queue]
00:00
Question [Lec 6 Stack] displayNode_count
00:00
Final Exam, First Term 2022-2023, 44-45H
0/3
Question 2
00:00
Question 5.1
00:00
Question 5.2
00:00
Final Exam, First Term 2023-2024, 45-46H
0/8
Q2 part 1 (Binary Search Tree)
00:00
Q2 part 2 (Binary Search Tree)
00:00
Q3.1 bubble sort
00:00
Q3.2 selection sort
00:00
Q4 part 1 (Heap)
00:00
Q4 part 2 (Heap)
00:00
( stacks and queues ) Q5.1
00:00
( stacks and queues ) Q5.2
00:00
Final Exam, First Term 2024-2025, 46-47H
0/4
Question 1.
00:00
Question 4.1
00:00
Question 4.2
00:00
Question 4.3
00:00
Lab 1 Arrays عملي
0/4
Question 1 solution
00:00
Question 2 solution
00:00
Exercise 1 solution
00:00
Exercise 2 solution
00:00
Lab 3 Pointers عملي
0/2
Exercise 1 solution
00:00
Exercise 2 solution
00:00
HW#1 Dr Reem Alotaibi
0/3
HW #1 Q1 (Lab 1 Arrays EX1)
00:00
HW #1 Q2 (Lab 1 Arrays EX2)
00:00
تحميل الأكواد و ملف pdf
00:00
HW#2 Dr Reem Alotaibi
HW#1 Dr Maha A.Thafar
0/5
HW#1 Q1.1 Find the Maximum and Minimum in an Array
00:00
HW#1 Q1.2 Counting Even and Odd Numbers in an Array
00:00
HW#1 Q2.1 Pointer and Function
00:00
HW#1 Q2.2 Copying an array using pointers
00:00
HW#1 Q2.3 Pointer and Array
00:00
HW #1 solution [Dr. Majed Althaqafy] عملي
0/2
HW #1 Q1 (Lab 1 Arrays EX1)
00:00
HW #1 Q2 (Lab 1 Arrays EX2)
00:00
HW#1 Dr Huda Sobhi
0/2
HW#1 PART 2 Pointers Q1 Pointer and Array (reverse array)
00:00
HW#1 PART 2 Pointers Q2 passing by reference (pointer)
00:00
HW#2-LAB4 Dr Nawal عملي
0/1
HW#2-LAB4 Dr Nawal عملي
00:00
هياكل بيانات (501324-3) | كلية حاسبات الطائف
Exercise Files
DS- Lec 1 Introduction ملخص v1.1.pdf
Size: 389.27 KB
Previous
Next
0% Complete