E.M.G.
YADAVA WOMEN’S COLLEGE, MADURAI-14
(An Autonomous Institution – Affiliated to Madurai Kamaraj University)
Re-accredited (3rd Cycle) with Grade A+ & CGPA 3.51 by NAAC
CBCS
DEPARTMENT OF COMPUTER APPLICATIONS - UG
(w.e.f. 2017–2018 onwards)
Title of the Paper : Data Structures and Computer Algorithms
Semester : III Contact Hours : 4
Sub Code : 17S32 Credits :4
Objectives:
Understanding basic data structures and algorithms and demonstrate advantages and
disadvantages of specific algorithms and data structures.
Unit I
Introduction And Overview: Definitions-Concept of Data Structures-Overview of Data
Structures- Implementation of Data Structures-Arrays: Definitions- One dimensional array- -
Multidimensional Arrays- -Linked Lists: Definitions-Single Linked Lists-Circular linked lists-
Double linked lists Double linked lists.
Unit II
Stack: Introduction- Definitions - Representation of stack- Operations on stack – Queue:
Introduction- Definitions - Representation of Queue- Various Queue Structures – Circular Queue
– Deque – Priority Queue.
Unit III
Trees: Basic Terminologies-Definition and Concepts-Representation of Binary Tree-
Operations on Binary Tree-Types of Binary Trees-Graphs: Introduction-Graph Terminologies-
Representation of Graphs.
Unit IV
Algorithms: Introduction: What is an Algorithm? – Algorithm Specification –
Performance Analysis – Divide and Conquer: General method – Binary Search – Finding the
maximum and minimum – Merge Sort – Quick Sort – Selection –Strassen’s Matrix
Multiplication.
Unit V
The Greedy Method: General Method – Knapsack problem – Job Sequencing with
deadlines – Minimum cost spanning trees: Prim’s Algorithm – Kruskal Algorithm – Optimal
Storage on tapes – Optimal merge patterns – single source shortest path.
Text Books
1. D. Samanta, Classic Data Structures, PHI Pvt Ltd, New Delhi,Fifteenth Printing,2008.
Chapters :
Unit – I : 1, 2.1, 2.3, 2.4, 3.1 to 3.5
Unit – II : 4.1 to 4.4, 5.1 to 5.4
Unit – III : 7.1 to 7.5 , 8.1 to 8.3
2. Ellis Horrowitz, Sarataj Sahni,Sanguthevar Rajasekaran, Computer Algorithms / C++,
Universities Press Pvt Ltd, Hyderabad,2nd Edition,2008.
Chapters :
Unit IV : 1.1 to 1.3, 3.1,3.3 to 3.8
Unit V : 4.1,4.3,4.5,4.6,4.7,4.9
Reference Books
1. Alfred V.Aho, John E.Hopcraft and Jeffrey D.Ullman, Data Structures and Algorithms,
Pearson Education, Fourteenth Impression, 2013.
2. P.S.Subramanyam, C and C++ Programming concepts and Data Structures, BS Publications,
2013.
3. Ananda Raa Akepogu, Radhika Raju Palagiri, Data structures & algorithms using C++,
Dorling kindersely(India)Pvt Ltd, Pearson Education,2011.
4. Mark Allen weiss, Data structures & algorithms analysis in C++, Dorlingkindersely(India)
Pvt Ltd,Pearson Education,1st Edtion,2007.
5. Rick Decker &Stuart Hirshfield, Working with classes: Data structures and Alogorithms
using C++, Mass Market, 1st Edition,1995.
E.M.G.YADAVA WOMEN’S COLLEGE, MADURAI-14
(An Autonomous Institution – Affiliated to Madurai Kamaraj University)
Re-accredited (3rd Cycle) with Grade A+ & CGPA 3.51 by NAAC
CBCS
DEPARTMENT OF COMPUTER APPLICATIONS - UG
(w.e.f. 2017 – 2018 onwards)
Title of the Paper : Data Structures and Computer Algorithms Lab
Semester : III Contact Hours : 3
Sub Code : 17S3P Credits : 3
List of Programs:
Data Structures:
1.Implementing Stack as an array.
2. Implementing Stack as a linked list.
3. Convert Infix expression to Postfix expression using stack.
4. Convert Infix expression to Prefix expression using Stack.
5. Implementing Queue as an Array.
6. Implementing Queue as a linked list.
7. Implementing Circular Queue
8. Binary tree traversals.
9. Implement Binary Search Tree.
10.Representation of Graph.
Algorithms:
1. Linear Search
2. Binary Search
3. Bubble Sort Algorithm.
4. Insertion Sort Algorithm.
5. Merge Sort Algorithm.
6. Quick Sort Algorithm.
7. Selection Sort Algorithm.
8. Prim’s Algorithm.
9. Krushkal’s Algorithm.
10. Single Source Shortest Path.
