DATA STRUCTURE AND
ALGORITHMS
PCC-CS 301, B.Tech 3rd Sem
Contents
Unit 1 (Introduction) ................................................................................................. 1
Unit 2 (Stacks and Queues) ....................................................................................... 4
Unit 3 (Linked list and Trees) ..................................................................................... 9
Unit 4 (Sorting and Hashing) ................................................................................... 16
Unit 1 (Introduction)
Syllabus
Basic Terminologies: Elementary Data Organizations, Data Structure Operations:
insertion, deletion, traversal etc.; Analysis of an Algorithm, Asymptotic Notations, Time-
Space trade off. Searching: Linear Search and Binary Search Technique sand their
complexity analysis.
PYQ
2025
2025
2025
2024
The running me complexity of a linear me algorithm is given as-----
2024
If the elements of a data structure are stored sequentially, then it is a ______.
2024
Where is linear searching used?
2024
In C language, malloc( ) returns
2024
________ notation on provides a tight lower bound for f(n)
2023
A data structure is a particular way of ----------and ---------data either in computer’s
memory or on the disk storage so that it can be used efficiently
2023
Define algorithm.
2023
What are the measures of performance of an algorithm? Explain
2023
Define asymptotic notation and explain each types
2023
What is the search complexity in direct addressing?
2023
What is the best case for linear search
2023
) Which notation comprises a set of all functions h(n) that are greater than or equal to
cg(n) for all values of n ≥ n0
2023
Write an algorithm for binary search technique
2023
What are the best worst and average case time complexity of binary search algorithm
2023
How linear search is differing from binary search
2023
What are the preconditions for performing binary search in an array
2023
Write a C program for linear search in an array.
2017
2016
2016
2015
2015
2015
2015
2015
2015
Unit 2 (Stacks and Queues)
Syllabus
ADT Stack and its operations: Algorithms and their complexity analysis, Applications of
Stacks: Expression Conversion and evaluation – corresponding algorithms and
complexity analysis. ADT queue, Types of Queue: Simple Queue, Circular Queue,
Priority Queue; Operations on each types of Queues: Algorithms and their analysis.
PYQ
2025
2025
2025
2025
2025
2025
2025
2025
2024
A linear list in which elements can be added or removed at either end but not in the
middle is known as----------
2024
Stack can be implemented using _________ and ________
2024
Write algorithms for push and pop operations of stack
2024
Define recursion? Explain the usage of stack in recursive algorithm implementation
2024
What are types of Queues? Explain each
2024
Which data structures is used to implement recursion
2023
What is the time complexity of an infix to postfix conversion algorithm
2023
Which of the following is essential for converting an infix expression to postfix notation ?
2023
Reverse Polish notation is often known as-----
2023
A circular queue is implemented using an array of size 10. The array index starts with 0,
front is 6, and rear is 9. The insertion of next element takes place at the array index.
2023
State the differences between stack and queue data structure
2023
Convert the following infix expression into postfix expression using the stack data
structure with detailed explanation : A – (B / C + (D % E * F) / G)* H
2023
Why circular queue is better than simple queue?
2023
Evaluate the postfix expression using stack: 2 3 1 * + 9-
2023
Write a program to convert infix expression to its equivalent postfix expression using
stack
2023
What is a Stack ADT ? Explain their operations.
2023
Write an algorithm to delete an item from a circular array of queue. Also find the
complexity of the algorithm.
2017
2017
2017
2017
2017
2016
2016
2016
2016
2016
2016
2016
2016
2015
2015
Unit 3 (Linked list and Trees)
Syllabus
Linked Lists: Singly linked lists: Representation in memory, Algorithms of several
operations: Traversing, Searching, Insertion into, Deletion from linked list; Linked
representation of Stack and Queue, Header nodes, Doubly linked list: operations on it
and algorithmic analysis; Circular Linked Lists: all operations their algorithms and the
complexity analysis.
Trees: Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded Binary
Tree, Binary Search Tree, AVL Tree; Tree operations on each of the trees and their
algorithms with complexity analysis. Applications of Binary Trees. B Tree, B+ Tree:
definitions, algorithms and analysis
PYQ
2025
2025
2025
2025
2025
2025
2025
2025
2025
2024
Which type of linked list contains a pointer to the next as well as the previous node in
the sequence?
2024
Make a comparison between a linked list and a linear array
2024
What are the properties of b tree? What are the disadvantages of a binary search tree
2023
The values in a BST can be sorted in ascending order by using which of the traversals
method
2023
Show how the following polynomial can be represented using a linked list. 7x2 y2 - 4x2
y+5xy2 -2 .
2023
Write difference between b tree and b+ tree
2023
Write the advantages disadvantages and uses of a circular linked list.
2017
2017
2017
2017
2017
2017
2017
2017
2017
2017
2017
2017
2017
2016
2016
2016
2016
2016
2016
2016
2016
2016
2016
2016
2016
2016
2016
2016
2015
2015
2015
2015
2015
2015
2015
2015
2015
2015
Unit 4 (Sorting and Hashing)
Syllabus
Sorting and Hashing: Objective and properties of different sorting algorithms: Selection
Sort, Bubble Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort; Performance and
Comparison among all the methods, Hashing. Graph: BasicTerminologies and
Representations, Graph search and traversal algorithms and complexity analysis.
PYQ
2025
2025
2025
2025
2025
2025
2024
The time complexity of heap sort in worst case is----------
2024
Merge sort uses------------Technique
2024
What is the number of edges present in a complete graph having n ver ces
2024
A graph contains 21 edges, 3 ver ces of degree 4 and all other ver ces of degree 2. Find
total number of vertices
2024
Write an algorithm for bubble sort technique
2024
2024
(a) Write merge sort algorithm. (b) Implement merge sort in C code
2024
(a) Define hashing. (b) What are the different types of hashing technique explain. (c)
What are the advantages of hashing.
2024
(a) Explain with a suitable example the principle of opera on of Quick Sort algorithm.
(b) In which cases, Quick Sort becomes a ‘Slow Sort’ ? discuss the remedy in
those cases
2024
Compare the performance and opera on of Bubble Sort and Selec on Sort
2023
------------ is not a stable sorting algorithm
2023
Time complexity of bubble sort in best case is-----------
2023
When a sorting technique is called stable?
2017
2017
2022
2017
2017
2016
2016
2016
2016
2016
2016
2016
2015
2015
2015
2015
2015
2015
2015
