Scribd
Upload
7 views2 pages

Imp Questions

Uploaded by

doulasj
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
7 views2 pages

Imp Questions

Uploaded by

doulasj
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/ 2

21CP1601 ADVANCED DATA STRUCTURES

AND ALGORITHMS
Objectives

1. To understand the usage of algorithms in computing.

2. To learn and use hierarchical data structures and its operations

3. To learn the usage of graphs and its applications.

4. To select and design data structures and algorithms that is appropriate for problems.

5. To study about NP Completeness of problems.

UNIT I ROLE OF ALGORITHMS IN COMPUTING 12

Algorithms – Algorithms as a Technology- Insertion Sort – Analyzing Algorithms – Designing


Algorithms- Growth of Functions: Asymptotic Notation – Standard Notations and Common
Functions- Recurrences: The Substitution Method – The Recursion-Tree Method.

UNIT II HIERARCHICAL DATA STRUCTURES 12

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- Fibonacci
Heaps: structure – Mergeable-heap operations- Decreasing a key and deleting a node-Bounding
the maximum degree.

UNIT III GRAPHS 12

Elementary Graph Algorithms: Representations of Graphs – Breadth-First Search – Depth-First


Search – ToPO12ogical 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; All-Pairs Shortest Paths: Shortest Paths and Matrix Multiplication – The Floyd-
Warshall Algorithm.

UNIT IV ALGORITHM DESIGN TECHNIQUES 12

Dynamic Programming: Matrix-Chain Multiplication – Elements of Dynamic Programming –


Longest Common Subsequence- Greedy Algorithms: An Activity-Selection Problem – Elements
of the Greedy Strategy- Huffman Codes

UNIT V NP COMPLETE AND NP HARD 12

NP-Completeness: Polynomial Time – Polynomial-Time Verification – NP- Completeness and


Reducability – NP-Completeness Proofs – NP-Complete Problems.
FIRST UNIT

- Insertion Sort

Standard Notations and Common Functions

The Recursion-Tree Method

SECOND UNIT

Red-Black trees: Properties of Red-Black Trees – Rotations – Insertion – Deletion

Basic operations on B-Trees

Fibonacci Heaps

THIRD UNIT

Breadth-First Search – Depth-First Search

Kruskal and Prim

Dijkstra‘s Algorithm

The Floyd- Warshall Algorithm.

FOURTH UNIT

Matrix-Chain Multiplication

Greedy Algorithms

Huffman Codes

FIFTH UNIT

NP- Completeness and Reducability

NP-Completeness Proofs

You might also like