Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Gate Data Science and AI
·
Module 5
Core Data Structures
1
Big-O Analysis of Algorithm Efficiency
Analyze algorithm efficiency using Big-O notation for time and space complexity.
Singly Linked List Implementation
Implement a singly linked list with insertion, deletion, and search operations.
3
Stack Implementation and Parenthesis Matching
Implement a stack and use it to solve a parenthesis-matching problem.
4
Queue Implementation and FIFO Simulation
Implement a queue and use it to simulate a first-in-first-out process.
5
Binary Search Tree: Insertion and Search
Implement a binary search tree with insertion and search operations.
6
Binary Tree Traversal Algorithms
Implement inorder, preorder, and postorder traversal algorithms for a binary tree.
7
Hash Table with Separate Chaining
Implement a hash table using separate chaining for collision resolution.
8
Heaps and Priority Queues
Implement a heap and use it to build a priority queue.
Previous module
Probability and Statistics with Python
Next module
Algorithms: Sorting, Searching, and Design