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

تخطي إلى المحتوى

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

si-manual

si-manual

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

محتوى الدورة

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

0/1

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

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)

Lab 1 Arrays عملي

0/4

Question 1 solution

Question 2 solution

Exercise 1 solution

Exercise 2 solution

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

Lab 3 Pointers عملي

0/2

Exercise 1 solution

Exercise 2 solution

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

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

0/6

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]

0/7

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

0/9

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 ]

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

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

0/2

حلول تجميعات Chapter 3 Pointer quiz solution

DS- L5 Linked Lists Parts quiz solution part 1

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

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

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 عملي

Mid Term Exam 45-46H

0/3

Mid Term Exam 45-46H – Q1

Mid Term Exam 45-46H – Q2-(a)

Mid Term Exam 45-46H – Q2-(b)

Mid Term Exam, Fall 2023

0/2

Mid Term Exam, Fall 2023 – Q1

Mid Term Exam, Fall 2023 – Q2 – (A)

Final Exam, 1st Semester 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

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

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

#include <iostream>
#include <iomanip>

using std::setw; 
using std::cout; 
using std::endl;

int main() {
    int n[10];
    for (int i = 0; i < 10; i++)
        n[i] = 0;
    for (int j = 0; j < 10; j++)
        cout << j << setw(2) << n[j] << endl;
    return 0;
}

0% مكتمل

Copyright © 2025 si-manual