You must be logged in to take this course → LOGIN | REGISTER NOW
Data structures have an important role in the modern computer science. Knowing the principles behind data structure will help you improve your abilities in computer programming and configuration.
This [course_title] is helpful to people who want to interact with data structures and algorithms. It is emphasized that data structures are essential as building blocks to obtain efficient algorithms which you can learn from this course and apply to real-life situations.
Assessment
This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer needs to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.
Certification
Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of the assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.
Having an Official Edukite Certification is a great way to celebrate and share your success. You can:
- Add the certificate to your CV or resume and brighten up your career
- Show it to prove your success
Course Credit: MIT
Course Curriculum
| Module: 01 | |||
| Session 1: Persistent Data Structures | 01:24:00 | ||
| Session 2: Retroactive Data Structures | 01:18:00 | ||
| Session 3: Geometric Structures I | 01:20:00 | ||
| Session 4: Geometric Structures II | 01:22:00 | ||
| Session 5: Dynamic Optimality I | 01:22:00 | ||
| Module: 02 | |||
| Session 6: Dynamic Optimality II | 01:24:00 | ||
| Session 7: Memory Hierarchy Models | 01:23:00 | ||
| Session 8: Cache-Oblivious Structures I | 01:27:00 | ||
| Session 9: Cache-Oblivious Structures II | 01:25:00 | ||
| Session 10: Dictionaries | 01:23:00 | ||
| Module: 03 | |||
| Session 11: Integer Models | 01:21:00 | ||
| Session 12: Fusion Trees | 01:24:00 | ||
| Session 13: Integer Lower Bounds | 01:22:00 | ||
| Session 14: Sorting in Linear Time | 01:24:00 | ||
| Session 15: Static Trees | 01:23:00 | ||
| Module: 04 | |||
| Session 16: Strings | 01:25:00 | ||
| Session 17: Succinct Structures I | 01:20:00 | ||
| Session 18: Succinct Structures II | 01:24:00 | ||
| Session 19: Dynamic Graphs I | 01:14:00 | ||
| Session 20: Dynamic Graphs II | 01:15:00 | ||
| Module: 05 | |||
| Session 21: Dynamic Connectivity Lower Bound | 01:22:00 | ||
| Session 22: History of Memory Models | 00:59:00 | ||
| Assessment | |||
| Submit Your Assignment | 00:00:00 | ||
| Certification | 00:00:00 | ||
Course Reviews
No Reviews found for this course.
Related Courses
