Scribd
Upload
3 views1 page

Syllabus DSA

The document outlines a course on Advanced Data Structures and Algorithms, covering key topics such as algorithm usage, hierarchical data structures, graph algorithms, algorithm design techniques, and NP completeness. It includes five units focusing on algorithm complexity, binary search trees, graph representations, dynamic programming, and NP-completeness. The course aims to equip students with the knowledge to select and design appropriate data structures and algorithms for various computing problems.

Uploaded by

divya.anantharajan05
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views1 page

Syllabus DSA

The document outlines a course on Advanced Data Structures and Algorithms, covering key topics such as algorithm usage, hierarchical data structures, graph algorithms, algorithm design techniques, and NP completeness. It includes five units focusing on algorithm complexity, binary search trees, graph representations, dynamic programming, and NP-completeness. The course aims to equip students with the knowledge to select and design appropriate data structures and algorithms for various computing problems.

Uploaded by

divya.anantharajan05
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

CP4151 ADVANCED DATA STRUCTURES AND ALGORITHMS L T P C

3 0 0 3
COURSE OBJECTIVES:
 To understand the usage of algorithms in computing
 To learn and use hierarchical data structures and its operations
 To learn the usage of graphs and its applications
 To select and design data structures and algorithms that is appropriate for problems
 To study about NP Completeness of problems.

UNIT I ROLE OF ALGORITHMS IN COMPUTING & COMPLEXITY 9


ANALYSIS
Algorithms – Algorithms as a Technology -Time and Space complexity of algorithms- Asymptotic
analysis-Average and worst-case analysis-Asymptotic notation-Importance of efficient
algorithms- Program performance measurement - Recurrences: The Substitution Method – The
Recursion-Tree Method- Data structures and algorithms.

UNIT II HIERARCHICAL DATA STRUCTURES 9


Binary Search Trees: Basics – Querying a Binary search tree – Insertion and Deletion- Red
Black trees: Properties of Red-Black Trees – Rotations – Insertion – Deletion -B-Trees:
Definition of B -trees – Basic operations on B-Trees – Deleting a key from a B-Tree- Heap –
Heap Implementation – Disjoint Sets - Fibonacci Heaps: structure – Mergeable-heap operations-
Decreasing a key and deleting a node-Bounding the maximum degree.

UNIT III GRAPHS 9


Elementary Graph Algorithms: Representations of Graphs – Breadth-First Search – Depth-First
Search – Topological Sort – Strongly Connected Components- Minimum Spanning Trees:
Growing a Minimum Spanning Tree – Kruskal and Prim- Single-Source Shortest Paths: The
Bellman-Ford algorithm – Single-Source Shortest paths in Directed Acyclic Graphs – Dijkstra‘s
Algorithm; Dynamic Programming - All-Pairs Shortest Paths: Shortest Paths and Matrix
Multiplication – The Floyd-Warshall Algorithm

UNIT IV ALGORITHM DESIGN TECHNIQUES 9


Dynamic Programming: Matrix-Chain Multiplication – Elements of Dynamic Programming –
Longest Common Subsequence- Greedy Algorithms: – Elements of the Greedy Strategy- An
Activity-Selection Problem - Huffman Coding.

UNIT V NP COMPLETE AND NP HARD 9


NP-Completeness: Polynomial Time – Polynomial-Time Verification – NP- Completeness and
Reducibility – NP-Completeness Proofs – NP-Complete Problems.
TOTAL : 45 PERIODS

You might also like