Scribd
Upload
8 views1 page

Designn and Analysis of Algorithm Unit-II

The document outlines the syllabus for BCS 503, focusing on the design and analysis of algorithms. It covers advanced data structures including Red-Black Trees, B-Trees, Binomial Heaps, Fibonacci Heaps, Tries, and Skip Lists. This unit aims to provide an in-depth understanding of these data structures.

Uploaded by

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

Designn and Analysis of Algorithm Unit-II

The document outlines the syllabus for BCS 503, focusing on the design and analysis of algorithms. It covers advanced data structures including Red-Black Trees, B-Trees, Binomial Heaps, Fibonacci Heaps, Tries, and Skip Lists. This unit aims to provide an in-depth understanding of these data structures.

Uploaded by

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

BCS 503

DESIGN AND ANALYSIS OF ALGORITHM

UNIT 2 Advanced Data Structures

SYLLABUS

Red-Black Trees, B – Trees, Binomial Heaps, Fibonacci Heaps, Tries,


Skip List

You might also like