problem 1) Answer all problems.

i) prepare down the difference between Linear and non-linear data structure.

ii) What is stack?

iii) What is linked lists?

iv) prepare down the difference between malloc() and calloc() function.

v) What is binary tree?

problem 2) prepare a program to delete the node whose location is given.

problem 3) prepare a program to traverse binary tree.

problem 4) prepare a program to short the array using quick sort.

problem 5) Answer all the problems.

i) What is AVL tree?

ii) prepare down the difference between AVL tree and BST.

iii) What is graph representation?

iv) What is reflexive transitive closure?

v) What is adjacency matrix, how it represents a simple graph.

problem 6) prepare a program to create Binary Search Tree.

problem 7) prepare a program to traverse a graph with BFT and DFT.

problem 8) prepare comparison between Floyd’s and Dijkstra’s algorithms.