Data Structure — Winter 2019

Define primitive and non-primitive data types with example.

Differentiate linear and non-linear data structures.

Write algorithms for PUSH and POP stack operations.

Enlist applications of stack and queue.

Evaluate the following postfix expression using stack. Show each step. 5 3 + 6 2 / * 3 5 * +

Write a Cfunctions for insertion and deletion operation in simple queue.

Write an algorithm to delete an element from circular queue. Show the steps of insertion and deletion operation in sample circular queue.

Describe the advantages of linked list over array.

Write an algorithm to insert a node at last position in doubly linked list.

Write an algorithm to print the singly linked list in reverse order using stack.

Describe following terms with respect to binary tree: (1) depth of tree (2) balanced tree (3) complete tree

Construct the binary tree for the following tree traversals. Inorder: B F G H P R S T W Y Z Preorder: P F B H G S R Y T W Z

Write an algorithm to insert a node into binary search tree.

Prove that a binary tree with 20 nodes have 21 null branches.

Write a recursive algorithm for preorder traversal of binary tree.

Describe Prim’s minimum spanning tree algorithm with example.

Show the resultant BST after applying following operations in sequence on given tree. Delete 8 b) Insert 9 c) Delete

Enlist and describe different ways for representing graph data structure with example.

Show the steps of BFS and DFS traversal for following graph starting from vertex 2. Consider adjacency list is sorted in ascending order.1

Write an algorithm for linear searching.

Describe indexing structure for index file.

Write an algorithm for merge sort. Show the steps of its working with sample data.

Define hash function. Describe any two hash methods with example.

Write an algorithm for binary searching.

Apply bubble sort on following data and show all steps. 123, 34, 65, 105, 27, 79, 12, 10, 125, 156