Skip to content
CS210: Data Structures by Tala
التجربة المجانية
Sample Lesson
Collapse
التجربة المجانية
6 Topics
Introduction to CS210
0.2: How to get an A+ in this course
Course content
Array Adding
Remove from head SLL
Insertion complexity
1. Introduction
Expand
1. Introduction
4 Topics
Course intro
How to get an A+ in this course
Course content
What are data structures? (week 1)
2. Arrays
Expand
2. Arrays
5 Topics
|
1 Quiz
Arrays
Array Adding
Array removing
Assignment Solving
Array sum
CS210 Arrays Quiz
3. Singly Linked List
Expand
3. Singly Linked List
10 Topics
|
1 Quiz
SLL
SLL methods
Traverse SLL
Insert at head SLL
Insert at tail SLL
Insert at index SLL
Remove from index SLL
Remove from head SLL
Remove tail SLL
Sll sum
CS210 SLL Quiz
4. Doubly Linked List
Expand
4. Doubly Linked List
10 Topics
|
1 Quiz
DLL
Java of DLL
DLL METHODS
Add to header DLL
Remove header DLL
Add to trailer DLL
Remove trailer DLL
Add to index DLL
Remove index DLL
Dll sum
CS210 DLL Quiz
5. Circular Linked List
Expand
5. Circular Linked List
7 Topics
|
1 Quiz
CLL
Loop in CLL
Add first CLL
Add last CLL
Rotate CLL
All Lists tutorial solving
Cll sum
CS210 CLL Quiz
6. Quiz 1 Review
Expand
6. Quiz 1 Review
5 Topics
Quiz 1 term 241
Quiz 1 term 241 code
Quiz 1 Dr. Najla sample
Quiz 1 Dr. Sawsan 241
Quiz1 Dr. Basit 242
7. Algorithm Analysis (Big Oh)
Expand
7. Algorithm Analysis (Big Oh)
11 Topics
Analysis of algorithms الفكرة
Constant time operations
The 7 functions
Graphs
O(n)vsT(n)
Big oh
Worst case
Big oh practice
Big oh proving
Algorithm Analysis tutorial solving
Big oh sum
8. Recursion
Expand
8. Recursion
7 Topics
Recursion
Linear recursion
Log recursion
Exponential recursion
Tracing
Tutorial solving
Recursion sum
9. Major 1 ✅
Expand
9. Major 1 ✅
6 Topics
Major 1 242
Major 1 241
Major 1 231
Major 1-231 T(n) continuation
Major 1 T(n) practice
Major 1 212 (optional)
10. Sorting
Expand
10. Sorting
15 Topics
Sorting
Selection sort
Selection complexity
Insertion sort
Insertion complexity
Merge Sort
Merge code
Merge complexity
Bottom up merge
Quicksort
Quick sort how to?
Quick code
Quick complexity
Sorting summary + stability
Sorting sum
11. Stacks and queues
Expand
11. Stacks and queues
8 Topics
Stack
Stack example
Array- based stack
Arithmetic stack
Queue
Queue Example
Array-based queue
Stack and queue sum
12. Quiz 2 ✅
Expand
12. Quiz 2 ✅
6 Topics
12.1: Quiz 2 241(Sawsan)
12.2: Quiz 2 2…م جدا)
12.3: Quiz 2 242 (nada)
12.4: Quiz 2 242 (sawsan)
12.5: Quiz 2 242 (najla)
12.6: Quiz 2 251 (basit)
13. Trees
Expand
13. Trees
9 Topics
Trees + code
Binary Tree
Pre-order
Post order traversal
In-order
Arithmetic printing
Array representation
Linked structure
Trees sum
14. Binary search tree
Expand
14. Binary search tree
6 Topics
BST
BST Inserting
BST deletion
BST Searching
BST big-oh
BST sum
15. Major 2 ✅
Expand
15. Major 2 ✅
6 Topics
Major 2 242
Major 2 241
Major 2 232
Major2 212
Major2 231
Major2 221
16. AVL
Expand
16. AVL
6 Topics
AVL tree
AVL Height
Rotations
AVL Insertion
AVL deleting
Avl sum
17. Heaps and Priority Queues
Expand
17. Heaps and Priority Queues
8 Topics
PQ
PQ example
Heaps
Inserting heap
Max heap practice
Min heap practice
Array-based
Heap sum
18. Hashing
Expand
18. Hashing
7 Topics
Hashing
Seperate chaining
Sc example
Linear probing
Lp example
Double hashing
Double hash….خااص لطلاب د.نجلاء
19. Graphs
Expand
19. Graphs
11 Topics
Undirected Graphs
Adjacency matrix
Adjacency list
DFS-undirected
BFS – undirected
Directed graphs
Adjacency matrix + list-directed
DFS-directed
BFS-directed
Weighted graph
Graphs sum
20. Final ✅
Expand
20. Final ✅
5 Topics
222-F
231-F
232-F
Final AVL practice
242 -F
Project 1
Expand
Project 1
4 Topics
Project 1 Dr. Nada 242
Project 1 Dr. Sawsan 242
Project 1 Dr. Najla 242
Project 2 dr. Najla
Project 2
Expand
Project 2
2 Topics
Dr. Sawsan 242.mp4
Basit project 242
Previous Topic
Next Topic
Course content
⏱ 03:06
CS210: Data Structures by Tala
499.00
اشترك الآن