Download Course Plan

MCA3005
DATA STRUCTURES
L
T
1
BASIC STRUCTURES
Introduction – General Rules for running time calculation – List ADT –
Queues
P
0
C
3
Stacks –
TREES
Trees – Binary trees - Binary tree Traversals – Expression trees – Threaded binary trees Binary search trees
HEAPS AND GRAPHS
Priority queues – Binary Heaps - Graphs - Definition, Representation - Topological sort –
Shortest Path Algorithms – Un Weighted Shortest path , Dijkstra’s Algorithms –
Minimum spanning tree algorithms - Prim’s and Kruskal Algorithm.
SORTING AND SEARCHING
Types Of sorting - Internal sorting – Bubble sort, Selection sort, Insertion sort, Heap sort,
Shell sort - External sorting – Multi-way merge – Searching - Linear search, Binary
search – Hashing – Hash function , Separate chaining, Open Addressing.
ADVANCED DATA STRUCTURES
AVL trees – Splay trees – Red Black trees – Deterministic skip tests – AA trees Multidimensional data structures.
TEXT BOOK
1.Mark Allen Weiss, Data structures and Algorithm Analysis in C, 3rd Edition,
Pearson Education, 2010.
REFERENCES
1.Langsam, Augenstein, Tenenbaum, Data structures using C and C++, 2nd Edition,
Prentice Hall, 2002.
2.Aho, Hopcroft, Ullman, Data Structures and Algorithms, Addison Wesley, 2004.
KALASALINGAM UNIVERSITY
(Kalasalingam Academy of Research and Education)
ANAND NAGAR, KRISHNANKOIL – 626 190
DEPARTMENT OF COMPUTER APPLICATIONS
Name of the Staff
COURSE PLAN
: Ms. P. Vidhya Saraswathi
Subject with Code
: DATA STRUCTURES AND ALGORITHMS / MCA3005
Branch / Semester
: MCA/ I
Pre Requisites:
Students need to have basic knowledge in C Programming.
Objectives:
1. To introduce the concept of arrays, structures, pointers and recursion.
2. To study stack, queue and linked list concepts.
3. To study trees, representation of trees, tree traversal and basic operations on trees.
4. To study some of sorting and searching techniques.
5. To study some of advanced data structures concepts.
Learning outcome and end use:
1. Students have the basic knowledge about data structures and their applications.
Text Book:
1.Mark Allen Weiss, Data structures and Algorithm Analysis in C, 3rd Edition,
Pearson Education, 2010. ( T1 )
List of Reference Books:
1.Langsam, Augenstein, Tenenbaum, Data structures using C and C++, 2nd Edition,
Prentice Hall, 2002.( R1 )
2.Aho, Hopcroft, Ullman, Data Structures and Algorithms, Addison Wesley, 2004.
( R2)
Web Resources

http://en.wikibooks.org/wiki/Data_Structures/Stacks_and_Queues

http://www.w3professors.com/Pages/Courses/Data-Structure/Algorithms/DataStructure-Algorithm.html

http://www.cs.auckland.ac.nz/~jmor159/PLDS210/trees.html

http://www.cs.sunysb.edu/~algorith/files/graph-data-structures.shtml

http://www.mpi-inf.mpg.de/~mehlhorn/DatAlgbooks.html
Lesson Plan
S.No
Topic Name
Text Book
No of
periods
Cumulative
Periods
UNIT I- BASIC STRUCTURES
1
2
3
4
5
6
7
8
9
10
11
Abstract Data Type(ADT)
List ADT
Array Based implementation
Linked List implementation
Cursor based Linked List
Doubly Linked List
Application of Lists
Stack ADT
T1
T1
T1
T1
T1
T1
T1
T1
1
1
1
1
1
1
1
1
2
3
4
5
6
7
1
8
Queue ADT
Circular queue implementation
Application of Stack and Queue
T1
T1
T1
1
1
1
9
10
11
1
1
1
1
2
12
13
14
15
17
1
1
23
24
UNIT II- TREES
12
13
14
15
16
Tree ADT
Tree traversals
Binary tree ADT
Expression tree and Application of Tree
Threaded binary tree
T1
T1
T1
T1
T1
UNIT III- HEAPS AND GRAPHS
17
18
19
20
21
22
Heaps and Binary Heaps
Application of Binary Heaps
Graphs Definition, Representation
Topological sort
Shortest Path Algorithms
Un Weighted Shortest path , Dijkstra’s
Algorithms
T1
T1
23
Minimum spanning tree algorithms
Prim’s and Kruskal Algorithm.
UNIT IV SORTING AND SEARCHING
24
25
26
27
28
29
30
31
32
Types Of sorting
Internal sorting
Bubble sort, Selection sort,
Shell sort , External sorting
Insertion sort, Heap sort
Multi-way merge Searching
Linear search, Binary search
Hashing Hash function , Separate
chaining
Open Addressing
T1
T1
T1
T1
T1
T1
T1
T1
1
2
1
1
1
1
1
1
26
28
29
30
31
32
33
34
T1
1
35
UNIT-V ADVANCED DATA STRUCTURES
33
34
35
36
37
39
40
AVL Trees
Splay Tree
B-Tree
Red Black trees
Deterministic skip tests
AA trees
Multidimensional data structures
T1
T1
T1
T1
T1
T1
T1
1
2
1
1
1
1
2
Prepared by
Verified By
Staff in-charge
HOD/CA
37
39
40
41
42
43
45
KALASALINGAM UNIVERSITY
(Kalasalingam Academy of Research and Education)
ANAND NAGAR, KRISHNANKOIL – 626 190
DEPARTMENT OF COMPUTER APPLICATIONS
Name of the Staff
: Ms. P.Vidhya Saraswarthi
Subject with Code
: DATA STRUCTURES AND ALGORITHMS/ MCA3005
Branch / Semester
: MCA/ I
List of Seminar Topic Assigned
S.No
Topic
1
Applications of lists, stack and queue.
2
Expression trees and evaluation of expressions, Hashing
function ,AVL Trees
3
Dynamic programming –Floyd algorithm and Dijistra
algorithm
4
Minimum Spanning Tree Prims, Kruskal’s Algorithms
Staff in-charge
HOD/CA
KALASALINGAM UNIVERSITY
(Kalasalingam Academy of Research and Education)
ANAND NAGAR, KRISHNANKOIL – 626 190
DEPARTMENT OF COMPUTER APPLICATIONS
Name of the Staff
: Ms. P. Vidhya Saraswathi
Subject with Code
: Data Structures and Algorithms/ MCA3005
Branch / Semester
: MCA/ III
List of Tutorial
S.No
Topic
1
Consider the linear array NAME which is sorted alphabetically.
1
2
3
4
5
6
7
8
Adam
Clark
Evans
Gupta
Jones
Lane
Pace
Smith
*. Suppose Davis is to be inserted into the array. How many names must be
moved to new locations?
*. Suppose Gupta is to be deleted from the array. How many names must be
moved to new locations?
2
3
Discuss whether a stack or queue is the appropriate structure for the determining
the order in which elements are processed in each of the following situations.
*. Batch computer programs are submitted to the computer center.
*. Program A calls sub program B, which calls sub program C and so on.
Consider the algebraic expression (7X+Y)(5A-B)3.
*. Draw the corresponding tree diagram.
*. Find the scope of the exponential operation. (The scope of a node V in a tree is
the sub tree consisting of V and the nodes following V).
Staff in-charge
HOD/CA