This repository contains , assignment solutions for DSA , CSE 2020-21 ,NIT Calicut .
ASSIGNMENT 1 :
Read the below provided pdf for detailed questions .
Pdf file of Assignment 1 questions
- Paranthesis Representation of Binary Trees
- Cousins of a node X in binary tree
- Count of BST's whose sum equals k in binary tree
- BST implementation in C
- Kth Smallest number in BST
- Construct height balanced tree from an ascending order array in O(nlogn) time comp
ASSIGNMENT 2 :
Read the below provided pdf for detailed questions .
Pdf file of Assignment 2 questions
- Hash-Table(quadratic probing and double hashing)
- Hash-Tables(Chaining)
- Hash-Tables( Special-Anagram & Chaining in lexiographical order)
- AVL Tree Implementation in C
- BST without parent feild
- Max-Element in the path from node a to node b in BST
- Construct height balanced tree from an ascending order array in O(nlogn) time comp
ASSIGNMENT 3 :
Read the below provided pdf for detailed questions .
Pdf file of Assignment 3 questions
- AVL Tree Implementation in C
- AVL-TREE Sort
- Red-Black Trees Implementation in C ( without parent feild in the node)
- Binomial Heaps Implementation in C
ASSIGNMENT 4 :
Read the below provided pdf for detailed questions .
Pdf file of Assignment 4 questions
1 ADJ.Representation in C
2 Prims_Algorithm in C
4 BFS and DFS in C
5 Negative Cycle -Detection in a Graph
6 Fibonnaci Heaps implementation in C
7 Disjoint Sets Implementation in C