Data Structure — Winter 2021

What do you mean by Data Structure? Give the difference between Primitive and Non-primitive data structures.

Convert following infix expressions to the postfix expressions. Shows stack trace. A/B$C+D*E/F-G+H (A+B)*D+E/(F+G*D)+C

Discuss advantages and disadvantages of linked list over array.

What is Stack? Write down algorithms for performing POP and PEEP operations on a stack.

What is Tower of Hanoi? Explain it with n=3.

What do you mean by FIFO and LIFO?

Write an algorithm to perform insert, delete and display operations for simple queue.

Explain double ended queue.

Explain the concept of circular queue. Compare circular queue with simple queue.

Write a ‘C’ function to 1) deletion of a node at location ‘LOC’ from a singly linked list. 2) insert a node in beginning of a singly linked list.

differentiate between stack & queue.

Explain Doubly linked list.

Write an algorithm to perform insert and delete operations on a circular Queue.

What is tree?

Explain representation of a binary tree using Array.

Define Graph. Write an algorithm to do BFS traversal of a Graph

Explain Sequential search method.

Explain following with reference to graphs.

Weighted Graph (ii) Connected Graph

Explain binary tree traversals with proper example.

Briefly explain insertion sort.

Write a ‘C’ function for selection sort.

Explain various Hash collision resolution techniques with example.

Define following terms: Sequential, direct and Index sequential access of files.

Write a ‘C’ program for Bubble sort.

Explain Merge sort with proper example.