الدورة
18 قسم
112 درس
دائم
Expand all sections
غلق كل الأقسام
Assignments
شرح تفصيلي لمتطلبات جميع الواجبات، مع الحل والتطبيق العملي خطوة بخطوة لضمان الفهم الكامل وتنفيذها بكفاءة
3
1.1
Assignment 1 (2025)
1.2
Assignment 2 (2025)
1.3
Assignment 3 (2025)
قرورب المشتركين
1
3.0
رابط التليجرام
مقدمة إلى تراكيب البيانات
3
4.0
ماهي تراكيب البيانات؟
4.1
Arrays vs Linked List
4.2
Intro to Data Structures
Array
12
5.1
?What is an Array
5.2
Declaration & Initialization
5.3
One Vs Two Dimensional
5.4
Array Processing in Java
5.5
Operations : Access
5.6
Operations : Traverse
5.7
Operations : Insert
5.8
Operations : Delete
5.9
Operations : Merge
5.10
Operations : Linear Search
5.11
Operations : Binary Search
5.12
List Matching Problem
Linked List
10
6.0
?What is Linked List
6.1
Implement Linked List in JAVA
6.2
Operations : IsEmpty
6.3
Operations : Traversing
6.4
Operations : Modifying
6.5
Operations : Searching
6.6
Operations : Insertion
6.7
Operations : Deletion
6.8
Operations : Merging
6.9
Linked List Types
Recursion
4
7.0
Introduction
7.1
Recursion : Numeric Values
7.2
Recursion : String Values
7.3
Recursion : Binary Search
Algorithm Analysis
4
8.0
Introduction
8.1
Complexity Classes
8.2
Algorithm Analysis : Examples
8.3
Practical Problems
Stack
7
9.0
Intro
9.1
Stack : Basic Operations
9.2
Stack : Usability
9.3
Postfix Evaluation
9.4
Infix to Postfix
9.5
Stack as Array
9.6
Stack as LinkedList
Queue
6
10.0
Intro
10.1
Queue : Basic Operations
10.2
Queue : Implementation logic
10.3
Queue : as Array
10.4
Queue : as Linked List
10.5
Review Questions
Trees
10
11.0
Intro
11.1
Types of Trees : General Tree
11.2
Types of Trees : Binary Tree
11.3
BST
11.4
Operations : Traversal
11.5
Operations : Searching
11.6
Operations : Insertion
11.7
Operations : Deletion
11.8
BST : Practice Problems
11.9
Review Questions
Sorting
5
12.0
Selection Sort
12.1
Insertion Sort
12.2
Bubble Sort
12.3
Merge Sort
12.4
Quick Sort
Heap
4
13.0
Intro
13.1
Heap Operations
13.2
Heap Applications
13.3
Heap Implementation
Graph
6
14.0
Intro
14.1
Types & Terminologies
14.2
Representation : Adjacency Matrix
14.3
Representation : Adjacency List
14.4
Representation : Comparison
14.5
Traversal
Table
7
15.0
Intro
15.1
Table : Implementation
15.2
Hash Table
15.3
Hash Functions : Integer Values
15.4
Hash Functions : Non Integer Values
15.5
Collision : Open Addressing
15.6
Collision : Restructuring
Labs
14
16.0
Lab 1 : Array
16.1
Lab 2 : Linear & Binary Search
16.2
Lab 3 : Linked List 1
16.3
Lab 4 : Linked List 2
16.4
Lab 5 : Recursion 1
16.5
Lab 6 : Recursion 2
16.6
Lab 7 : Algorithm Analysis
16.7
Lab 8 : Stack
16.8
Lab 9 : Queue
16.9
Lab 10 : BST
16.10
Lab 11 : BST
16.11
Lab 12 : Sorting-1
16.12
Lab 13 : Sorting-2
16.13
Lab 14 : Graphs-Heaps-Hashing
مراجعات الميد
6
17.1
Mid Exam Fall-22 (بنات)
17.2
Mid Exam Spring-23 (شباب)
17.3
Mid Exam Spring-22
17.4
Mid Exam 3rd Term 2022
17.5
أسئلة هامة في Linked List
17.6
أسئلة هامة في Stack
مراجعات الفاينال لاب
6
18.0
Final Lab 2020 Fall (Boys)
18.1
Final Lab 2021 Summer (Boys)
18.2
Final Lab 2023 Fall (Boys )
18.3
Final Lab 2023 Spring (Boys )
18.4
Final Lab 2023 (Girls)
18.5
Final Lab 2022 (Girls)
مراجعات الفاينال
4
19.1
اسئلة هامة في Table
19.2
Final Spring 2022
19.3
Final – Spring 2023
19.4
Final Winter 2024
برمجة 3 – CPCS 204
Search
Exercise 1
Exercise 2
Exercise 3
Exercise 4
Exercise 5
Exercise 6
Lab 1 : Array
محتوى الدرس فارغ.
تسجيل دخول
نسيت كلمة المرور؟
تذكرني
مستخدم جديد؟
سجل الآن
تسجيل حساب جديد
لديك حساب؟
تسجيل دخول