Course Code: CSE2014 Course Title: Data Structures

TP 4 4 6
and Algorithms C
Version No.
Course Pre- CSE1011
requisites/ Co-
requisites
Anti-requisites (if any). CSE2001/SWE2001
Objectives: 1. To impart the basic concepts of data structures
and algorithms
2. To understand concepts about searching and
sorting techniques
3. To understand basic concepts about stacks,
queues, lists, trees and graphs
4. To understanding about writing algorithms and
step by step approach in solving problems with the
help of fundamental data structures.

Course Course Outcome Statement PO's / PEO's Class Tutorial

Outcomes Sessions Hours
Understand basics of asymptotic
PO1,PO2,PO3,PO4 /
CO1 notations and analysis of simple 6 2
PEO1,PEO3
algorithms
Storing and Organizing data PO1,PO2,PO3,PO4 /
CO2 8 2
using linear data structures PEO1,PEO3
Designing an efficient solution
PO1,PO2,PO3,PO4 /
CO3 to a given problem using linear 24 4
PEO1,PEO3
and non-linear data structures
Designing efficient sorting PO1,PO2,PO3,PO4 /
CO4 12 2
algorithms PEO1,PEO3

Module No. 1 Basic Terminologies and Introduction 8 Hours

to Algorithm & Data Organization
Algorithm specification, Recursion, Performance analysis, Asymptotic Notation - The
Big- O, Omega and Theta notation, Programming Style, Refinement of Coding - Time-
Space Trade Off, Testing, Data Abstraction

Module No. 2 Linear Data Structures 12 Hours

Array, Stack, Queue, Linked-list and its types, Various Representations, Operations &
Applications of Linear Data Structures
Module No. 3 Non-linear Data Structures 12 Hours
Trees (Binary Tree, Threaded Binary Tree, Binary Search Tree, B & B+ Tree, AVL
Tree, Splay Tree) and Graphs (Directed, Undirected), Various Representations,
Operations & Applications of Non-Linear Data Structures

Module No. 4 Searching and Sorting on Various 14 Hours

Data Structures
Sequential Search, Binary Search, Comparison Trees, Breadth First Search, Depth First
Search Insertion Sort, Selection Sort, Shell Sort, Divide and Conquer Sort, Merge Sort,
Quick Sort, Heapsort,

Module No. 5 Files 4 Hours

Introduction to Hashing ,Organization (Sequential, Direct, Indexed Sequential, Hashed)
and various types of accessing schemes.
Module No. 6 Graphs 10 Hours
Basic Terminologies and Representations, Graph search and traversal algorithms and
complexity analysis

Text Books
1. Fundamentals of Data Structures, E. Horowitz, S. Sahni, S. A-Freed,
Universities Press,2nd Edition,2015.
2. Data Structures and Algorithms, A. V. Aho, J. E. Hopperoft, J. D. UIlman,
Pearson, 2nd Edition,2017.
References
1. The Art of Computer Programming: Volume 1: Fundamental Algorithms, Donald
E. Knuth,3rd Edition,2015.
2. Introduction to Algorithms, Thomas, H. Cormen, Charles E. Leiserson, Ronald
L. Rivest, Clifford Stein, The MIT Press,3rd edition,2009.
3. Open Data Structures: An Introduction (Open Paths to Enriched Learning),
(Thirty First Edition), Pat Morin, UBC Press,2013.
Laboratory
1. Towers of Hanoi using user defined stacks.
2. Reading, writing, and addition of polynomials.
3. Line editors with line count, word count showing on the screen.
4. Trees with all operations.
5. All graph algorithms.
6. Saving / retrieving non-linear data structure in/from a file
Mode of Evaluation Continuous Assessment Tests-60%, Lab Work
Sheets- 20%, Practical Assesment-20%
Continuous Assessment Test-1 20%
Continuous Assessment Test-2 20%
Final Assessment Test 20%
Cumulative Lab Assessment 20%
Practical Assignment 20%

Prepared by Dr.Sudhakar Illango,PC -CSE BS

Recommended by 07.01.2021
the Board of
Studies on
Date of Approval by 5th Academic council 02.03.2021
the Academic Council