JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech IV DATA STRUCTURES Previous Question Paper (January/February - 2023 - R18)

Write down the applications of stack.

What are the advantages and disadvantages of the linked list implementation?

What is double hashing?

Write operations on dictionaries.

List the properties of binary search tree.

Write the properties of Splay Tree.

List out the applications of BFS.

Give the heap sort algorithm. Write the complexity of your algorithm.

Define Trie? What are the properties of Tries?

Give the importance preprocessing for Good suffix heuristic.

What is the complexity of finding maximum and minimum value from an array of n values? Explain the steps of deriving complexity.

Distinguish between the stack and the queue data structures.

Write an algorithm/pseudocode to count the number of nodes in a Singly Linked List?

Assume that a stack is represented using linked list. Write down the algorithms for the following operations:- (i) Push (ii) Pop.

What are the properties of a good hash function? With necessary examples explain four different hashing techniques.

Explain the implementation of skip list representation with an example.

Given input keys {1, 3, 23, 9, 4, 29, 19} and a hash function h(X) = X mod table size. The initial hash table contains 10 slots, with starting index 0. Show the resulting table after rehashing when the load factor= 0.5, using linear probing.

Explain the implementation of deletion of new node in dictionary with an example.

Give an algorithm to perform binary search. Using the algorithm, search for elements 23 and 47 in the given set of elements [12 23 27 35 39 42 50].

Construct a B-Tree with order m=3 for the key values 2, 3, 7, 9, 5, 6, 4, 8, and 1 delete the values 4 and 6. Show the tree in performing all operations.

What is a Red-Black Tree? Mention the properties that a Red-Black tree holds.

Show the results of inserting 43, 11, 69, 72, and 30 into an initially empty AVL tree. Show the results deleting of the node 11 and 72 one after the other from constructed AVL Tree.

Give algorithm for DFS and demonstrate DFS using suitable example.

Write an algorithm/ C program to perform merge sort.

Demonstrate the implementation to do the partition of a list using quick sort and then use insertion sort for sorting sub lists.

Write an algorithm/pseudocode to sort elements using Heap sort technique? Illustrate the working of Heap sort algorithm on the following input: 35, 15, 0, 1, 60.

Demonstrate running time analysis of Brute Force String Matching Algorithm using suitable example.

Discuss in detail about Bad Character Heuristic using suitable example.

List and demonstrate types of tries with an example.

Explain about the Boyer- Moore algorithm.