CS210-Data-Structures

Course- CS201 Data Structures Theory, CS210 Data Structures Lab (by Prof. Chandan Karfa)

Languages Used- C/C++

Selected Problems:

Arrays and Sorting

• Bubblesort
• Insertionsort using Binary Search
• Quicksort
• Finding number of Inversions in a array using Mergesort
• Radixsort with Countsort Subroutine
• Heapsort

Linked List

• Reverse a Linked List
• Search in a Linked List which may contain a cycle

Stack & Queue

• Evaluate Post-fix Expression
• Find valid Stack Permutation

Tree

• Create a Binary Tree and Print In/Pre/Postorder
• Create and Print Threaded Binary Tree
• Huffman Encoding
• Selection Tree
• Binary Search Tree Implementation
• Find all input sequences which can generate a given Binary Search Tree

Heap

• minHeap using array
• Priority Queue using minHeap
• Binomial heap with Commandline Interface
• Fibonacci Heap with Commandline Interface

Treap

• Treap Implementation (tree+heap)

Graph

• Bifuricate a connected graph using BFS
• DFS Traversal using Stack and label all edge types
• Connected Components of undirected graph
• Tower of Cubes (ACM-ICPC 10051)
• Playing with Wheels (ACM-ICPC 10067)

Hashing

• Implement Linear, Quadratic & Double Hashing
• Delete all instances of a pattern in a string using rolling hash
• Compare substrings using hashing by Rabin Karp Algorithm

Problems involving specific scenarios which are to be solved using one's knowledge of data structures are also present.

Author

Nitin Kedia