Scribd
Upload
61 views1 page

CA9112

This document outlines the units and topics covered in a course on data structures and algorithm design. The 5 units cover fundamentals, common data structures, algorithm design using techniques like divide-and-conquer and greedy approaches, dynamic programming, and approximation algorithms. Key topics include asymptotic analysis, NP-completeness, heaps, trees, tries, matrix multiplication, string editing, graph problems, and scheduling. References for the course include books on data structures, algorithms, and algorithmics theory.

Uploaded by

arul07097265
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
61 views1 page

CA9112

This document outlines the units and topics covered in a course on data structures and algorithm design. The 5 units cover fundamentals, common data structures, algorithm design using techniques like divide-and-conquer and greedy approaches, dynamic programming, and approximation algorithms. Key topics include asymptotic analysis, NP-completeness, heaps, trees, tries, matrix multiplication, string editing, graph problems, and scheduling. References for the course include books on data structures, algorithms, and algorithmics theory.

Uploaded by

arul07097265
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CA9112 DATA STRUCTURES AND ALGORITHM DESIGN

LTPC
3003
UNIT I FUNDAMENTALS 9

Mathematical Induction - Asymptotic Notations – Properties of Big-oh Notation –


Conditional Asymptotic Notation – Algorithm Analysis – Amortized Analysis – NP-
Completeness – NP-Hard – Recurrence Equations – Solving Recurrence Equations –
Memory Representation of Multi-dimensional Arrays – Time-Space Tradeoff.

UNIT II DATA STRUCTURES 9

Min/Max heaps – Leftist Heaps – Skew Heaps – AVL Trees – Red-Black Trees – B-
Trees – Splay Trees – Tries.

UNIT III ALGORITHM DESIGN: I 9

Divide and Conquer strategy – Selection of k-th Smallest Elements – Convex Hull –
Strassen’s Matrix Multiplication – Greedy Approach – Container Loading – Tree Vertex
Splitting – Optimal Merge Patterns.

UNIT IV ALGORITHM DESIGN: II 9

Dynamic Programming Approach – Principle of Optimality – String Editing – Flow Shop


Scheduling – Connected Components – Bi-Connected Components Graph Coloring
using Backtracking Technique – Branch and Bound Methodology.

UNIT V APPROXIMATION ALGORITHMS 9

Planar Graph Coloring – Maximum Program Stored Problem – Bin Packing – Scheduling
Independent Tasks – 0/1 Knapsack – Rounding – Interval Partitioning.

TOTAL = 45

REFERENCES

1. E. Horowitz, S.Sahni and Dinesh Mehta, Fundamentals of Data structures in


C++, Uiversity Press, 2007.
2. E. Horowitz, S. Sahni and S. Rajasekaran, Computer Algorithms/C++, Second
Edition, University Press, 2007.
3. G. Brassard and P. Bratley, Algorithmics: Theory and Practice, Printice –Hall,
1988.

You might also like