CSL209 Data Structures
COURSE TEMPLATE
1. Department: Department of Computer Science and Engineering
2. Course Name: Data Structures 3. Course
4. L-T-P 5. Credits
Code
CSL209 3-0-2 4
6. Type of Course
(Check one):
Programme Core ✔ Programme Elective Open Elective
7. Pre-requisite(s), if any: Knowledge of Java
8. Frequency of offering (check one): Odd ✔ Even Either semester Every semester
9. Brief Syllabus:
Solving computational problems requires the knowledge of efficient data organization and the ability to make
effective choices among multiple solutions. In this course, we will explore several fundamental data structures in
computer science and learn to implement them in Java. The course aims to teach the fundamentals of data
structures, their design, implementation, and effective use in problem solving approach. With the knowledge of
data structures and practical experience in implementing them, students can become much more effective
designer and developer. The course will start with the basic introduction of linear as well as non-linear data
structures and further proceeds with the programming intensive task of implementing them. This course will also
cover file organization and different hashing techniques in its last module.
Total lecture, Tutorial and Practical Hours for this course (Take 15 teaching weeks per semester): 75
Practice
Lectures: 45 hours Tutorials: 0 hours Lab Work: 30 hours
10. Course Outcomes (COs)
Possible usefulness of this course after its completion i.e. how this course will be practically useful to him once it is
completed
CO 1 Infer the role of various data structures and apply complexity analysis on different algorithms.
CSL209 Data Structures
CO 2 Differentiate between Arrays and Linked Lists, and implement numerous operations using Java.
CO 3 Demonstrate and contrast stack and Queue operations in real world applications.
CO 4 Describe Non-linear data structures (Trees and Graphs) and their applications in various domains.
Perform and compare several searching and sorting algorithms, and develop basic understanding
CO 5
about File organization.
11. UNIT WISE DETAILS No. of Units: 5
Unit Number: 1 Title: Object Oriented Programming and Data Structure No. of hours: 9
Content Summary:
Java Software Development Tools, Interfaces, Data & its meaning, Types of data structures, Linear and Non-linear
data structures, Introduction to Algorithms and analyzing time complexities
Unit Number: 2 Title: Arrays and Linked Lists No. of hours: 9
Content Summary:
Introduction to Arrays, Representation in Row major and Column major order, Array traversal, Wrapper Classes,
The ArrayList, Linear and Binary search, Linked list introduction, Insertion and Deletion, Doubly Linked list, Circular
Linked list and their implementation
Unit Number: 3 Title: Stacks & Queues No. of hours: 9
Content Summary:
Stack operations Push, pop, peek, Implementation using arrays and linked list, Stack applications, Polish Notations,
Introduction to Queues, Implementation using Arrays and Linked Lists, Circular Queues, Doubly ended queues
(Dqueues), Priority Queues applications and implementation
Unit Number: 4 Title: Trees & Graphs No. of hours: 12
Content Summary:
Introduction to Binary Trees, Expression trees, Tree traversal: Inorder, Preorder & Postorder, Tree implementation
using Array and Linked List, Introduction to Binary Search Tree, Insertion and Deletion in BST, AVL Trees, Insertion
CSL209 Data Structures
and Deletion, Introduction to Graphs, Representation, Graph traversal: Breadth First Search & Depth First Search,
Applications
Unit Number: 5 Title: Sorting Algorithms & File Organization No. of hours: 6
Content Summary:
Sorting introduction, Quick Sort, Merge Sort and Heap Sort Implementation and analysis, File Organization: File
representation on hard disks, Indexing and Hashing techniques, Linear probing & Quadratic probing
12. Brief Description of Self-learning components by students (through books/resource material etc.):
Object-Oriented Design with UML
GUI Programming
Books Recommended :
Text Books:
1) Robert Lafore, “Data Structures and Algorithms in Java”, SAMS publications, 2nd Edition, 2002
2) Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser, “Data Structures and Algorithms in Java”,
Wiley Publications, 6th Edition, 2014
Reference Books:
3) Seymour Lipschutz, “Data Structures”, Schaum’s Outlines, McGraw Hill Education, 1st Edition, 2014
4) Aaron M. Tannenbaum, Yedidyah Langsam, Moshe J.Augenstein, “Data Structure using C”, Pearson India,
1st Edition, 2018
Electronic Textbooks available through the ASU Library:
JAVA For Everyone: Late Objects, 2nd Edition, Cay S. Horstmann.
(https://bcs.wiley.com/he-bcs/Books?action=index&bcsId=6907&itemId=1118063317)
CSL209 Data Structures
Reference Websites: (nptel, swayam, coursera, edx, udemy, lms, official documentation weblink)
https://canvas.asu.edu/courses/58080
https://nculms.ncuindia.edu/courses/2812
https://onlinecourses.nptel.ac.in/noc23_cs85/preview
https://www.coursera.org/learn/data-structures?specialization=data-structures-algorithms
https://www.edx.org/course/data-structures-an-active-learning-approach
Practice (Case Studies/Practice Drills) Content
Sr. No. Topic Unit covered
1. Applications of different data structures in real world applications 1
2. Time complexities of algorithms 1
3. Conversion of infix to postfix and prefix, postfix to prefix and infix, 2
prefix to postfix and infix
4. Priority Queue implementation using Heap data structure 2
Practical Content
Sr. No. Title of the Experiment Software/Har Unit Time
dware based covered Required
1. 1 Create an array of integer with size n. Return the Software 1 2
difference between the largest and the smallest value
inside that array.
2. 2 Write a program that initializes an array with ten Software 2 2
random integers and then prints four lines of output,
containing:
• Every element at an even index
• Every odd element
• All elements in reverse order
CSL209 Data Structures
• Only the first and last element
3. 3 Write a program to read numbers in an integer array Software 2 2
of size 5 and display the following:
• Sum of all the elements
• Sum of alternate elements in the array
• Second highest element in the array
4. 4 Write a program to create a singly linked list of n Software 2 2
nodes and perform:
• Insertion
o At the beginning
o At the end
o At a specific location
• Deletion
o At the beginning
o At the end
o At a specific location
5. 5 Write a program to create a doubly linked list of n Software 2 2
nodes and perform:
• Insertion
o At the beginning
o At the end
o At a specific location
• Deletion
o At the beginning
o At the end
o At a specific location
6. 6 Write a program to create a circular linked list of n Software 2 2
nodes and perform:
• Insertion
o At the beginning
o At the end
o At a specific location
• Deletion
o At the beginning
o At the end
o At a specific location
7. 7 Write a program to implement stack using arrays and Software 3 2
linked lists.
8. 8 Write a program to reverse a sentence using stack. Software 3 2
9. 9 Write a program to check for balanced parenthesis in Software 3 2
a given expression.
CSL209 Data Structures
10. 1 Write a program to convert infix expression to prefix Software 3 2
0 and postfix expression.
11. 1 Write a program to implement Tower of Hanoi using Software 3 2
1 stacks
12. 1 Write a program to implement Linear Queue using Software 3 2
2 Array and Linked Lists.
13. 1 Write a program to implement Circular Queue using Software 3 2
3 Array and Linked Lists.
14. 1 Write a program to implement Doubly Ended Queue Software 3 2
4 using Array and Linked Lists.
15. 1 Write a Program to implement Binary Search Tree Software 4 2
5 operations.
16. 1 Write a program to implement Bubble Sort, Selection Software 5 2
6 Sort, Quick Sort, Merge Sort and Insertion Sort
algorithm.
Value Added Experiments
1. Stack implementation using Queue Software 3 1
2. Queue implementation using Stack Software 3 1
3. Merge sort implementation using Linked List Software 5 1
4. Dijkstra’s Algorithm to find shortest path Software 5 1
Project (To be done as individual/in group): to be assigned/approved by the faculty
CSL209 Data Structures
Evaluation Scheme (Choose one related to the course)
TYPE OF ALLOTTED RANGE OF
S. No. PARTICULAR PASS CRITERIA
COURSE MARKS
Minor Test 15%
Major Test 35%
Continuous
Must Secure 30% Marks
Theory+ Evaluation Through
Out of Combined Marks
Practical Class
1 10% of Major Test Plus
Tests/Practice/Assig
(L-T-P/L-0-P) Minor Test with Overall
nments/Presentatio
40% Marks in Total.
n/Quiz
Online Quiz 5%
Lab Work 35%
Mapping of PO’s and CO’s
PO PO PO PO PO PO PO PO PO PO10 PO11 PO12 PSO1 PSO2 PSO3
1 2 3 4 5 6 7 8 9
CO1 3 3 1 2 - 1 - 2 3 3 2 3 3 2 3
CO2 2 2 2 2 3 1 1 2 3 3 2 3 3 2 3
CO3 2 2 2 2 3 1 1 2 3 3 2 3 3 2 3
CO4 2 2 2 2 3 1 1 2 3 3 2 3 3 2 3
CO5 2 2 1 2 3 1 1 2 3 3 2 3 3 2 3
