Scribd
Upload
35 views2 pages

Data Structures (OE-1) Syllabus

This document outlines a course on data structures. The course objectives are to solve problems using linear data structures like lists, stacks and queues as well as advanced structures like balanced search trees. By the end of the course, students will be able to select the appropriate data structure for a problem, implement sorting and searching algorithms, and demonstrate operations on binary search trees, AVL trees, and B-trees. The course covers topics like linked lists, stacks, queues, hashing, sorting, binary trees, AVL trees, B-trees, red-black trees, splay trees, and priority queues.

Uploaded by

teludamodarjntu
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
35 views2 pages

Data Structures (OE-1) Syllabus

This document outlines a course on data structures. The course objectives are to solve problems using linear data structures like lists, stacks and queues as well as advanced structures like balanced search trees. By the end of the course, students will be able to select the appropriate data structure for a problem, implement sorting and searching algorithms, and demonstrate operations on binary search trees, AVL trees, and B-trees. The course covers topics like linked lists, stacks, queues, hashing, sorting, binary trees, AVL trees, B-trees, red-black trees, splay trees, and priority queues.

Uploaded by

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

L T P C

3 0 0 3
Data Structures
(Open Elective-I)

Course Objectives:
• Solve problems using data structures such as linear lists, stacks, queues,
hash tables
• Be familiar with advanced data structures such as balanced search trees,
AVL Trees, and B Trees.
Course Outcomes: By the end of the course, students will be able to
• Select appropriate data structures as applied to the specified problem
definition.
• Summarize and understand the practical applications of several advanced
techniques like Hashing and Analyzing and Implement appropriate sorting
/searching techniques for given problems.
• Demonstrate the operations such as Insertion, Deletion and Search on
Data structures like Binary Search Tree and solve the problems.
• Demonstrate the operations such as Insertion, Deletion and Search on
Advanced Data structures like Heaps, AVL trees and B Trees.
• Comparisons of trees like Red-Black trees and B-Trees etc., and priority
queue operations.
UNIT- I: Introduction to Data Structures: Abstract Data Types (ADTs), The
List ADT: Simple Array Implementation of Lists, Simple Linked Lists, Doubly
Linked Lists, Circularly Linked Lists. The Stack ADT: The Stack Model,
Implementation of Stacks, Applications of Stack. The Queue ADT: Queue
Model, Array Implementation of Queues, Application of Queues. Stacks and
Queue implementation using linked list.

UNIT-II: Searching: List Searches, Linear and Binary Search Methods.


Sorting: Selection Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort.
Hashing: Hash Function, Separate Chaining, Collision Resolution-Separate
Chaining.
UNIT- III: Trees: Binary Trees- Implementation, Expression Trees. Binary
Search Trees- find, find Min, and find Max, insert, delete operations.

UNIT- IV: Trees: AVL Trees- Single and Double Rotation, Operations.
B-Tree: searching, insertion, deletion

UNIT –V:
Trees: Introduction to Red-Black, splay trees and Comparison of Search Trees
Priority Queues: Priority Queue Models, Simple Implementations.

Text Books:
1. Data Structures and Algorithm Analysis, 4th Edition, Mark Allen
Weiss, Pearson.
2. Data Structures: A Pseudo Code Approach with C, 2nd Edition, Richard
F. Gilberg, &Behrouz A. Forouzon, Cengage.
References Books:
1. Data Structures, Algorithms and Applications in java, 2/e, Sartaj
Sahni, University Press.
2. Data Structures using C, 2/e, Reema Thareja

You might also like