Case Study Topics For Data Structure
Uploaded by
akshitaup123Case Study Topics For Data Structure
Uploaded by
akshitaup123SRM Institute of Science and Technology
Delhi Ncr Campus Gaziyabade CASE
Academic Year: 2025-26 (ODD)
STUDY
Course Code & Title: 21CSC201J Data Structure & Algorithm
Year & Sem & Dept: II&3rd &CSE
Course Articulation Matrix:
21CSC201J Data Structure &Algorithm Program Outcomes (POs)
Graduate Attributes PDOs
CO Course Outcomes (COs) 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
s
1 Devise algorithms to arrange the data in required order 1 2 3 - - - - - - - -
3 3 - -
and retrieve a specific datum in efficient manner
2 Determine the type of list structure that could be used 2 3 3 - - - - - - - - 3 - -
3
for solving a problem and implement it using C
programming language
3 Devise solutions using linear structures Stack and 2 23 3 - - - - - - - - 3 - -
3
Queue
4 Express proficiency in usage of tree for solving 2 3
3 - - - - - - - -
3 3 - -
problems
5 Implement Hash tables for storing data and algorithms 3 2 3 - - - - - - - - 3 - -
3
to find shortest path between nodes in a graph
Instructions:
students can select one case study question from the topics listed below. Explore the selected topic
in-depth, using credible sources such as textbooks, research papers, video lectures, and online
sources/discussion forums to develop a detailed report.
The report must be of 5 - 10 pages.
The report should address the core issues/questions related to the case study and include well
structured sections with appropriate figures and tables. Each figure or table should have a clear
number and caption. If any figure/table is borrowed from a source, proper citation is required.
Summarize diverse viewpoints or approaches from different sources in the form of a comparison
table, ensuring that each point is accurately referenced.
Include conclusion and a bibliography at the end of the report with all relevant sources referred to
for the report. Ensure the use of consistent and formal referencing throughout the report.
Case study topics/questions:
1.Game-Based Learning for Stacks and Queues
Develop or analyze a computer game that teaches the use of stacks and queues. Such a platform
lets students visualize abstract data operations, deepening conceptual understanding through
interactive practice.
Page 1
2.Contact Book Application
Explore the design and implementation of a digital contact book using arrays, linked lists, stacks,
and queues. This case can address efficient searching, sorting, and dynamic suggestions as users
type queries.
3.Optimal Treap Structures
Investigate how treaps (a blend of binary search trees and heaps) can be optimized with dynamic
priorities. Study the effect of moving frequently accessed nodes toward the root and measure the
impact on search speed.
4.Graph-Based Travel Planner
Create a system using graphs to model a network of locations and roads, and implement
algorithms like Dijkstra’s for shortest-path trip planning. Explore how such data structures are
used by navigation and logistics services.
5.Library Management System
Examine library operations—book storage, retrieval, lending—using arrays, linked lists, trees,
hash tables, and search/sorting algorithms. Address complex workflows like borrowing, waitlists,
and inventory management.
6.7Real-Time Traffic Analysis
Use segment trees, queues, graphs, and priority queues to manage and analyze real-time traffic
data from sensors or GPS. Investigate road network modeling, optimal routing algorithms, and
visual analytics for transport control systems.
7.Cash Flow Minimizer
Model a system that uses graphs and algorithms such as Min-Cost Max-Flow to reduce the
number of transactions needed to settle debts within a group. Explore practical applications for
financial institutions and corporate environments.
8.Crossword Puzzle Game
Design a crossword puzzle generator and solver using hash tables, backtracking algorithms, and
string-manipulating data structures. Investigate challenges around word placement, pattern
matching, and interactive user interfaces.
9.Binary Tree Traversal and Construction
Build and analyze binary trees, implementing pre-order, in-order, and post-order traversal
operations to showcase recursive algorithms and their critical applications.
10.Efficient Data Retrieval in Search Engines
Focus: Use of trees (e.g., B-trees, tries) and hash tables for indexing and searching.
Case Study Angle: Analyze how Google or other search engines use data structures for fast
lookups.
11.Design and Implementation of a Cache System
Focus: LRU (Least Recently Used) cache using doubly linked lists and hash maps.
Case Study Angle: How browsers or web applications manage recently used resources.
Page 2
12. Social Media Feed Algorithms
Focus: Queues, heaps, and graphs.
Case Study Angle: How platforms like Facebook or Twitter organize user feeds using priority
queues and graphs (for follower relationships).
13. Graph-Based Route Finding in GPS Applications
Focus: Graph data structures and Dijkstra's/A* algorithms.
Case Study Angle: How applications like Google Maps use data structures for real-time
navigation and shortest path calculations.
14. Text Auto-Completion Using Tries
Focus: Trie (prefix tree) data structure.
Case Study Angle: How mobile keyboards or search engines provide suggestions while typing.
15.Real-Time Stock Market Analysis
Focus: Heaps, queues, and hash tables.
Case Study Angle: Managing and prioritizing high-frequency stock trades in real-time using
suitable data structures.
Page 3
