NAGPUR INSTITUTE OF TECHNOLOGY
(Affiliated to RTM Nagpur University & Approved by AICTE New Delhi) Campus:13/2,Mahurzari,
Near Fetri, Katol Road,Nagpur-441501, India
Email Id:[email protected] Web:www.nit.edu.in ContactNo.09764974144
RTMNUCode:315 DTECode:04144 AICTE ID:1-4830701 AISHECode:C-18725 NAACAccredited
DEPARTMENT OFINFORMATION TECHNOLOGY
Academic Session: 2025-26 (OddSem.)
Semester/Branch:IIIrdSEM/IT Subject Code:
BIT3T09
Name of Faculty : Prof. Prateeksha Ronghe
Course Name : Data Structure and Algorithms
Date of Display : 01/08/2025
Date of Submission : 06/08/2025
BIT3T09 Data Structure and Algorithms
CO1 Understand the efficiency ofan algorithm based on timeand space
complexityand classify an appropriate searching and sorting techniques to
solvegiven problems.
CO2 Apply theconcepts of stack and queues to solvereal world problem.
CO3 Apply theLinked List Concept to evaluate the expression.
CO4 Analyzethe different traversing techniques using tree.
CO5 Use variousmethods to represent graph and utilize graph conceptsto solve
real world problems and implement concept of hashing.
Assignment1(Any 8)
1.What areasymptoticnotations?Alsoexplain the following:
i) Big - oh notation
il) BigThetanotation
ili) Big omeganotation
2. Sortthegiven list usinginsertion sort andexplain it 422510196 201162 198
3.Explain howyouwouldimplement threestacksina singlearray ofsize 30such that nu stack
overflowsuntil thearrayis full.
4.Differentiate between stackanda queue ADT.Giveat least5 pointsof difference.
5. Convert thefollowinginfix expression intoprefix usingstack: a +b/c*d+f^g
6.Wri t eaalgorithm forBubble sort, Tracepathof sorti
followingarrayof integers: 44, 55, 33, 88, 77, 11, 66 ngprocessusingbubble sort for the
Subject Teacher
(Prof. PrateekshaRonghe)
7.Convert theinfix expression(A+B) * (C-D)/ (E+F) topostfixnotation usinga stack. Show
thestackcontentsateach step.
8.anddeleti
What aretheadvantages
on ofsimple Queue. of circular Queueoversimple queue?Wri t ealgorithmfor addition
9.Explain thealgorithm for variousoperations of circular queue.
10. Sort the givenli
algorithm for same. st usin gin sertionsort inascendingorder :List =6 7 122 16 11 13. Write an
11.Explain howa priority queuediffersfrom de-queue(double-endedqueue).
12. Compare andcontrast betweenMerge sort andQuicksort.
13. Analyzethetimeandspacecomplexityof Linear Search andBinarySearch algorithms.
14. Explain theprimitiveandnon-primitivedatastructure.
15. Writeanalgorithm for:
1.Insertionof nodeat first place.
2. Insertion of a nodeat last.
3.Insertion of anodeinsortedlist
Subject Teacher
(Prof. PrateekshaRonghe)
