CB19241 - DATA STRUCTURES AND ALGORITHMS - THEORY

Course Pre Requisites:

Students should have knowledge of Fundamentals of data types and programming concepts

Course Objective:

 The course is aimed to provide an understanding of key concepts underlying the choice
and implementation of data structures, algorithms and step by step approach in solving
problems with the help of these fundamental data structures.

Unit – I - Basic Terminologies & Introduction to Algorithm and Data Organisation

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

Unit – II - Linear Data Structure

Array, Stack, Queue, Linked-list and its types, Various Representations, Operations &
Applications of Linear Data Structures

Unit – III - Non-linear Data Structure

Trees (Binary Tree, Threaded Binary Tree, Binary Search Tree, B & B+ Tree, AVL Tree, Splay
Tree) and Graphs (Directed, Undirected), Various Representations, Operations (search and
traversal algorithms and complexity analysis) & Applications of Non-Linear Data Structures

Unit – IV - Searching and Sorting on Various Data Structures

Sequential Search, Binary Search, Breadth First Search, Depth First Search, Insertion Sort,
Selection Sort, Shell Sort, Divide and Conquer Sort, Merge Sort, Quick Sort, Heap Sort,
Introduction to Hashing

Unit – V – File

Organisation (Sequential, Direct, Indexed Sequential, Hashed) and various types of accessing
schemes.

Course Outcomes:

Students will be able to:

 Understand the fundamentals and analysis of algorithms.
 Understand and implement Linear data structures.
 Understand and implement Non Linear data structure of Trees.
 Understand and implement Non Linear data structure of Graphs.
 Understand the concepts of distributed system security.
Text Books:

1. Fundamentals of Data Structures, E. Horowitz and S. Sahni, 1977.

2. Data Structures and Algorithms, Alfred V. Aho, John E. Hopperoft, Jeffrey D. UIlman.

Reference Books:

1. The Art of Computer Programming: Volume 1: Fundamental Algorithms, Donald E. Knuth

2. Introduction to Algorithms, Thomas, H. Cormen, Charles E. Leiserson, Ronald L. Rivest,
Clifford Stein.
3. Open Data Structures: An Introduction (Open Paths to Enriched Learning), 31st ed. Edition,
Pat Morin

2 B.BHUVANESWARAN | AP (SG) | CSE | Rajalakshmi Engineering College

Sl. T/R-
Date Period Topic Unit Pages (s)
No. No.
1 Algorithm specification I
2 Recursion I
3 Performance analysis I
4 Asymptotic Notation I
5 Big-O notation I
6 Omega notation I
7 Theta notation I
8 Programming Style I
9 Refinement of Coding - Time- I
Space Trade Off
10 Testing I
11 Data Abstraction I
12 Revision I
13 Activity I
14 Array II
15 Stack II
16 Queue II
17 Linked-list II
18 Linked-list Types II
19 Various representations II
20 Operations of Linear Data II
Structures
21 Applications of Linear Data II
Structures
22 Revision II
23 Activity II
24 Binary Tree III
25 Threaded Binary Tree III
26 Binary Search Tree III
27 B and B+ Tree III
28 AVL Tree III
29 Splay Tree III
30 Graphs-Directed, III
31 Graphs-Undirected III
32 Various Representations III
33 Operations - Search algorithms III
34 Operations - Traversal III
algorithms
35 Operations - Complexity analysis III
36 Applications of Non-Linear Data III
Structures
37 Revision III
38 Activity III
39 Sequential Search IV
40 Binary Search IV
41 Breadth First Search IV
42 Depth First Search IV
43 Insertion Sort IV
B.BHUVANESWARAN | AP (SG) | CSE | Rajalakshmi Engineering College 3
44 Selection Sort IV
45 Shell Sort IV
46 Divide and Conquer Sort IV
47 Merge Sort IV
48 Quick Sort IV
49 Heap Sort IV
50 Introduction to Hashing IV
51 Revision IV
52 Activity IV
53 File Organization V
54 Sequential File V
55 Direct File V
56 Indexed Sequential File V
57 Hashed File V
58 Various types of accessing V
schemes
59 Revision V
60 Activity V

4 B.BHUVANESWARAN | AP (SG) | CSE | Rajalakshmi Engineering College