هياكل بيانات (501324-3) | كلية حاسبات الطائف

محتوى الدورة

بيئة العمل | Course IDE

تحميل و تصطيب | Visual Studio Code

00:00

DS- L1 Introduction

DS- L2 Array

Lab 1 Arrays عملي

DS- L3 Pointers

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

Lab 3 Pointers عملي

DS- L4 Structures

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- L5 Linked Lists Parts (1+2)

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- L6 part 1 [Stack]

DS- L6 part 2 [Queues]

DS- L7 Trees

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. Balanced Search Tree

00:00
6. Tree Traversal [Preoder- Inorder – Postorder]

00:00
7. Preoder Examples

00:00
8. Inoder Examples

00:00
9. Postoder Examples

00:00

DS- L8 [ Priority Queues – Heaps ]

DS- L9 Search Algorithms

DS- L10 Sort Algorithms

DS- L11 Algorithm Analysis

تجميعات كويزات

تجميعات ميدترم

تجميعات فاينال

HW#1 Dr Reem Alotaibi

HW#2 Dr Reem Alotaibi

HW#1 Dr Maha A.Thafar

HW #1 solution [Dr. Majed Althaqafy] عملي

HW#1 Dr Huda Sobhi

HW#2-LAB4 Dr Nawal عملي

Mid Term Exam 45-46H

Mid Term Exam, Fall 2023

Final Exam, 1st Semester 2023-2024, 45-46H

Revision

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

تقييمات ومراجعات الطلاب

لا يوجد تقييم حتى الآن

محتوى الدورة

بيئة العمل | Course IDE

DS- L1 Introduction

DS- L2 Array

Lab 1 Arrays عملي

DS- L3 Pointers

1. Intro to Pointers

2. Pointer Variable & Syntax

3. Pointer Assignment

4. Pointers to Pointer Pointer (Double Pointer)

5. Pointers Function arguments (a) Example 1

5. Pointers Function arguments (b) Example 2

6. Pointers & Arrays

7. Pointer Arithmetic

8. Predict the Output (a) Example 1

8. Predict the Output (b) Example 2

8. Predict the Output (c) Example 3

8. Predict the Output (d) Example 4

9. More About Pointers Examples

Lab 3 Pointers عملي

Exercise 1 solution

Exercise 2 solution

DS- L4 Structures

1. Structure (struct) Definition

2. Accessing Structure Members

3. Array in Structures

4. Array of Structures

5. Structure Assignment

6. Arithmetic in Structures

7. Nested Structures

8. Pointers to Structures

9. Structures & Functions

DS- L5 Linked Lists Parts (1+2)

1. Linked List Intro.

2. Linked Lists

3. Linked List Operations (a) Create a node, create linked list

3. Linked List Operations (b) Display items of the linked list (Traversing the list)

3. Linked List Operations (c) Add or Append a node in the list

3. Linked List Operations (d) Insert a node into the list

3. Linked List Operations (e) Delete a node from the list

4. Types of Linked Lis

5. Array vs. Linked Lists

DS- L6 part 1 [Stack]

1. Introduction to Stacks and Queues

2. Stack Operations

4. Stack Application (a) Checking for Balanced Braces

4. Stack Application (b) Expression notation (Infix – Postfix – Prefix)

4. Stack Application (b) ii. Evaluating Postfix Expressions

4. Stack Application (b) iii. Infix to Postfix Exampl

DS- L6 part 2 [Queues]

1. Queue

Implementation of Queue [Array vs Linked]

Queue Array Implementation

3. Queue Operations [Enqueue and Dequeue]

4. Stack and Queue – Exercise [1]

4. Stack and Queue – Exercise [2]

4. Stack and Queue – Exercise [4]

DS- L7 Trees

1. Trees

2. Binary Search Trees (BST)

3. Types of Binary Trees [Degenerate – Complete – Balanced]

4. Binary Search Trees insertion

5. Balanced Search Tree

6. Tree Traversal [Preoder- Inorder – Postorder]

7. Preoder Examples

8. Inoder Examples

9. Postoder Examples

DS- L8 [ Priority Queues – Heaps ]

1. Priority Queues

2. Heaps (Max heap vs Min heap)

3. Heap as an Array

4. Operations on Heaps (a) DeleteMin

4. Operations on Heaps (b) Insert

5. Building a Heap (a) Min Heap Example

5. Building a Heap (b) Max Heap Example

DS- L9 Search Algorithms

1. Introduction to Searching

2. Sequential (Linear) Search

3. Binary Search

DS- L10 Sort Algorithms