RAGHU ENGINEERING COLLEGE

(Autonomous)
(Approved by AICTE, New Delhi, Permanently Affiliated to JNTU-GV, Vizianagaram,
Accredited by NBA & Accredited by NAAC with A+ grade)

DATA STRUCTURES
AR23 B.Tech. (Common to CSE, IT & allied branches)
I-B.Tech., II-Semester

L T P C
3 0 0 3

Course Objectives:
 Understand the significance of data structures in problem-solving and basic
time/space complexity analysis.
 Create and manage linked lists to efficiently organize and manipulate data,
emphasizing memory efficiency.
 Implement and apply stacks to manage program flow and solve problems
involving expression evaluation and backtracking.
 Utilize queues to model real-world scenarios, such as process scheduling and
explore the concepts of hashing and apply it to solve problems
 Impart basic understanding of non-linear data structures such as trees and
graphs.
Course Outcomes: At the end of the course, Student will be able to
CO1.Explain the role of data structures in organizing and accessing data
efficiently in algorithms.
CO2.Design, implement, and apply linked lists for dynamic data storage,
demonstrating understanding of memory allocation.
CO3.Develop programs using stacks to handle recursive algorithms, manage
program states, and solve related problems.
CO4.Apply queue-based algorithms for efficient task scheduling, design hash-
based solutions for problems. And apply them appropriately to solve data
management challenges.
CO5.Recognize the scenarios of non linier data structures like tree & graphs
and applications.

UNIT I (9Hours)
Introduction to Data Structures: Definition and importance of data structures,
Abstract data types (ADTs) and their implementation, Overview of time and space
complexity. Searching Techniques: Linear & Binary Search, Sorting Techniques:
Bubble sort, Selection sort, Insertion Sort

UNIT II (11Hours)
Linked Lists: Singly linked lists, representation and operations, Comparing arrays
and linked lists, doubly linked lists, representation and operations. Comparing single
link list and double linked lists, Circular linked lists, Applications of linked lists.
 RAGHU ENGINEERING COLLEGE
(Autonomous)
(Approved by AICTE, New Delhi, Permanently Affiliated to JNTU-GV, Vizianagaram,
Accredited by NBA & Accredited by NAAC with A+ grade)

UNIT III (14Hours)

Stacks: Introduction to stacks: properties and operations, implementing stacks using
arrays and linked lists, expression & types, Applications of stacks in converting
expression, expression evaluation, backtracking, reversing list.
Queues: Introduction to queues: properties and operations, implementing queues
using arrays and linked lists, Applications of queues in CPU scheduling FCFS & SJF.

UNIT IV (12Hours)
Hashing: Brief introduction to hashing and hash functions, Collision resolution
techniques: chaining and open addressing.
Trees: Introduction to Trees, Tree terminology, representation, types of trees Binary
Search Tree – Insertion, Deletion & Traversals.

UNIT V (14Hours)
Graph: Introduction, terminology, representation, types of graphs, applications of
graph

Textbooks:

1. Data Structures and algorithm analysis in C, Mark Allen Weiss, Pearson,

2nd Edition.
2. Fundamentals of data structures in C, Ellis Horowitz, Sartaj Sahni, Susan
Anderson-Freed, Silicon Press, 2008

Reference Books:

1. Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn and
Peter Sanders
2. C Data Structures and Algorithms by Alfred V. Aho, Jeffrey D. Ullman, and
John E. Hopcroft
3. Problem Solving with Algorithms and Data Structures" by Brad Miller and
David Ranum
4. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson,
Ronald L. Rivest, and Clifford Stein
5. Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting,
Searching, and Graph Algorithms" by Robert Sedgewick.
 RAGHU ENGINEERING COLLEGE
(Autonomous)
(Approved by AICTE, New Delhi, Permanently Affiliated to JNTU-GV, Vizianagaram,
Accredited by NBA & Accredited by NAAC with A+ grade)

Correlation of COs with POs & PSOs:

PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 2 3 3 2 - - - - - - - 2 2 2 -

CO-2 2 3 3 2 - - - - - - - 2 2 2 -

CO-3 2 3 3 2 - - - - - - - 2 2 2 -

CO-4 2 3 3 2 - - - - - - - 2 2 2 -

CO-5 2 3 3 2 - - - - - - - 2 2 2 -

Data Structures
SI.No Removed Added Justification % of
Syllabus syllabus Change
1 Unit- Breadth First Applications of  Knowledge of
4 search, queues in CPU Graphs concepts
scheduling, scheduling FCFS & is required for
Hash tables: SJF. BFS, as graphs
basic are not so far
implementation covered, it is
and operations, removed.
Applications of  In the view of
hashing in GATE/Placement
unique
15%
s FCFS & SJF
identifier CPU scheduling
generation, techniques are
caching most preferable
queue
applications

2 Unit- - Graph:  In the

