02-01-2021, 05:47 PM
Topic
Data Structure with Ismail Habib
Description
Welcome to Data Structure with Ismail Habib
Course Duration (30 hours in total):
15 sessions (once per week) every session 2 hours
Prerequisites:
Basic understanding of programming and control statements
Topics covered:
1) basic data types.
2) arrays
3) dynamic arrays
3) linked lists
4) stack
5) queue
6) skip lists
7) trees, binary, AVL, marray splay
8) hashing: chaining, probing,
7) heaps, binary heaps, d heaps leftist, binomial queues
8) priority queues
9) graphs, shortest path, traversal, network flow
10) algorithms gready, dynamic, randomized algorithms, probablistic algorithms.
11) string algorithms
12) las Vegas and mont carlo algorithms.
13) probablistic algorithms.
14) top down splay trees
15) red black trees
16) treaps
17) suffix arrays
18) k-d trees
19) pairing heap
Jan 2, 2021 08:00 PM
Jan 9, 2021 08:00 PM
Jan 16, 2021 08:00 PM
Jan 23, 2021 08:00 PM
Jan 30, 2021 08:00 PM
Feb 6, 2021 08:00 PM
Feb 13, 2021 08:00 PM
Feb 20, 2021 08:00 PM
Feb 27, 2021 08:00 PM
Mar 6, 2021 08:00 PM
Mar 13, 2021 08:00 PM
Mar 20, 2021 08:00 PM
Mar 27, 2021 08:00 PM
Apr 3, 2021 08:00 PM
Apr 10, 2021 08:00 PM
سجل الان للحصول على لينك المحاضرة:
https://elsevier.zoom.us/webinar/registe...sdYi45r83w
لمتابعة الجروب الخاص بهذا الكورس المجاني:
https://www.facebook.com/groups/48341137...?ref=share
Data Structure with Ismail Habib
Description
Welcome to Data Structure with Ismail Habib
Course Duration (30 hours in total):
15 sessions (once per week) every session 2 hours
Prerequisites:
Basic understanding of programming and control statements
Topics covered:
1) basic data types.
2) arrays
3) dynamic arrays
3) linked lists
4) stack
5) queue
6) skip lists
7) trees, binary, AVL, marray splay
8) hashing: chaining, probing,
7) heaps, binary heaps, d heaps leftist, binomial queues
8) priority queues
9) graphs, shortest path, traversal, network flow
10) algorithms gready, dynamic, randomized algorithms, probablistic algorithms.
11) string algorithms
12) las Vegas and mont carlo algorithms.
13) probablistic algorithms.
14) top down splay trees
15) red black trees
16) treaps
17) suffix arrays
18) k-d trees
19) pairing heap
Jan 2, 2021 08:00 PM
Jan 9, 2021 08:00 PM
Jan 16, 2021 08:00 PM
Jan 23, 2021 08:00 PM
Jan 30, 2021 08:00 PM
Feb 6, 2021 08:00 PM
Feb 13, 2021 08:00 PM
Feb 20, 2021 08:00 PM
Feb 27, 2021 08:00 PM
Mar 6, 2021 08:00 PM
Mar 13, 2021 08:00 PM
Mar 20, 2021 08:00 PM
Mar 27, 2021 08:00 PM
Apr 3, 2021 08:00 PM
Apr 10, 2021 08:00 PM
سجل الان للحصول على لينك المحاضرة:
https://elsevier.zoom.us/webinar/registe...sdYi45r83w
لمتابعة الجروب الخاص بهذا الكورس المجاني:
https://www.facebook.com/groups/48341137...?ref=share