Example 2 solution تطبيق عملي | si-manual

Skip to content

الرئيسية
كل الكورسات
كورسات الجامعات السعودية
طرق الدفع
تسجيل دخول
انشاء حساب جديد

si-manual

si-manual

الرئيسية
كل الكورسات
كورسات الجامعات السعودية
طرق الدفع
تسجيل دخول
انشاء حساب جديد

Course Content

DS- L1 Introduction

0/4

Data Structures Examples | امثلة علي هياكل البيانات

Operation on Data Structures | العمليات علي هياكل البينات

ملخص DS- Lec 1 Introduction v1.1

DS- L2 Array

0/12

2. Example 1 solution

Example 1 solution تطبيق عملي

3. Example 2 solution

Example 2 solution تطبيق عملي

4. Example 3 solution (const size)

Example 3 solution تطبيق عملي

5. Example 4 solution (Sum of Array)

Example 4 solution تطبيق عملي

6. Example 5 solution (Array of Strings)

7. Memory Representation of 1D Array

8. Multiple-Subscripted Arrays (2D Arrays)

DS- L2 Array حلول كويزات

0/1

DS- L3 Pointers

0/13

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

DS- L3 Pointers حلول كويزات

0/1

DS- L4 Structures

0/9

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- L4 Structures حلول كويزات

0/1

DS- L4 Structures quiz solution

DS- L5 Linked Lists

0/9

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- L5 Linked Lists حلول كويزات

0/2

6. تمارين اختياري علي linked list

quiz 1 solution

Mid Term Exam 2021

0/3

Question 1 Array and Structures

Question 2 Pointers

Question 3 Linked list

Mid Term Exam 2023 G2

0/5

Question 1 (MCQ)

Question 2 [Fill the black \ What the output of the code ]

Question 3 [True/False]

Question 4.1 [Lec 4 Structures]

Question 4.2 [Lec 4 Linked List]

Mid Term Exam 2024 (45-46H)

0/4

Question 1 [MCQ اختياري ]

Question 2 – (a) [1. Look at the following structure declaration: ]

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. ]

Question 2.(c) Linked List Output

Mid Term Exam 2025

0/7

Question 1 [Choose the correct answer]

Question 2.a part 1 [What is the output of the code]

Question 2.a part 2 [What is the output of the code]

Question 2.b [1. creates an array of the linked list nodes]

Question 2.b [2. print the positive values in linked list]

Question 2.b [3. print all the odd numbers in linked list]

Question 2.b [4. returns the sum of all integer values in linked list]

DS- L6 part 1 [Stack]

0/7

1. Introduction to Stacks and Queues

2. Stack Operations

3. Implementation of the Stack

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 Example

DS- L6 part 1 [Stack] حلول كويزات

0/2

DS- L6 Stacks (infix to Postfix) quiz solution

DS- L6 Stacks ( Postfix to infix) quiz solution

DS- L6 part 2 [Queues]

0/8

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 [3]

4. Stack and Queue – Exercise [4]

Mid Term Exam 2023 G1

0/3

Question 1 [MCQ اختياري + True/False صخ و خطأ ]

Question 1 – (a) [Convert the following infix expression into postfix expression using stack.]

Question 2.b (on Queue)

DS- L7 Trees

0/11

2. Binary Search Trees (BST)

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

4. Binary Search Trees insertion

5. Binary Search Trees deletion

6. Balanced Search Tree

7. Tree Traversal [Preoder- Inorder – Postorder]

8. Preoder Examples

9. Inoder Examples

10. Postoder Examples

11. Tree Array Representation

DS- L7 Trees حلول كويزات

0/1

DS- L7 Trees quiz solution

DS- L8 [ Priority Queues – Heaps ]

0/7

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- L8 [ Priority Queues – Heaps ] حلول كويزات

0/1

DS- L8 [ Priority Queues – Heaps ] quiz solution

Queue + heap + tree quiz

0/1

Queue + heap + tree quiz

DS- L9 Search Algorithms

0/3

1. Introduction to Searching

2. Sequential (Linear) Search

3. Binary Search

DS- L10 Sort Algorithms

0/5

2. Selection Sort

3. Insertion Sort

DS- L11 Algorithm Analysis

0/1

DS- L11 Algorithm Analysis

Revision

0/9

Question [Lec 6 Stack] (a) Infix to Postfix

Question [Lec 6 Stack] (b) Postfix Calculator.

Question [Lec 7 Tree]

Question [Lec 11 Algorithm analysis]

Question [Lec 3 Pointer

Question [Lec 5 Linked List] displayNode_count

Question [Lec 6 Queue] displayNode_count

Question [Lec 6 Stack and Queue]

Question [Lec 6 Stack] displayNode_count

Final Exam, First Term 2022-2023, 44-45H

0/3

Final Exam, First Term 2023-2024, 45-46H

0/8

Q2 part 1 (Binary Search Tree)

Q2 part 2 (Binary Search Tree)

Q3.1 bubble sort

Q3.2 selection sort

Q4 part 1 (Heap)

Q4 part 2 (Heap)

( stacks and queues ) Q5.1

( stacks and queues ) Q5.2

Final Exam, First Term 2024-2025, 46-47H

0/4

Lab 1 Arrays عملي

0/4

Question 1 solution

Question 2 solution

Exercise 1 solution

Exercise 2 solution

Lab 3 Pointers عملي

0/2

Exercise 1 solution

Exercise 2 solution

HW#1 Dr Reem Alotaibi

0/3

HW #1 Q1 (Lab 1 Arrays EX1)

HW #1 Q2 (Lab 1 Arrays EX2)

تحميل الأكواد و ملف pdf

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

HW#1 Q1.2 Counting Even and Odd Numbers in an Array

HW#1 Q2.1 Pointer and Function

HW#1 Q2.2 Copying an array using pointers

HW#1 Q2.3 Pointer and Array

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

0/2

HW #1 Q1 (Lab 1 Arrays EX1)

HW #1 Q2 (Lab 1 Arrays EX2)

HW#1 Dr Huda Sobhi

0/2

HW#1 PART 2 Pointers Q1 Pointer and Array (reverse array)

HW#1 PART 2 Pointers Q2 passing by reference (pointer)

HW#2-LAB4 Dr Nawal عملي

0/1

HW#2-LAB4 Dr Nawal عملي

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

0% Complete

Copyright © 2026 si-manual