Scribd
Upload
160 views1 page

ADS LAB Syllabus

The document outlines an advanced data structures lab course syllabus. It includes implementing various data structures like dictionaries, AVL trees, 2-3 trees, binary heaps and graphs. It also includes algorithms like depth first search, breadth first search, Prim's algorithm, Kruskal's algorithm and Dijkstra's algorithm.

Uploaded by

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

ADS LAB Syllabus

The document outlines an advanced data structures lab course syllabus. It includes implementing various data structures like dictionaries, AVL trees, 2-3 trees, binary heaps and graphs. It also includes algorithms like depth first search, breadth first search, Prim's algorithm, Kruskal's algorithm and Dijkstra's algorithm.

Uploaded by

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

LENDI INSTITUTE OF ENGINEERING AND TECHNOLOGY

(Approved by A.I.C.T.E & Affiliated to JNTU,Kakinada)


Jonnada (Village), Denkada (Mandal), Vizianagaram Dist – 535 005
Phone No. 08922-241111, 241112
E-Mail: [email protected] Website: www.lendi.org

II Year – II SEMESTER ADVANCED DATA STRUCTURES LAB


(Note: C++ and Java implementation is not included in the syllabus)

II Year – II SEMESTER TPC


032

1. To implement functions of Dictionary using Hashing ( division method, Multiplication


method, Universal hashing)
2. To perform various operations i.e, insertions and deletions on AVL trees
3. To perform various operations i.e., insertions and deletions on 2-3 trees.
4. To implement operations on binary heap.
5. To implement operations on graphs
i) vertex insertion
ii) Vertex deletion
iii) finding vertex
iv)Edge addition and deletion
6. To implement Depth First Search for a graph non recursively.
7. To implement Breadth First Search for a graph non recursively.
8. To implement Prim’s algorithm to generate a min-cost spanning tree.
9. To implement Krushkal’s algorithm to generate a min-cost spanning tree.
10. To implement Dijkstra’s algorithm to find shortest path in the graph.
11. To implement pattern matching using Boyer-Moore algorithm.
12. To implement Knuth-Morris-Pratt algorithm for pattern matching.

Text Books :
1. Data Structures, A Pseudocode Approach, Richard F Gilberg, Behrouz A Forouzan, Cengage.
2. Fundamentals of DATA STRUCTURES in C: 2nd ed, , Horowitz , Sahani, Anderson-freed,
Universities Press
3. Data structures and Algorithm Analysis in C, 2nd edition, Mark Allen Weiss, Pearson

Reference Books:
1. Web : http://lcm.csa.iisc.ernet.in/dsa/dsa.html
2. http://utubersity.com/?page_id=878
3. http://freevideolectures.com/Course/2519/C-Programming-and-Data-Structures
4. http://freevideolectures.com/Course/2279/Data-Structures-And-Algorithms
5. File Structures :An Object oriented approach with C++, 3rd ed, Michel J Folk, Greg Riccardi,
Bill Zoellick
6. C and Data Structures: A Snap Shot oriented Treatise with Live examples from Science and
Engineering, NB Venkateswarlu & EV Prasad, S Chand, 2010.

You might also like