AD/AG/AL/CD/CY/IO/IS-303 (GS) – Data Structure

Construct a Binary tree for the given traversals (Postorder and Inorder). Also, find the Preorder traversal of the Binary tree so formed.

How a tree can be stored in the memory? Explain with an example. Explain the advantages and disadvantages of the array representation of a tree.

Construct an expression tree for the algebraic expression (3a-b)²(4c+2d)³.

Explain the Binary Search Tree with an example. Make a BST for the given sequence and perform deletions. Also write an algorithm to insert an element into a BST.

Define AVL Trees. Explain its rotation operations with example. Construct AVL Tree by inserting the given data.

Define Huffman tree and describe an algorithm to create a Huffman tree. Construct a Huffman Tree for data structures with its optimal code.

Explain in detail about the graph traversal techniques with suitable example.

Consider the given undirected graph. Find the adjacency list representation and find a minimum cost spanning tree by Kruskal's algorithm.

Write the algorithm to create a heap and sort the given elements using heap sort.

How do you implement a circular queue in C using array? Write routines to implement operations for it. Differentiate between Linear Queue and Circular Queue.

Define doubly linked list. Describe an algorithm to insert an element at the beginning of the doubly linked list. Describe an algorithm to delete an element from the end of doubly linked list. Also explain the advantages and disadvantages of doubly linked list.

Given a 2D array A[-100:100, -5:50]. Find the address of element A[99, 49] considering the base address 10 and each element requires 4 bytes for storage. Follow row-major order.

What do you understand by stable and in-place sorting?

Define Extended binary tree with example.

Define hash function. Discuss various methods used for resolving hash collisions.

Suppose multidimensional arrays A and B are declared. Find the length of each dimension, the number of elements, and address of the element B[3,3,3].