Syllabus: CSE242, Data Structures
School: SET Batch :2023-27
Program: [Link]. Current Academic Year: 2023-24
Branch:CSE/IT Semester:II
1 Course Code CSE242
2 Course Title Data Structures
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Status Core
5 Course 1. Learn the basic concepts of Data Structures and algorithms.
Objective 2. Design and Implementation of Various Basic and Advanced Data
Structures.
3. Learn the concepts of various searching, Sorting and Hashing
Techniques.
4. Choose the appropriate data structures and algorithm design method for a
specified application.
6 Course CO1: Select appropriate data structures as applied to specified problem
Outcomes definition.
CO2: Choose the suitable data structures like arrays, linked list, stacks and
queues to solve real world problems efficiently.
CO3 Represent and manipulate data using nonlinear data structures like
trees and graphs to design algorithms for various applications.
CO4: Compare various techniques for searching and sorting.
CO5: Design and implement an appropriate hashing function for an
application
CO6: Formulate new solutions for programing problems or improve
existing code using learned algorithms and data structures
7 Course This course starts with an introduction to data structures with its
Description classification, efficiency of different algorithms, array and pointer based
implementations and Recursive applications. As the course progresses the
study of Linear and Non-Linear data structures are studied in details. The
course talks primarily about Linked list, stacks, queue, Tree structure,
Graphs etc. This Course also deals with the concept of searching, sorting
and hashing methods.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A Data Structure – Definition, Operations and Applications, CO1
Abstract Data Types, Algorithm – Definition, Introduction to
Complexity, Big OH notation, Time and Space tradeoffs.
B Dynamic Memory Allocation( Malloc, calloc, realloc, free), CO1
Recursion – Definition, Examples- Tower of Hanoi problem,
Tail Recursion
C Arrays: Implementation of One Dimensional Arrays, CO1
Multidimensional Arrays, Applications of Arrays, Address
Calculation, Matrix Operations, Sparse martices
Unit 2 Linked List
A Concept of Linked List, Garbage Collection, Overflow and CO2
Underflow, Array Implementation and Dynamic
Implementation of Singly Linked Lists
B Array Implementation and Dynamic Implementation of CO3
Doubly Linked List, Circularly Linked List
C Operations on a Linked List- Insertion, Deletion, Traversal, CO2
Polynomial Representation and Addition
Unit 3 Stack and Queue
A Stacks: Definitions, Primitive operations, Application of stacks – CO3
Conversion of Infix Expression to Postfix form, Evaluation of
Postfix Expressions
B Queues: Definition, Primitive Operations, Implementation of CO3
Circular Queues, Priority Queues
C Deques, Application of Queues. Implementation - Linked CO3
Stacks, Linked Queues.
Unit 4 Tree and Graphs
A Trees: Terminologies, Binary tree, Representation, Applications, CO4, CO6
Binary search Tree – Operations on Binary Search Trees
(Traversing, Insertion, deletion etc.), Binary Search Algorithm,
AVL Tree
B Graph: Terminology, Representation, Traversals- Depth First CO4, CO6
Search, Breadth First Search.
C Graph Applications – Minimum Spanning Trees – Prim’s and CO4, CO6
Kruskal’s Algorithms
Unit 5 Searching, Sorting and Hashing
A Implementation and Analysis - Linear search, Binary Search CO5, CO6
B Implementation and Analysis- Bubble Sort, Insertion Sort, CO5, CO6
Selection Sort, Tree sort
C Hashing: Concepts and Applications, Hash Functions, CO5, CO6
Collisions, Methods of Resolving Collisions
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Lipschutz, “Data Structures” Schaum’s Outline Series,
TMH
Other 1. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe
References J. Augenstein “Data Structures Using C and C++” , PHI
2. Horowitz and Sahani, “Fundamentals of Data
Structures”, Galgotia Publication
3. Jean Paul Trembley and Paul G. Sorenson, “An
Introduction to Data Structures with applications”,
McGraw Hill
4. R. Kruse etal, “Data Structures and Program Design in
C”, Pearson Education
5. G A V Pai, “Data Structures and Algorithms”, TMH
CO and PO Mapping
S. Course Outcome Program Outcomes (PO)
No. & Program Specific
Outcomes (PSO)
1. Select appropriate data structures as applied to specified PO1, PO3, PO9
problem definition.
2. Choose the suitable data structures like arrays, linked list, PO1, PO2, PO3, PO9
stacks and queues to solve real world problems
efficiently.
3. Represent and manipulate data using nonlinear data PO1, PO2, PO3, PO4,
structures like trees and graphs to design algorithms for PO9
various applications.
4. Compare various techniques for searching and sorting. PO3, PO9, PO12
5. Design and implement an appropriate hashing function PO1, PO2, PO3, PO4,
for an application PO5, PO9
6. Formulate new solutions for programing problems or PO1, PO3, PO4, PO5,
improve existing code using learned algorithms and data PO9
structures
PO and PSO mapping with level of strength for Course Name Data Structures (Course
Code CSE 242)
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
Cos
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
_ _ _
CO 2 - 2 - - - - - 2 - - -
1
CO 1 2 3 - - - - - 1 - - - _ _ _
2
_ _ _
CO 2 3 3 2 - - - - 2 - - -
3
_ _ _
CO - - 2 - - - - - 3 - - 1
4
CO 3 2 3 2 1 - - - 2 - -- - _ _ _
5
CO 2 - 3 3 2 - - - 1 - - - _ _ _
6
Average of non-zeros entry in following table (should be auto calculated).
Cour Cours
PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
se e
1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3
Code Name
_ _ _
Data 2.3 2.6 2.3 1.8
CSE2
structu 2 1.5 - - - - - 1
42 res 3 7 3 3
Strength of Correlation
1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent
3. Addressed to Substantial (High=3) extent
