Data Structures — Summer 2020

Differentiate between data types and data structures.

Answer the followings: (1) Give examples of Linear and Non-Linear Data Structures. (2) What do you mean by Abstract Data Types?

Discuss and write a program to implement queue functions using arrays.

Distinguish between stack and queue.

What is top of stack? Why stack is called LIFO list?

What is a circular queue? How do you check the queue full condition? Write an algorithm to count the nodes in a circular queue.

Explain creation, insertion and deletion of doubly linked list with example.

What are binary trees? Mention different types of binary trees with example.

What is a graph? Explain various representations of graphs.

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

What is B -tree of order m? Draw a B-tree of order 3.

Construct a binary tree having the following traversal sequences: Preorder traversal A B C D E F G H I Inorder traversal B C A E D G H F I

Discuss algorithm of Breadth First Search (BFS) traversal for a Graph. Explain with an example.

Explain Sequential file organizations and list its advantages and disadvantages.

How access of record is performed in multi key file organization?1

Describe various collision resolution techniques in hashing.

Explain indexed sequential file structure.

Explain minimal spanning tree.

What is hashing? What are the qualities of a good hash function? Explain any two hash functions in detail.

Define topological sort?

Compare sequential searching with binary searching in detail.

Examine the algorithm for Insertion sort and sort the following array: 77, 33, 44, 11, 88, 22, 66, 55

What do you mean by internal and external sorting?

Write an algorithm for quick sort.

What is Binary Search Tree? Construct a binary search tree for the following elements 21, 16, 24, 18, 22, 25, 26, 27, 29, 332