18 قسم
112 درس
دائم
فتح كل الأقسام
غلق كل الأقسام
قرورب المشتركين
1
1.1
رابط التليجرام
مقدمة إلى تراكيب البيانات
3
2.1
ماهي تراكيب البيانات؟
2.2
Arrays vs Linked List
2.3
Intro to Data Structures
Array
12
3.1
Array As A Data Structure
17 دقيقة
3.2
Declaration & Initialization
13 دقيقة
3.3
Array Dimensionality
6 دقيقة
3.4
Array Processing in Java
11 دقيقة
3.5
Operations : Access
3.6
Operations : Traverse
3.7
Operations : Insert
3.8
Operations : Delete
3.9
Operations : Merge
3.10
Operations : Linear Search
3.11
Operations : Binary Search
3.12
List Matching Problem
Linked List
10
4.1
?What is Linked List
4.2
Implement Linked List in JAVA
4.3
Operations : IsEmpty
4.4
Operations : Traversing
4.5
Operations : Modifying
4.6
Operations : Searching
4.7
Operations : Insertion
4.8
Operations : Deletion
4.9
Operations : Merging
4.10
Linked List Types
Recursion
4
5.1
Introduction
5.2
Recursion : Numeric Values
5.3
Recursion : String Values
5.4
Recursion : Binary Search
Algorithm Analysis
4
6.1
Introduction
6.2
Complexity Classes
6.3
Algorithm Analysis : Examples
6.4
Practical Problems
Stack
7
7.1
Intro
7.2
Stack : Basic Operations
7.3
Stack : Usability
7.4
Postfix Evaluation
7.5
Infix to Postfix
7.6
Stack as Array
7.7
Stack as LinkedList
Queue
6
8.1
Intro
8.2
Queue : Basic Operations
8.3
Queue : Implementation logic
8.4
Queue : as Array
8.5
Queue : as Linked List
8.6
Review Questions
Trees
10
9.1
Intro
9.2
Types of Trees : General Tree
9.3
Types of Trees : Binary Tree
9.4
BST
9.5
Operations : Traversal
9.6
Operations : Searching
9.7
Operations : Insertion
9.8
Operations : Deletion
9.9
BST : Practice Problems
9.10
Review Questions
Sorting
5
10.1
Selection Sort
10.2
Insertion Sort
10.3
Bubble Sort
10.4
Merge Sort
10.5
Quick Sort
Heap
4
11.1
Intro
11.2
Heap Operations
11.3
Heap Applications
11.4
Heap Implementation
Graph
6
12.1
Intro
12.2
Types & Terminologies
12.3
Representation : Adjacency Matrix
12.4
Representation : Adjacency List
12.5
Representation : Comparison
12.6
Traversal
Table
7
13.1
Intro
13.2
Table : Implementation
13.3
Hash Table
13.4
Hash Functions : Integer Values
13.5
Hash Functions : Non Integer Values
13.6
Collision : Open Addressing
13.7
Collision : Restructuring
Labs
14
14.1
Lab 1 : Array
14.2
Lab 2 : Linear & Binary Search
14.3
Lab 3 : Linked List 1
14.4
Lab 4 : Linked List 2
14.5
Lab 5 : Recursion 1
14.6
Lab 6 : Recursion 2
14.7
Lab 7 : Algorithm Analysis
14.8
Lab 8 : Stack
14.9
Lab 9 : Queue
14.10
Lab 10 : BST
14.11
Lab 11 : BST
14.12
Lab 12 : Sorting-1
14.13
Lab 13 : Sorting-2
14.14
Lab 14 : Graphs-Heaps-Hashing
Assignments
شرح تفصيلي لمتطلبات جميع الواجبات، مع الحل والتطبيق العملي خطوة بخطوة لضمان الفهم الكامل وتنفيذها بكفاءة
3
15.1
Assignment 1 (2025)
15.2
Assignment 2 (2025)
15.3
Assignment 3 (2025)
مراجعات الميد
6
16.1
Mid Exam Fall-22 (بنات)
16.2
Mid Exam Spring-23 (شباب)
16.3
Mid Exam Spring-22
16.4
Mid Exam 3rd Term 2022
16.5
أسئلة هامة في Linked List
16.6
أسئلة هامة في Stack
مراجعات الفاينال لاب
6
17.1
Final Lab 2020 Fall (Boys)
17.2
Final Lab 2021 Summer (Boys)
17.3
Final Lab 2023 Fall (Boys )
17.4
Final Lab 2023 Spring (Boys )
17.5
Final Lab 2023 (Girls)
17.6
Final Lab 2022 (Girls)
مراجعات الفاينال
4
18.1
اسئلة هامة في Table
18.2
Final Spring 2022
18.3
Final – Spring 2023
18.4
Final Winter 2024
برمجة 3 – CPCS 204
Search
Implement Linked List in JAVA
محتوى الدرس فارغ.
تسجيل دخول
نسيت كلمة المرور؟
تذكرني
مستخدم جديد؟
سجل الآن
تسجيل حساب جديد
لديك حساب؟
تسجيل دخول