CB19241 - DATA STRUCTURES AND ALGORITHMS - LAB

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.

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.

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
Sl.
Date Period Topic Unit
No.
1 Basic array operations (Insert, delete and search I
an element)
2 Smallest and largest element in an array I
3 Sum of elements in an array I
4 Check if two arrays are the same or not I
5 Sum of positive square elements in an array I
6 Second smallest element in an array I
7 Reversing an array I
8 Count distinct elements of an array I
9 Print all distinct elements in an array I
10 Non-repeating elements of an array I
11 Repeating elements in an array I
12 Remove duplicate elements in an array I
13 Stack implementation using arrays II
14 Stack implementation using a Linked list II
15 Balanced parenthesis checker II
16 Infix to postfix using a stack II
17 Towers of Hanoi using user defined stacks II
18 Queue using arrays II
19 Queue using a linked list II
20 Singly Linked List II
21 Doubly Linked List II
22 Circular Linked List II
23 Polynomial addition II
24 Polynomial subtraction II
25 Polynomial differentiation III
26 Binary Tree III
27 Threaded Binary Tree III
28 Binary Search Tree III
29 B Tree III
30 B+ Tree III
31 AVL Tree III
32 Splay Tree III
33 Directed Graph III
34 Undirected Graph III
35 Sequential Search IV
36 Binary Search IV
37 Breadth First Search IV
38 Depth First Search IV
39 Insertion Sort IV
40 Selection Sort IV
41 Shell Sort IV
42 Divide and Conquer Sort IV
43 Merge Sort IV
44 Quick Sort IV
45 Heap Sort IV
46 Hashing IV
47 Files V
2 B.BHUVANESWARAN | AP (SG) | CSE | Rajalakshmi Engineering College
48 Sequential File V
49 Direct File V
50 Indexed Sequential File V
51 Hashed File V
52 Various types of accessing schemes V
53 Revision
54 Revision
55 Revision
56 Revision
57 Revision
58 Revision
59 Revision
60 Revision

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