AKTU

DATA STRUCTURE (BCS301 )

(Important Topics & Questions)
 Unit-1
(Important Topics & Questions)
Topic: Basic Concepts of Data Structures
• Define the term Data Structure. List some linear and non-linear data structures stating
the application area where they will be used. (2017-18).
• Define Time-Space trade-off. (2020-21).
• What are the advantages and disadvantages of arrays over linked lists? (2022-23).
• List the advantages of doubly linked lists over singly linked lists. (2021-22)
• Define best case, average case, and worst case for analyzing the complexity of a program.
(2022-23)
• What are the various asymptotic notations?
• Each element of an array Data [20][50] requires 4 bytes of storage. Base address of Data
is 2000. Determine the location of Data [10][10] when the array is stored as:
(i) Row major
(ii) Column major
Topic: Linked List
• Write a Pseudo code that will concatenate two linked lists. Function should have two
parameters, pointers to the beginning of the lists and the function should link second list
at the end of the first list. (2023-2024)
• How will you create link list representation of a polynomial. Explain it with the suitable
example. (2023-2024)
 Unit-2
(Important Topics & Questions)
Topic: Stack
• Write a C program to reverse a string using a stack. (2017-18)
• Evaluate the following postfix expression using a stack: 2 3 9 * + 2 3 ^ - 6 2 / +. Show the
steps and find the equivalent prefix form. (2020-21)
• Write an algorithm for converting infix expression into postfix expression. Trace for Q: A +
(B * C – (D / E ^ F) * G) * H. (2022-23)
• Write an algorithm to evaluate an arithmetic expression using stack and show how the
expression 3*(5-3) will be evaluate. (2023-24)
Topic: Queues
• Explain circular queue. What is the condition if circular queue is full? (2017-18).
• Write the full and empty condition for a circular queue. (2020-21).
• What is circular Queue? Write a C code to insert an element in circular queue. (2022-23).
• A double ended Queue (deque) is a linear list in which additions may be made at either
end. Obtain a data representation mapping a deque into one dimensional array. Write C
function to add and delete elements from either end of deque. (2023-24)
Topic: Hashing
• Explain hashing techniques with examples. Count the total number of collisions in linear
probing. (2020-21).
• What is Hashing? Explain division method to compute the hash function and collision
resolution strategies. (2022-23).
• Use a hash function H(key) = key%7 with linear probing to insert keys into a table. (2020-
21)
Topic: Recursion
• Write a recursive and non-recursive program to calculate the factorial of a given number.
(2017-18).
• What is tail recursion? Explain with an example. (2021-22).
• Describe the Tower of Hanoi problem for 10 disks. (2017-18).
 Unit-3
(Important Topics & Questions)
Topic: Sorting
• Use quick sort algorithm to sort the elements 15, 22, 30, 10, 15, 64, 1, 3, 9, 2. Is it
a stable sorting algorithm? Justify. (2017-18).
• Write an algorithm for merge sort and apply it to sort elements. (2020-21).
• Write algorithms for insertion sort and quick sort. Implement these for specific
data sets. (2021-22)(2022-23)
• Write an algorithm for Heap Sort. Use it to sort: 18, 25, 45, 34, 36, 51, 43, and 24.
(2022-23)
• Differentiate between stable and unstable sorting techniques. (2021-22)
• Write a C program for sorting 100 integer numbers wring selection sort
procedure. Discuss the worst-case time complexity of the algorithms. (2023-24)
Topic: Searching
• Differentiate between linear search and binary search. (2021-22)
• Write a program in C language to implement binary search algorithm. Also discuss
the average behavior of the algorithm. (2023-24)
 Unit-4
(Important Topics & Questions)
Topic: Basic Concepts of Tree
• Define tree, binary tree, complete binary tree, and full binary tree. (2017-18)
• Write the advantages of AVL trees over Binary Search Trees (BST). (2021-22)
• Discuss left-skewed and right-skewed binary trees. (2022-23)
• Discuss AVL tree or Height Balanced BST.
• Discuss Threaded Binary Trees [2020-21]
Topic: Traversal and Algorithms
• Write algorithms or functions for preorder, postorder, and inorder traversals of a
binary tree. (2017-18)
• The order of nodes in a binary tree’s inorder and postorder traversal is given.
Draw the tree. (2022-23)
• Discuss the representation of a threaded binary tree and write an algorithm to
insert a node. (2021-22)
• Discuss B-Tree and its insertion and deletion algorithm. [2022-23]
• Discuss all AVL rotations
Topic: Advanced Tree
• Construct a B-tree of order 3 for the sequence: 10, 20, 30, 40, 50, 60, 70, 80, 90.
(2017-18)
• Insert elements into an AVL tree and show rotations to maintain balance: 60, 2,
14, 22, 13, 111, 92, 86. (2022-23)
Topic: Tree Construction
• Construct a tree from the given traversal sequence
• Show step-by-step insertion and deletion in an AVL tree [2021-22]
• Show step-by-step insertion and deletion in B-Tree
 Unit-5
(Important Topics & Questions)
Topic: Graph{Algorithms}
• Write an algorithm for Breadth-First Search (BFS) traversal. (2020-21)
• Explain Dijkstra’s algorithm for finding the shortest path. (2017-18)
• Apply Floyd Warshall’s algorithm to find the shortest path among all vertices in a
graph. (2022-23)
• Write an algorithm for Depth-Firs Search (DFS) traversal [2022-23]
• Explain Prim’s algorithm for finding the shortest path. [2021-22]
Topic: Graph Numerical
• Spanning Tree using Prim’s or Kruskal’s algorithm [2022-23,2021-22]
• Depth First Search sequence
• Breadth First Search sequence [2022-23]
• Single source shortest path using Dijkastra algorithm [2022-23]
• All pair shortest path using warshall algorithm [2021-22]