Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/nitinkedia7/cs210-data-structures

Solutions to assignments of CS201/210 Data Structures course taught at IITG-2017
https://github.com/nitinkedia7/cs210-data-structures

data-structures graph hashing-algorithm heap linked-list queue soritng stack tree

Last synced: 9 days ago
JSON representation

Solutions to assignments of CS201/210 Data Structures course taught at IITG-2017

Host: GitHub
URL: https://github.com/nitinkedia7/cs210-data-structures
Owner: nitinkedia7
License: mit
Created: 2017-08-22T22:12:38.000Z (over 7 years ago)
Default Branch: master
Last Pushed: 2017-12-05T06:58:01.000Z (about 7 years ago)
Last Synced: 2024-12-13T11:43:33.923Z (2 months ago)
Topics: data-structures, graph, hashing-algorithm, heap, linked-list, queue, soritng, stack, tree
Language: C++
Homepage:
Size: 8.95 MB
Stars: 1
Watchers: 1
Forks: 2
Open Issues: 0
Metadata Files:
- Readme: README.md
- License: LICENSE

Awesome Lists containing this project

README

        # 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](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/lab3/160101048_LA3_1.c)

- [Insertionsort using Binary Search](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline5/160101048_OA5_1.cpp)

- [Quicksort](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline4/160101048_OA4_1.c)

- [Finding number of Inversions in a array using Mergesort](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline5/160101048_OA5_2.cpp)

- [Radixsort with Countsort Subroutine](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/practice/radixSort.cpp) 

- [Heapsort](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/labTest2/160101048_LT2_1.c)

### Linked List

- [Reverse a Linked List](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/lab1/160101048_LA1_1.c)

- [Search in a Linked List which may contain a cycle](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline1/160101048_OA1_1.c)

### Stack & Queue

- [Evaluate Post-fix Expression](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/lab1/160101048_LA1_2.c)

- [Find valid Stack Permutation](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline1/160101048_OA1_2.c)

### Tree

- [Create a Binary Tree and Print In/Pre/Postorder](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/lab2/160101048_LA2_1.c)

- [Create and Print Threaded Binary Tree](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/labTest1/160101048_LT1_1.c)

- [Huffman Encoding](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline2/160101048_OA2_2.c)

- [Selection Tree](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline3/160101048_OA3_1.cpp)

- [Binary Search Tree Implementation](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/labTest4/160101048_LT4_1.cpp)

- [Find all input sequences which can generate a given Binary Search Tree ](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline11/160101048_OA11_1.cpp)

### Heap

- [minHeap using array](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline6/160101048_OA6_3.cpp)

- [Priority Queue using minHeap](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/practice/minHeapPQ.cpp)

- [Binomial heap with Commandline Interface](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline6/160101048_OA6_4.cpp)

- [Fibonacci Heap with Commandline Interface](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline7/160101048_OA7_2.cpp)

### Treap

- [Treap Implementation (tree+heap)](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/endSem/160101048_ENDSEM.cpp)

### Graph

- [Bifuricate a connected graph using BFS](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/lab5/160101048_LA5_1.cpp)

- [DFS Traversal using Stack and label all edge types](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/labTest3/160101048_LT3_1.cpp)

- [Connected Components of undirected graph](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline8/160101048_OA8_1.cpp)

- [Tower of Cubes (ACM-ICPC 10051)](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline9/160101048_OA9_1.cpp)

- [Playing with Wheels (ACM-ICPC 10067)](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline9/160101048_OA9_2.cpp)

### Hashing

- [Implement Linear, Quadratic & Double Hashing](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/lab6/160101048_LA6_1.cpp)

- [Delete all instances of a pattern in a string using rolling hash](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline10/160101048_OA10_2.cpp)

- [Compare substrings using hashing by Rabin Karp Algorithm](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline10/160101048_OA10_1.cpp)

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

### Author

[Nitin Kedia](https://github.com/nitinkedia7/)