Data and File Structure — Summer 2018

What is Data Structure? Explain linear and non-linear data structures with examples.

Explain row-major representation and column-major representation of array with suitable examples.

Explain the concept of static memory allocation and dynamic memory allocation with appropriate examples. Also mention the advantages and disadvantages of each.

Write a ‘C’ program to implement a stack using an array.

Write a ‘C’ program to implement a queue using linked list.

State and explain the applications of stacks with examples.

Convert the following infix expression to postfix using stack x ^ y / (5 - z) + 10*e

Explain circular queue, double ended queue and priority queue with examples.

Write an algorithm or code in ‘C’ to search, insert, delete and delete element from a linked list.

What is a threaded binary tree? State how to create a threaded binary tree with example.

Write an algorithm or ‘C’ program to create a doubly linked list and display it in reverse order.

What is AVL tree? State the different rotations in AVL tree with examples.

Given the following data: 57,32,48,45,68,63,75,78,60,30. Draw a binary search tree for the given data and give inorder, preorder and postorder traversal for the same,

What is a Graph? Explain the adjacency list and adjacency matrix representation of Graph with example.

Discuss BFS and DFS in graph with example.

What is hashing? What is a hashing function? State and explain in brief the collision resolution techniques in hashing.

Explain Sequential, Indexed and Relative/Random File Organization.