uLektz Skills

Learning Path

Non-Linear: Random Order

About the Course

Course Description

This course provides students with concepts of Dictionaries: Sets, Dictionaries, Hash Tables, Open Hashing, Closed Hashing (Rehashing Methods), AVL Trees: Maximum Height of AVL Tree, Priority Queues: Binary Heaps: Implementation of Insert and Delete min, Creating Heap and Graph algorithms : Minimum-Cost Spanning Trees- Prim's Algorithm, Kruskal's Algorithm

Objectives

1.Will familiarize about Shortest Path Algorithms: Dijkstra's Algorithm

2.Will demonstrate Sorting Methods : Order Statistics

3.Will develop knowledge in Fundamental File Processing Operations-opening files, closing files

Prerequisite

There is no particular prerequisite to learn Advanced Data Structures, you will be able to do very well, if you have these basic skills:

1. Basic Analytics Skills

2. Good Understanding Skills

3. Good Communication Skills

Course Study Materials

Module 1: Dictionaries

1.1 Dictionaries: Sets, Dictionaries, Hash Tables, Open Hashing, Closed Hashing (Rehashing Methods)
1.2 Hashing Functions (Division Method, Multiplication Method, Universal Hashing)
1.3 Skip Lists, Analysis of Skip Lists
Dictionaries 10 Questions

Module 2: AVL Trees

2.1 AVL Trees: Maximum Height of AVL Tree
2.2 Trees : Insertion, Deletion
AVL Trees 8 Questions

Module 3: Priority Queues and Binomial Queues

3.1 Priority Queues: Binary Heaps: Implementation of Insert and Delete min, Creating Heap
3.2 Binomial Queues : Binomial Queue Operations
Priority Queues and Binomial Queues 8 Questions

Module 4: Graph Algorithms

4.1 Graph algorithms : Minimum-Cost Spanning Trees- Prim's Algorithm, Kruskal's Algorithm
4.2 Shortest Path Algorithms: Dijkstra's Algorithm
Graph Algorithms 8 Questions

Module 5: Sorting Methods

5.1 Sorting Methods : Order Statistics
5.2 Heap Sort, Quick Sort, Radix Sorting, Merge Sort
Sorting Methods 8 Questions

Module 6: Pattern Matching and Tries

6.1 Pattern matching and Tries
6.2 Tries: Definitions and concepts of digital search tree, Binary trie, Patricia
6.3 File Structures: Fundamental File Processing Operations-opening files, closing files
Pattern Matching and Tries 8 Questions

Final Assessment

Final Assessment 20 Questions

The certificate issued for the Course will have

Student's Name
Photograph
Course Title
Certificate Number
Date of Course Completion
Name(s) and Logo(s) of the Certifying Bodies

Only the e-certificate will be made available. No Hard copies. The certificates issued by The Academic Council of uLektz. can be e-verifiable at www.ulektzskills.com/verify.

Students will be assessed both at the end of each module and at the end of the Course.
Students scoring a minimum of 50% in the assessments are considered for Certifications