CSE2003 DATA STRUCTURES AND L T PJ C

ALGORITHMS

3 0 2 0 4

Pre-requisite Syllabus
version

v. xx.xx

Course Objectives:

1.
To understand the basic concepts of data structures and algorithms.
2. To differentiate linear and non-linear data structures and the operations upon them.
3. Ability to perform sorting and searchingin a given set ofdata items.
4. To comprehend the necessity of time complexity in algorithms.

Expected Course Outcome:

 1.
Understanding the fundamental analysis and time complexity for a given problem.
2. Articulate linear data structures and legal operations permitted on them.
3. Articulate non-linear data structures and legal operations permitted on them.
4. Applyinga suitable algorithm for searching and sorting.
5. Understanding graph algorithms, operations, and applications.
6. Understanding the importance of hashing.
7. Applying the basic data structures to understand advanced data structure operations and
applications.
8. Application ofappropriate data structures to find solutions to practical problems.

Student Learning Outcomes (SLO): 1,5,6,9,11

1. Having an ability to apply mathematics and science in engineering applications.

5. Having design thinking capability.

6. Having an ability to design a component or a product applying all the relevant standards and

with realistic constraints.

9. Having problem solving ability- solving social issues and engineering problems.

11. Having an interest in lifelong learning.

Module:1 Introduction to algorithms and 6 hour

analysis

Overview and importance of algorithms and data structures. ​Fundamentals of algorithm analysis,
Space and time complexity of an algorithm, Types of asymptotic notations and orders of growth,
Algorithm efficiency – best case, worst case, average case, Analysis of non-recursive and recursive
algorithms, Asymptotic analysis for recurrence relation – ​Recursive Tree Method
 Module:2 Linear data structures 8 hours

Array- 1D and 2D array , Stack - Applications of stack: Expression Evaluation - Conversion of Infix to postfix
and prefix expression, Tower of Hanoi. Queue - Types of Queue: Circular Queue, Double Ended Queue
(deQueue), Applications – Priority Queue using Arrays - List - Singly linked lists – Doubly linked lists - Circular
linked lists, Applications -Polynomial Manipulation - Josephus problem(permutation)

Module:3 Sorting and Search Techniques 8 hours

Searching - Linear Search and binary search, Applications - Finding square root of ‘n’-Longest
Common Prefix

Sorting – Insertion sort - Selection sort – Bubble sort – ​(Counting Sort) - Quick sort- Merge sort ,
Analysis, Applications - Finding the ‘n’ closest pair’s

Module:4 Non-linear Data Structures - 6 hours

Trees

Tree - Terminology, Binary Tree – Terminology and Properties, Tree Traversals, Expression Trees –
Binary Search Trees – operations in BST – insertion, deletion, finding min and max, Finding the kth
minimum element in a BST, Applications – Dictionary

Module:5 Non-linear Data Structures - 6 hours

Graphs

Graph – basic definition and Terminology – Representation of Graph – Graph Traversal: Breadth First
Search (BFS), Depth First Search (DFS) - Minimum Spanning Tree: ​Prim's, Kruskal's​- Single
Source Shortest Path: Dijkstra’s Algorithm
 Module:6 Hashing 4 hours

Hash functions, open hashing-separate chaining, closed hashing - linear probing, quadratic probing,
double hashing, random probing, rehashing, extendible hashing, Applications – Dictionary-Telephone
directory

Module:7 Recent Trends 5 hours

Heaps - Heap sort, Applications -Priority Queue using Heaps

AVL trees – Terminology - basic operations(rotation, insertion and deletion),

Module 8:

Module:8 Recent trends in algorithms and 2 hours

data structures

Total 30 hours
Lectur
e
hours:

Text Book(s)

1 Thomas H. Cormen, C.E. Leiserson, R L.Rivest and C. Stein, Introduction to Algorithms , Third edition, MIT
. Press, 2009.

rd​
Mark A. Weiss,Data Structures & Algorithm Analysis in C++, 3​ edition, 2008, PEARSON.

2
.
Reference Books

1 Kurt Mehlhorn, and Peter Sanders – Algorithms and Data Sturctures The Basic Toolbox, Springer-Verlag
. Berlin Heidelberg, 2008.

2 Horowitz, Sahni, and S. Anderson-Freed , Fundamentals of Data Structures in C UNIVERSITIES

. PRESS,Second Edition,2008.

Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar

List of Challenging Experiments (Indicative)

1. Implementation of Stack and its applications 4 hours

2. Implementation of queue and its applications 4 hours

3. Linked List 4 hours

4. Searching algorithm 2 hours

5. Sorting algorithm – insertion, bubble, selection etc. 2 hours

6. Randomized Quick sort and merge sort 2 hours

7. Binary Tree traversals 2 hours

8. Binary search tree 2 hours

9. DFS, BFS 3 hours

10. Minimum Spanning Tree – Prim’s and Kruskal’s 3hours

 11. Single source shortest path algorithm – Connected Components 2 hours
and finding a cycle in a graph

Total Laboratory Hours 30 hours

Mode of evaluation:

Recommended by Board of Studies DD-MM-YYYY

Approved by Academic Council N Date DD-MM-YYYY

o
.
x
x