5 Introduction, placement
terminology, point of
representation, view,
types of prerequisite
graphs, for DAA
applications subject ,
of graph Graphs
concept is
highly
needed.
 RAGHU ENGINEERING COLLEGE
(Autonomous)
(Approved by AICTE, New Delhi, Permanently Affiliated to JNTU-GV, Vizianagaram,
Accredited by NBA & Accredited by NAAC with A+ grade)

DATA STRCTURES LAB

AR23- B.Tech (Common to CSE, IT & allied branches of Engineering)
I-B.Tech., II-Semester
L T P C
0 0 3 1.5

Course Objectives:

 Understand the significance of linear data structures in problem-solving

and basic time/space complexity analysis.
 Create and manage linked lists to efficiently organize and manipulate data,
emphasizing memory efficiency.
 Implement and apply stacks to manage program flow and solve problems
involving expression evaluation and backtracking.
 Utilize queues to model real-world scenarios, such as process scheduling
and explore basic concepts of hashing and apply it to solve problems
 Impart basic understanding of non-linear data structures such as trees and
graphs.

Course Outcomes: At the end of the course, Student will be able to

CO1. Explain the role of linear data structures in organizing and accessing
data efficiently in algorithms.
CO2. Design, implement, and apply linked lists for dynamic data storage,
demonstrating understanding of memory allocation.
CO3. Develop programs using stacks to handle recursive algorithms, manage
program states, and solve related problems.
CO4. Apply queue-based algorithms for efficient task scheduling, design
hash-based solutions for problems. And apply them appropriately to solve
data management challenges.
CO5. Recognize the scenarios of non linier data structures like tree & graphs
and applications
List of Experiments:
Exercise 1: Array Manipulation
i) Write a program to reverse an array.
ii) C Programs to implement the Searching Techniques – Linear & Binary Search
iii) C Programs to implement Sorting Techniques – Bubble, Selection and Insertion Sort
Exercise 2: Linked List Implementation
i) Implement a singly linked list and perform insertion and deletion operations.
ii) Develop a program to reverse a linked list iteratively.
iii) Solve problems involving linked list traversal and manipulation.
 RAGHU ENGINEERING COLLEGE
(Autonomous)
(Approved by AICTE, New Delhi, Permanently Affiliated to JNTU-GV, Vizianagaram,
Accredited by NBA & Accredited by NAAC with A+ grade)

Exercise 3: Linked List Applications

i) Create a program to detect and remove duplicates from a linked list.
ii) Implement a linked list to represent polynomials and perform addition.
iii) Implement a double-ended queue (deque) with essential operations.

Exercise 4: Double Linked List Implementation

i) Implement a doubly linked list and perform various operations to understand its properties
and applications.
ii) Implement a circular linked list and perform insertion, deletion, and traversal.

Exercise 5: Stack Operations

i) Implement a stack using arrays and linked lists.
ii) Write a program to evaluate a postfix expression using a stack.
iii) Implement a program to check for balanced parentheses using a stack.

Exercise 6: Queue Operations

i) Implement a queue using arrays and linked lists.
ii) Solve problems involving circular queues.
iii) Develop a program to simulate a FCFS CPU Scheduling

Exercise 7: Stack and Queue Applications

i) Use a stack to evaluate an infix expression and convert it to postfix.
ii) Create a program to determine whether a given string is a palindrome or not.
iii) Implement a stack or queue to perform comparison and check for symmetry

Exercise 8: Binary Search Tree

i) Implementing a BST using Linked List.
ii) Traversing of BST.

Exercise 9: Hashing
i) Implement a hash table with collision resolution techniques.
Textbooks:

1. Data Structures and algorithm analysis in C, Mark Allen Weiss, Pearson, 2nd
Edition.
2. Fundamentals of data structures in C, Ellis Horowitz, Sartaj Sahni, Susan
Anderson-Freed, Silicon Press, 2008

Reference Books:

1. Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn and
Peter Sanders
2. C Data Structures and Algorithms by Alfred V. Aho, Jeffrey D. Ullman, and
John E. Hopcroft
3. Problem Solving with Algorithms and Data Structures" by Brad Miller and
David Ranum
 RAGHU ENGINEERING COLLEGE
(Autonomous)
(Approved by AICTE, New Delhi, Permanently Affiliated to JNTU-GV, Vizianagaram,
Accredited by NBA & Accredited by NAAC with A+ grade)

4. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson,

Ronald L. Rivest, and Clifford Stein
5. Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting,
Searching, and Graph Algorithms by Robert Sedgewick.

Data Structures Lab

SI.N Remove Added Justification % of
o d syllabu chang
Syllabus s e
1 Experimen Develop a Develop a GATE/Placemen
t-6 program to program to ts view , CPU
simulate a simulate a scheduling is 2%
simple printer FCFS CPU more important
queue Scheduling than printer
system. queue

2 Experimen Write a - Cache using

t-9 program to hashing
implement a requires
simple cache background
using knowledge
hashing. on memory
managemen
t concepts