Scribd
Upload
8 views1 page

MTCSE1102

The document outlines the course 'Advanced Data Structures & Algorithms' for I Year - I Semester, focusing on various data structures such as linked lists, stacks, queues, trees, and graphs, along with their algorithms. It details course objectives, outcomes, and a structured curriculum divided into five units covering topics from basic data structures to advanced search trees. Additionally, it lists recommended textbooks and reference materials for further study.

Uploaded by

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

MTCSE1102

The document outlines the course 'Advanced Data Structures & Algorithms' for I Year - I Semester, focusing on various data structures such as linked lists, stacks, queues, trees, and graphs, along with their algorithms. It details course objectives, outcomes, and a structured curriculum divided into five units covering topics from basic data structures to advanced search trees. Additionally, it lists recommended textbooks and reference materials for further study.

Uploaded by

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

L T P C

I Year - I Semester
3 0 0 3
Advanced Data Structures & Algorithms (MTCSE1102)
Course Objectives: From the course the student will learn
Single Linked, Double Linked Lists, Stacks, Queues, Searching and Sorting techniques, Trees, Binary
trees, representation, traversal, Graphs- storage, traversal.
Dictionaries, ADT for List, Stack, Queue, Hash table representation, Hash functions, Priority queues,
Priority queues using heaps, Search trees.
AVL trees, operations of AVL trees, Red- Black trees, Splay trees, comparison of search trees.

Course Outcomes:
After the completion of the course, student will be able to
Ability to write and analyze algorithms for algorithm correctness and efficiency
Master a variety of advanced abstract data type (ADT) and data structures and their
Implementation
Demonstrate various searching, sorting and hash techniques and be able to apply and solve
problems of real life
Design and implement variety of data structures including linked lists, binary trees, heaps, graphs
and search trees
Ability to compare various search trees and find solutions for IT related problems

UNIT I: Introduction to Data Structures, Singly Linked Lists, Doubly Linked Lists, Circular Lists-
Algorithms. Stacks and Queues: Algorithm Implementation using Linked Lists.

UNIT II: Searching-Linear and Binary, Search Methods, Sorting-Bubble Sort, Selection Sort, Insertion
Sort, Quick Sort, Merge Sort. Trees- Binary trees, Properties, Representation and Traversals (DFT, BFT),
Expression Trees (Infix, prefix, postfix). Graphs-Basic Concepts, Storage structures and Traversals.

UNIT III: Dictionaries, ADT, The List ADT, Stack ADT, Queue ADT, Hash Table Representation,
Hash Functions, Collision Resolution-Separate Chaining, Open Addressing-Linear Probing, Double
Hashing.

UNIT IV: Priority queues- Definition, ADT, Realizing a Priority Queue Using Heaps, Definition,
Insertion, Deletion .Search Trees- Binary Search Trees, Definition, ADT, Implementation, Operations-
Searching, Insertion, Deletion.

UNIT V: Search Trees- AVL Trees, Definition, Height of AVL Tree, Operations-, Insertion, Deletion
and Searching, Introduction to Red-Black and Splay Trees, B-Trees, Height of B-Tree, Insertion, Deletion
and Searching, Comparison of Search Trees.
Text Books:
1. Data Structures: A Pseudo Code Approach, 2/e, Richard F.Gilberg, Behrouz
A. Forouzon and Cengage
2. Data Structures, Algorithms and Applications in java, 2/e, Sartaj Sahni,
University Press

Reference Books:
1. Data Structures and Algorithm Analysis, 2/e, Mark Allen Weiss, Pearson.
2. Data Structures and Algorithms, 3/e, Adam Drozdek, Cengage
3. C and Data Structures: A Snap Shot Oriented Treatise Using Live Engineering
Examples, N.B.Venkateswarulu, E.V.Prasad and S Chand & Co, 2009

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy