Data Structure

(a) Consider the Linear Array aaa(5:50), bbb(-5:10) and cc(18).

(I) Find the number of elements in each array.

(ii) Suppose Base (aaa)=300 and w=4, words for memory cell for aaa. Find the address of aaa(15), aaa(35) and aa[55]. 

(d) What are the different ways of representing a graph? Generate following graph in them. 

Write down short note on:

(b) Circular queue

Write down short note on:

(a) Bucket Hashing & Collision Resolution

Explain the term used in tree with example-

(h) Ancestors and Descendent

Explain the term used in tree with example-

(g) Root

Explain the term used in tree with example-

(f) Generation

Explain the term used in tree with example-

e) Degree of Node

Explain the term used in tree with example-

(d) Height/Depth

Explain the term used in tree with example-

(c) Level number

Explain the term used in tree with example-

(b) Sibling/Brother

Explain the term used in tree with example-

(a) Terminal node/leaf.

(e) What is meant by term Row Major Order and Column Major Order in Array?How do we calculate the address of an element in a row major two dimensional array?

(a) Write a procedure/program to reverse a singly linked without using anymore memory? 

(c) What is a height balanced tree? Explain with the help of suitable example.

(b) Explain terms: sink node, source node, connected and strongly connected graph. 

(a) Differentiate between Merge Sort and Quick Sort.

(b) Explain Selection sort and Sort the following item using action sort

      8, 22, 7, 9, 31, 19, 5, 13, 58, 93, 1, 45.

(a) What do you mean by minimum spanning tree? generate minimum spanning tree for the following graph.

What is the role of Binary Search Tree? Give the algorithm for insertion and deletion of a node in binary search tree. Give an example. 

Construct the AVL tree if following elements are inserted in order.

10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 150, 130, 15

(b) Derive the Time Complexity of the linear search in average and worst case.

(b) Write a program/algorithm to evaluate a postfix expression using stack?Consider the following infix expression and convert into postfix expression using stack.

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