Data Structures

What is Data structure?

Explain Asymptotic Notations?

What are linear and non-linear data structural?

What is linked list? What are its types?

Write applications of stacks.

Define complete Binary Tree?

Differentiate between static and Dynamic memory allocation.

What is the concept of minimum spanning Tree?

What is meant by abstract data type?

Compare tree and graph.

Explain tower of Hanoi problem in detail and write algorithm for that.

Calculate the address of the element A[15,25] using row major order and column major order for an array A[-15...10, 15...40] of elements. It is stored at location 100 and the size of each element is 4 bytes.

Write an algorithm to insert a node at specific location in circular linked list.

The in-order and pre-order traversal sequence of nodes in a binary tree are given below:

In-order: Q, B, K, C, F, A, G, P, E, D, H, R

Pre-order: G, B, Q, A, C, K, F, P, D, E, R, H

Draw the binary tree.

What is Priority Queue? How can it be implemented? Write an applications of priority Queue.

Convert the following expression into its equivalent postfix expression.

A+(BC - (D/E^F)G)*H

Differentiate single linked list and circular linked list. Also write the advantage and disadvantages of circular linked list.

Define the spanning tree. Write the Kruskal's algorithm to find the minimum cost spanning tree of the following.

What is an AVL Tree? Explain the concept of Balancing factor. Create an AVL tree using following sequence: 21, 26, 30, 9, 4, 14, 28, 18, 15, 10, 2, 3, 7

What is hashing and collision? Discuss the advantages and disadvantages of hashing over other searching techniques.

Write an algorithm of Insertion sort. Sort the following elements using Insertion sort: 68, 17, 26, 54, 77, 93, 31, 44, 55, 20

Write down the algorithm for following operations of doubly linked list:

a) Insertion of a node in the middle location.

b) Delete a node from last location.