Data Structures and Algorithms II Binary Trees Heaps SkipLists and HashMaps
Intermediate
Online
5 Weeks
Free Quick Facts
| Medium Of Instructions | Mode Of Learning | Mode Of Delivery |
|---|---|---|
| English | Self Study | Video and Text Based |
Courses and Certificate Fees
| Fees Informations | Certificate Availability | Certificate Providing Authority |
|---|---|---|
| INR 15868 | yes | Georgia Tech |
The Syllabus
- Welcome to Data Structures & Algorithms!
- Let's Get Started
- Guide to the Course
- Introduction and Overview
- Java Review
- Itera(ble/tor) and Compara(ble/tor)
- Big-O Concepts
- Review
- Introduction and Overview
- Trees
- Tree Traversals
- Module 4 Assignment and Review
- Introduction and Overview
- Searching in a BST
- Adding to a BST
- Removing from a BST
- SkipLists
- Module 5 Assignment and Review
- Introduction and Overview
- Introduction to Heaps
- Heap Operations
- The BuildHeap Algorithm
- Module 6 Assignment and Review
- Introduction and Overview
- Introduction to HashMaps
- Collision Handling: External Chaining
- Collision Handling: Probing Strategies
- Collision Handling: Double Hashing and Wrap-up
- Module 7 Assignment and Review
- Course Exam Preparation
- Practice Exam
- Course Exam
- Congratulations!
Articles
22 Apr'25, 06:42 AM
7 Nov'24, 08:52 AM
12 Apr'24, 10:26 AM
20 Feb'24, 08:36 AM
22 Apr'25, 06:42 AM
7 Nov'24, 08:52 AM
12 Apr'24, 10:26 AM
20 Feb'24, 08:36 AM