Scribd
Upload
77 views

Cap770 - Advanced Data Structures

The document outlines an advanced data structures course that covers topics like stacks, queues, trees, graphs, and hashing. The course aims to describe advanced data structures, understand algorithm complexity, apply suitable structures to problems, and analyze algorithm performance. Key concepts covered include arrays vs linked lists, binary search trees, heaps, graphs, and hashing techniques. Practical work involves programs on arrays, lists, stacks, queues, trees, heaps, graphs, and hash tables.

Uploaded by

PUNAM THAPA
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
77 views

Cap770 - Advanced Data Structures

The document outlines an advanced data structures course that covers topics like stacks, queues, trees, graphs, and hashing. The course aims to describe advanced data structures, understand algorithm complexity, apply suitable structures to problems, and analyze algorithm performance. Key concepts covered include arrays vs linked lists, binary search trees, heaps, graphs, and hashing techniques. Practical work involves programs on arrays, lists, stacks, queues, trees, heaps, graphs, and hash tables.

Uploaded by

PUNAM THAPA
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CAP770: ADVANCED DATA STRUCTURES

L: 3 T: 0 P: 2 Credits: 4

Course Outcomes: Through this course students should be able to

CO1 :: Describe advanced data structures and perform operations on them


CO2 :: Understand abstract data types and algorithmic complexity
CO3 :: Apply suitable data structure for solving different types of problems
CO4 :: Analyze the performance of various algorithms

Unit I

Introduction: need of data structures and algorithms, time and space complexity of algorithms,
asymptotic notations, average and worst case analysis, arrays vs linked lists, operations on arrays
and linked lists.

Unit II

Stacks and queues: implementation of stacks, applications of stacks: quick sort, parenthesis
checker, arithmetic expression conversion and evaluation, tower of Hanoi problem, role of stack
in recursion, implementation of queues, priority queue, applications of queues

Unit III

Search trees: binary search trees: searching, insertion and deletion operations, AVL trees:
balancing operations, b-trees: properties and operations, red-black trees, splay trees: properties
and operations, 2-3 trees: properties and operations

Unit IV

Heaps: introduction to heaps, min heap, max heap, operations on heap, applications of heap:
priority queue implementation, heap sort, binomial heaps, Fibonacci heaps

Unit V

Graphs: type of graphs, adjacency matrix and linked adjacency chains, connected components
and spanning trees, breadth first search, depth first search, network flow problems, warshall's
algorithm for shortest path, topological sort

Unit VI

Hashing techniques: linear list representation, hash table representation, hash functions, collision
resolution-separate chaining, open addressing-linear probing, quadratic probing, double hashing,
rehashing
Practical
 Programs based on Arrays operations
 Programs based on Linked Lists operations
 Programs based on Stack implementation and its applications such as quick sort, arithmetic
expression conversion and evaluation, tower of Hanoi problem
 Program based on implementation of Queues
 Programs based on Binary Search Tree and its operations
 Programs to implement heaps using priority queues and heapsort technique
 Program based on BFS and DFS techniques in Graphs
 Program based on hash tables

Text Books:
1. DATA STRUCTURES AND ALGORITHMS IN C++ by ADAM DROZDEK, THOMSON
EDUCATIONAL PUBLISHING
References:
1. DATA STRUCTURES AND ALGORITHM ANALYSIS IN C by MARK ALLEN WEISS,
ADDISON-WESLEY
2. DATA STRUCTURES AND ALGORITHMS by AHO, HOPCRAFT, ULLMAN, PEARSON
3. INTRODUCTION TO ALGORITHMS by CORMEN, THOMAS H., LEISERSON, CHARLES E.,
RIVEST, RONALD L., STEIN, CLIFFORD, PHI Learning Pvt Ltd

You might also like