Assignment 1
What is a data structure? How data structures are classified?
Differentiate linear and non-linear data structure.
Define Linked List. Explain the steps involved in insertion and deletion into a singly and doubly linked list.
What are the merits and demerits of array implementation of lists?
Disadvantages of Array over Linked List.
Assignment 2
Define Stack. Explain Stack ADT and its operations
What are enqueue and dequeue operations?
Explain how to evaluate arithmetic expressions using stacks
Define priority queue with diagram and give the operations. Also give the applications of priority
queues.
What are the postfix and prefix forms of the expression? Explain using example.
Assignment 3
Convert the infix expression ((A + B) – C * (D / E)) + F into a postfix.
Define tree? What are the applications of binary tree?
What is meant by traversing? What are the different types of traversing?
Define a heap. How can it be used to represent a priority queue?
Define Tree. Explain the tree traversals with algorithms and examples.
Tutorial 1
Explain binary search tree ADT in detail.
Define Graph? Explain the various representation of graph with example in detail?
What is a minimum spanning tree? Define minimum cost spanning tree.
Explain the Breadth first search algorithm and Depth first search algorithm.
Define hashing. List out the different types of hashing functions?
Tutorial 2
Give a basic algorithm for searching a binary search tree.
Differentiate between merge sort and quick sort?
Explain hashing. What are applications of hashing?
Write a C program to sort the elements using bubble sort, insertion sort and radix sort.
Write a C program to perform searching operations using linear and binary search.
