محاضر كورس هياكل البيانات
mycodeschool
mycodeschool is an educational initiative. Our aim is to present some core concepts of computer programming through illustrated examples and creative teaching techniques.
You can send your feedback to mycodeschool [at] gmail [dot] com
Visit: www.mycodeschool.com
Some good resources to learn and practice programming:
TopCoder - http://community.topcoder.com/tc
Codeforces - http://codeforces.com/
Some good resources to practice for programming interviews:
Nice article on how
تفاصيل الكورس
- عدد الدروس 42
- مدة الكورس 9س 46د
- لغة الكورس انجليزى
- عدد الطلاب 5
- يفضل الدراسة اولاً CS50
-
(1)
- ادرس الكورس مجانا
سجل فى الكورس لتحصل على شهادة اتمام معتمدة
دروس كورس هياكل البيانات
- 1 | Introduction to data structures 00:06:33
- 2 | Data Structures: List as abstract data type 00:13:08
- 3 | Introduction to linked list 00:17:13
- 4 | Data Structures: Arrays vs Linked Lists 00:12:16
- 5 | Linked List - Implementation in C/C++ 00:13:58
- 6 | Linked List in C/C++ - Inserting a node at beginning 00:12:50
- 7 | Linked List in C/C++ - Insert a node at nth position 00:15:15
- 8 | Linked List in C/C++ - Delete a node at nth position 00:12:30
- 9 | Reverse a linked list - Iterative method 00:13:50
- 10 | Print elements of a linked list in forward and reverse order using recursion 00:14:24
- 11 | Reverse a linked list using recursion 00:08:55
- 12 | Data structures: Introduction to Doubly Linked List 00:07:13
- 13 | Doubly Linked List - Implementation in C/C++ 00:15:21
- 14 | Data structures: Introduction to stack 00:08:26
- 15 | Data structures: Array implementation of stacks 00:13:09
- 16 | Data Structures: Linked List implementation of stacks 00:10:58
- 17 | Reverse a string or linked list using stack. 00:16:25
- 18 | Check for balanced parentheses using stack 00:14:13
- 19 | Infix, Prefix and Postfix 00:13:38
- 20 | Evaluation of Prefix and Postfix expressions using stack 00:14:10
- 21 | Infix to Postfix using stack 00:18:20
- 22 | Data structures: Introduction to Queues 00:09:19
- 23 | Data structures: Array implementation of Queue 00:14:59
- 24 | Data structures: Linked List implementation of Queue 00:14:17
- 25 | Data structures: Introduction to Trees 00:15:50
- 26 | Data structures: Binary Tree 00:16:17
- 27 | Data structures: Binary Search Tree 00:19:28
- 28 | Binary search tree - Implementation in C/C++ 00:18:36
- 29 | BST implementation - memory allocation in stack and heap 00:13:04
- 30 | Find min and max element in a binary search tree 00:05:48
- 31 | Find height of a binary tree 00:07:09
- 32 | Binary tree traversal - breadth-first and depth-first strategies 00:11:54
- 33 | Binary tree: Level Order Traversal 00:11:23
- 34 | Binary tree traversal: Preorder, Inorder, Postorder 00:14:29
- 35 | Check if a binary tree is binary search tree or not 00:16:30
- 36 | Delete a node from Binary Search Tree 00:18:27
- 37 | Inorder Successor in a binary search tree 00:17:58
- 38 | Data structures: Introduction to graphs 00:16:43
- 39 | Data structures: Properties of Graphs 00:15:16
- 40 | Graph Representation part 01 - Edge List 00:13:45
- 41 | Graph Representation part 02 - Adjacency Matrix 00:14:45
- 42 | Graph Representation part 03 - Adjacency List 00:27:50
تقييمات الطلاب
5/5
( 1 )
بعض التقييمات
y
youtube
08-07-2023