• 19 قسم
  • 116 درس
  • دائم
فتح كل الأقسامغلق كل الأقسام
  • قرورب المشتركين
    1
    • 1.1
      رابط التليجرام
  • مقدمة إلى تراكيب البيانات
    3
    • 2.1
      ماهي تراكيب البيانات؟
      5 Minutes
    • 2.2
      Arrays vs Linked List
      18 Minutes
    • 2.3
      Intro to Data Structures
      18 Minutes
  • Array
    12
    • 3.1
      Array As A Data Structure
      17 Minutes
    • 3.2
      Declaration & Initialization
      13 Minutes
    • 3.3
      Array Dimensionality
      6 Minutes
    • 3.4
      Array Processing in Java
      11 Minutes
    • 3.5
      Operations : Accessing
      6 Minutes
    • 3.6
      Operations : Traversing
      4 Minutes
    • 3.7
      Operations : Insertion
      24 Minutes
    • 3.8
      Operations : Deletion
      21 Minutes
    • 3.9
      Operations : Merging
      14 Minutes
    • 3.10
      Operations : Linear Search
    • 3.11
      Operations : Binary Search
    • 3.12
      List Matching Problem
  • Linked List
    10
    • 4.1
      What is Linked List?
      13 Minutes
    • 4.2
      Implement Linked List in JAVA
      17 Minutes
    • 4.3
      Operations : IsEmpty
      8 Minutes
    • 4.4
      Operations : Traversing
      16 Minutes
    • 4.5
      Operations : Modifying
      9 Minutes
    • 4.6
      Operations : Searching
      13 Minutes
    • 4.7
      Operations : Insertion
      35 Minutes
    • 4.8
      Operations : Deletion
      28 Minutes
    • 4.9
      Operations : Merging
      6 Minutes
    • 4.10
      Linked List Types
      21 Minutes
  • Recursion
    4
    • 5.1
      Introduction
      64 Minutes
    • 5.2
      Recursion : Numeric Values
      96 Minutes
    • 5.3
      Recursion : String Values
      62 Minutes
    • 5.4
      Recursion : Binary Search
      13 Minutes
  • Algorithm Analysis
    4
    • 6.1
      Introduction
      36 Minutes
    • 6.2
      Complexity Classes
      10 Minutes
    • 6.3
      Algorithm Analysis : Examples
      33 Minutes
    • 6.4
      Practical Problems
      25 Minutes
  • Stack
    7
    • 7.1
      Introduction
      11 Minutes
    • 7.2
      Stack : Basic Operations
      15 Minutes
    • 7.3
      Stack : Usability
      15 Minutes
    • 7.4
      Postfix Evaluation
      30 Minutes
    • 7.5
      Infix to Postfix
      40 Minutes
    • 7.6
      Stack as Array
      49 Minutes
    • 7.7
      Stack as LinkedList
      34 Minutes
  • 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
    شرح تفصيلي لمتطلبات جميع الواجبات، مع الحل والتطبيق العملي خطوة بخطوة لضمان الفهم الكامل وتنفيذها بكفاءة
    2
    • 15.1
      Assignment 1
    • 15.2
      Assignment 2
  • تجميعات
    4
    • 16.1
      Arrays
    • 16.2
      Linked List
    • 16.3
      Recursion
    • 16.4
      Algorithm Analysis
  • مراجعات الميد
    7
    • 17.1
      Arrays Review Questions
    • 17.2
      Linked List Review Questions
    • 17.3
      Mid Exam Fall-22 (بنات)
    • 17.4
      Mid Exam Spring-23 (شباب)
    • 17.5
      Mid Exam Spring-22
    • 17.6
      Mid Exam 3rd Term 2022
    • 17.7
      أسئلة هامة في Stack
  • مراجعات الفاينال لاب
    6
    • 18.1
      Final Lab 2020 Fall (Boys)
    • 18.2
      Final Lab 2021 Summer (Boys)
    • 18.3
      Final Lab 2023 Fall (Boys )
    • 18.4
      Final Lab 2023 Spring (Boys )
    • 18.5
      Final Lab 2023 (Girls)
    • 18.6
      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

Operations : IsEmpty

The lesson content is empty.
Prev السابق Implement Linked List in JAVA
التالي Operations : Traversing Next

تسجيل دخول

نسيت كلمة المرور؟

مستخدم جديد؟ سجل الآن

تسجيل حساب جديد

لديك حساب؟ تسجيل دخول