SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

RAMAPURAM CAMPUS
FACULTY OF SCIENCE & HUMANITIES

COURSE PLAN

Academic Year : 2023-2024 Name of the Faculty Member:

Branch/ Programme : BCA Department : Computer Applications
Year and Semester : I / II Regulations : 2023
Course Code & Name : USA23202J & FUNDAMENTALS OF DATA STRUCTURES AND ALGORITHMS
Core / Elective : Core

Course Outcomes (CO):

1. Identify linear and non-linear data structures. Create algorithms for searching and sorting
2. Create the different types of linked lists and evaluate its operations
3. Construct stack and queue data structures and evaluate its operations
4. Create tree data structures and evaluate its types and operations
5. Create graph data structure, evaluate its operations, implement algorithms to identify shortest path

S. Unit. Date Period Name of the Topic Planned for the Contact Pedagogy PO & PSO
No No followed (Mention
Period hours
the
number(s))

1 Introduction to theory of data structures, 1 1

Data representation
2 Abstract Data type, Classification of 1 1
data types
3 Asymptotic Notation, Algorithm 1 2
Analysis, Recursion
4 Introduction to Data structures, Data 1 1
Structures and its uses
5 Linear and Non-Linear Data Structures, 1 1
Operations on data structure
I
6 Array types, Array operations, 1 1
Applications of arrays
Dynamic memory allocation
7 Introduction to lists, Linked list 1 2
operations
8 Types of Linked Lists, Linked list vs. 1 3
Arrays
9 Application of linked list, Performance 1 2
Analysis and Measurement of
algorithm, Efficiency of algorithm,
Time complexity and space complexity
10 Introduction to stack, Representation of 1 2
stack through array
11 Representation of stack through linked 1 1
list, Operations on stack
12 Disadvantages of Stack, Polish 1 8
Notations, Applications – Evaluation of
Expression, Tower of Hanoi, Infix to
Postfix expression
13 Queue, Representation of Queue using 1 4
Arrays and Linked list
14 Operations on Queue, Circular Queue 1 3

15 Double ended Queue, Priority Queue, 1 5

Reversing a Queue
II using another queue, Applications of
Queue
16 Introduction to nonlinear data 1 5
structures, Tree ADT and
Terminologies
17 Tree Terminologies, Tree 1 1
Representation
18 Tree Types and Operations, Binary 1 1
Tree Representation, Properties of
binary tree
19 Tree Traversals – In order, preorder, 1 4
Tree Traversals - Post order
20 Binary Search Tree, Threaded Binary 1 2
Search Tree
21 Binary Search Tree: Construction, 1 11
Binary Search Tree: Insertion,
Searching
22 Applications of trees, Applications of 1 3
BST
III Expression trees, Example 1
23 3

24 AVL Tree, AVL Tree Rotations, 1 4

Applications of AVL tree
25 Minimum Heap Construction, Example 1 4

26 Minimum Heap Deletion Construction, 1 5

Example
27 Maximum Heap Construction, 1 6
Maximum Heap Deletion Construction
Applications of Heaps and AVL trees
28 Introduction to sorting, Different types 1 3
of sorting
29 Bubble sort, Example 1 2
30 Insertion Sort, Quick sort Example 1 4

31 Selection sort, Example 1 3

IV
32 Merge sort, Example 1 5

33 Radix sort, Heap Sort 1 2

Example, Comparison of sorts
34 Introduction to searching, Linear 1 1
search, Binary search
35 Comparison of different search, Define 1 1
Hashing, Hash functions
36 Hashing: Collision avoidance Hashing: 1 9
Separate chaining, Open addressing,
Advantages of Hashing
37 Graph Terminology, Representation of 1 2
graph – Arrays
38 Representation of graph – Linked list, 1 3
Graph Traversal – BFS
39 Example, Graph Traversal – DFS, 1 3
Topological Sorting
40 DFS-Topological Sorting 1 3
V
41 BFS-Topological Sorting 1 3

42 Minimum spanning tree – Prims, 1 6

Minimum Spanning Tree – Kruskals
43 Algorithm Design and Analysis, Greedy 1 8
Algorithms
44 Backtracking, Example 1 10

45 Divide And Conquer, Example 1 10

Lab Session Details (If Applicable)

Sl. Unit. Date Period(s) Name of the Topic Planned for the Contact Pedagogy PO & PSO
Period(s) followed (Mention
No No hours
the
number(s))
1 I Recursion 3 2

2 I Arrays 3 2

3 I Implementation of Linked List 3 3

 4 II Implementation of stack and its 3 2
applications

5 II Queue implementation using array and 3 3

pointers

6 II Implementation of binary tree using 3 3

Arrays

7 III Implement all the three types of Tree 3 3

Traversals

8 III Implementation of BST Heap Data 3 3

Structure

9 III Implementation of Min and Max Heap 3 2

10 IV Implementation of Bubble and Insertion 3 3

sort

11 IV Implementation of Quick sort and 3 3

merge sort

12 IV Linear search and Binary search 3 3

13 V Implementation of Graph using Array 3 3

14 V Implementation of shortest path 3 3

algorithm

15 V Implementation of minimum spanning 3 3

tree

Sl. No. Learning Resources

1 Seymour Lipschutz, (2014), “Data Structures with C”, McGraw Hill Education, Special Indian
Edition

2 SRD Group, (2013), “Data structures using C”,McGraw Hill, 2nd Edition,

3 R.F.Gilberg, B.A.Forouzan, (2005), “Data Structures”, Thomson Indi, 2nd Edition,

4 A.V.Aho, J.E Hopcroft , J.D.Ullman, (2003), “Data structures and Algorithms”, 1st Edition, Pearson
Education

5 Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson
Education
 6 ReemaThareja, (2011), “Data Structures Using C”, 1st Edition, Oxford Higher Education

Course In-charge
HOD