- Home
- All Courses
- Academic
- Academic Fall2025
- M269 Algorithms & data structures-Python (Spring 26)
Curriculum
- 10 Sections
- 125 Lessons
- 22 Weeks
Expand all sectionsCollapse all sections
- M269 Final Days مراجعات 20258
- 1.1M269_Final Summer_25 (MCQ)20 Minutes
- 1.2M269_Final Summer_25 (Complexity)
- 1.3M269_Final Summer_25 (paradigm- algorithm-Euler)
- 1.4M269_Final Summer_25 (Binary Search Traversal)Copy
- 1.5M269_Final Summer_25 (Euler-DFS BFS Kruskal)Copy
- 1.6M269_Final Summer_25 (Djikstra Algorithm)Copy
- 1.7M269_Final Summer_25 (Floyed Warshall Algorithm)Copy
- 1.8M269_Final Summer_25 (Desgin Algorithm)Copy
- Section 4: M269_Final_Lectures12
- 2.1خطة الاستعداد للفاينالCopy
- 2.21_M269 lect_7 Search (1)Copy
- 2.32_M269 lect_7 hash table_BinaryTree (2)Copy
- 2.43_M269 lect_7 QuickSelect (3)Copy
- 2.54_M269 lect_8 KMP_NaiveBinaryTreeCopy
- 2.65_M269 Lect_9_Graph (1)Copy
- 2.76- M269 Lect_9_Dijkstra_Kruskal (2)Copy
- 2.87_M269 lect9 Kruskal(3)Copy
- 2.98_M269 lect_10_floyd_Warshal (1)Copy
- 2.109_M269 lect_10 (2)Copy
- 2.1110_M269 lect_11 TuringMachine_ComputabilityCopy
- 2.1211_M269_SQL_ExampleCopy
- Section 5: M269_Final_Exams (new)24
- 3.11-M269 Final Spring 24 (1) (MCQ+Complexity)Copy
- 3.22-M269 Final Spring 24 (2) (HashTable)Copy
- 3.33-M269 Final Spring24 (3) (Euler – Graph)Copy
- 3.44-M269 Jan23 (A) (MCQ+Complexity-Essay)Copy
- 3.55-M269 Jan23 (B) (Max Heap – Hash Table)Copy
- 3.66-M269 Jan23 (C) (Complexity- Master Therorem)Copy
- 3.77-M269 Jan23 (D) (Euler – DFS BSF -MST Kruskal)Copy
- 3.88-M269 Jan23 (E) (Dijikstra algorithm – shortest path)Copy
- 3.99-M269 Jan23 (F) (floyd warshall algorithm)Copy
- 3.1010-M269 Jan23 (F) (floyd warshall algorithm) UpdatedCopy
- 3.1111-M269 Final May 22 (1) (Euler – DFS- Kruskal)Copy
- 3.1212-M269 Final May 22 (2) Dijkistra algorithmCopy
- 3.1313-M269 Final May 22 (3) (Floyd Warshall algorithm)Copy
- 3.1414-M269 Final May 22 (4)(Floyd Warshall algorithm)Copy
- 3.1515-M269_Final revision 2022_1Copy
- 3.1616-M269_Final_revision_2022_2Copy
- 3.1717-M269_Final revision 2022_3Copy
- 3.1818-M269_Final revision 2022_4Copy
- 3.1919-M269_Final revision 2022_5Copy
- 3.2020-M269_Final revision 2022_6Copy
- 3.2121-M269_Final revision 2022_7Copy
- 3.2222-M269_Final_Apri(4) Complexity & recursionCopy
- 3.2323-M269_Final_April(5) hash tableCopy
- 3.2424-M269 Final Exam Jan 2023 (Design Algorithm)Copy
- Section 6: M269_Final_Revision_Extra18
- 4.11-M269_Final_Kuwait (1) (MCQ- Paradigm- Hash Table – Complexity)Copy
- 4.22-M269_Final_Kuwait (2) (Algorithm Problem)Copy
- 4.33-M269_Final_Kuwait (3) (Draw Graph – Euler -Kruskal – Dijikstra)Copy
- 4.44-M269_Final_SA (1) MCQCopy
- 4.55-M269_Final_SA (2) (Paradigm – Binary Search -Problem -Types)Copy
- 4.66-M269_Final_SA (3) (Algorithm problem – Kruskal)Copy
- 4.77-M269_Final_SA (4) (Draw Graph – DFS -BFS – Complexity)Copy
- 4.88-M269_Final_jan (1) (MCQ – Data Structure)Copy
- 4.99-M269_Final_jan (2) (Complexity – Naive Pattern)Copy
- 4.1010-M269_Final_jan (3) (Kruskal- Dijikstra – complexity – Recursion)Copy
- 4.1111-M269_Final_SA April (1) (MCQ- Complexity -Heap – Traversal)Copy
- 4.1212-M269_Final_SA April (2) (Kruskal- Dijikstra – Floyed Warshal)Copy
- 4.1313-M269_FinalRev(1) (Binary Search)Copy
- 4.1414-M269_FinalRev (2) QuickSelect_BinarySearchCopy
- 4.1515-M269_FinalRev (3)_Heap_Dijkstra_BFS_DFSCopy
- 4.1616-M269_FinalRev (4)_Floyd_warshal_KMPCopy
- 4.1717-M269_FinalRev (5) Graph_EulerPathCopy
- 4.1818-M269_Final_Definitions_ch10_11Copy
- M269 MTA 2025 أستعد للميدتيرم23
- 5.11_M269 MTA Kuwait 2024 (A)Copy
- 5.22_M269 MTA Kuwait 2024 (B)Copy
- 5.33_M269_MakeUp (A)Copy
- 5.44_M269_MakeUp (B)Copy
- 5.55_M269_MakeUp (C)Copy
- 5.65_M269_MakeUp (D)Copy
- 5.77_M269 MTA Spring 2024 (A)Copy
- 5.88_M269 MTA Spring 2024 (B)Copy
- 5.99_M269 MTA Spring 2024 (C)Copy
- 5.1010_M269 MTA MOCK (1)Copy
- 5.1111_M269 MTA MOCK (2)Copy
- 5.1212_M269 MTA MOCK (3)Copy
- 5.1313_M269 MTA MOCK (4)Copy
- 5.1414_M269 MTA MOCK (5)Copy
- 5.1515_M269_MTA Fall23 (1)Copy
- 5.1616_M269_MTA Fall23 (2)Copy
- 5.1717_M269_MTA Fall23 (3)-Copy
- 5.1818_M269_MTA Fall23 (4)Copy
- 5.1919_M269_MTA Fall23 (5)-Copy
- 5.2020_M269 MTA Spring23 (1)Copy
- 5.2121_M269 MTA Spring23 (2)Copy
- 5.2222_M269 MTA Spring23 (3)Copy
- 5.2323_M269 MTA Spring23 (4)Copy
- Section 1: M269 MTA SESSIONS23
- 6.11- M269 MTA Study Plan 2025Copy18 Minutes
- 6.22- Install Python IDE ThoneyCopy
- 6.33-M269_Unit_1_ProblemToProgramCopy
- 6.44-M269_U1_part2Copy
- 6.55- M269_U1_part3 (reading)Copy
- 6.66- M269_U2_DataStructure (1)Copy
- 6.77- M269_U2_stack(2)Copy
- 6.88- M269_U2_linked_list(3)Copy
- 6.99- M269_U2_implement_Stack(4)Copy
- 6.1010- M269_U2_doubly linked list(5)Copy
- 6.1111- M269_U3_Tree (1)Copy
- 6.1212- M269_U3_Recursion (2)Copy
- 6.1313- M269_U4_BubbleSort(1)Copy
- 6.1414- M269_U4_InsertionSort(2)Copy
- 6.1515- M269_U4_selectionSort(3)Copy
- 6.1616- M269_U4_mergeSort(4)Copy
- 6.1717- M269_U4_QuickSort(5)Copy
- 6.1818- m269_U5_HeapSort(1)Copy
- 6.1919- M269_U5_HeapSort(2)Copy
- 6.2020- M269_U5_ MasterTheorem(3)Copy
- 6.2121- M269_Python_Basics_1Copy
- 6.2222- M269_Python_Basics_2Copy
- 6.2323- M269_Bubble sorting algorithmCopy
- Section 2: M269 MTA Revision4
- Section 3: M269 MTA Exams4
- Quiz Area1
- M269_Design Algorithm9
- 10.11_M269 Design Algorithm (Birds – Nest)Copy
- 10.22_M269 Design Algorithm (Train Arrival Times)Copy
- 10.33_M269 Design Algorithm (Kids – Chair Position)Copy
- 10.45_M269 Design Algorithm (min Box Hight)Copy
- 10.56_M269 Design Algorithm (Character Arrangement)Copy
- 10.67_M269 Design Algorithm (power of excercise)Copy
- 10.78_M269 Design Algorithm (Mug match)Copy
- 10.89_M269 Design Algorithm (Max price of Wood cuts)Copy
- 10.910_M269 Design Algorithm ()Copy
9_M269 Design Algorithm (Max price of Wood cuts)Copy
Prev