Data Structures-II Laboratory Notes
Subject Overview
The practical companion to Data Structures-II, implementing linear and binary search, bubble/
Subject at a glance
1
Units
6
Topics
1
Credits
1
Infographics
Unit-wise Syllabus
1 units — open any unit for detailed topic-wise notes, diagrams and important exam questions
- Linear and binary search
- bubble/selection/insertion/quick sort
- binary tree preorder/inorder/postorder traversal
- depth-first and breadth-first search in graphs
- shortest path algorithm
- hashing implementation
Data required
Any order
Must be sorted
Time
O(n)
O(log n)
Method
Check each element in turn
Halve the search range each step
Best for
Small or unsorted lists
Large sorted lists
Study guide
In this lab you implement searching and sorting (linear and binary search; bubble, selection, insertion and quick sort), binary tree preorder, inorder and postorder traversals, depth-first and breadth-first search on graphs, a shortest-path algorithm and a hashing implementation. Compare the running time of different sorts on the same data to see complexity in action.
Why Data Structures-II Laboratory Matters
These are the programs most often asked in technical interviews and coding rounds, so writing them from scratch is direct placement preparation.
How to Prepare for Data Structures-II Laboratory
- Implement each algorithm without notes at least twice.
- Test with sorted, reverse-sorted and random data.
- Be ready to state the time complexity of every program in the viva.
Data Structures-II Laboratory: Frequently Asked Questions
What programs are in the Data Structures-II lab?
Searching, sorting, tree traversals, graph traversals (DFS and BFS), shortest path and hashing.