Data Structures
Uploaded by
RajyaLakshmi UppalaData Structures
Uploaded by
RajyaLakshmi UppalaDATA STRUCTURES
Objectives: Comprehensive knowledge of data structures and ability to implement the same
in software applications.
UNIT I:
Objective: exposure to algorithmic complexities, recursive algorithms, searching and sorting
techniques Preliminaries of algorithm, Algorithm analysis and complexity, Data structure-
Definition , types of data structures Recursion: Definition, Design Methodology and
Implementation of recursive algorithms, Linear and binary recursion, recursive algorithms for
factorial function, GCD computation, Fibonacci sequence, Towers of Hanoi, Tail recursion
List Searches using Linear Search, Binary Search, Fibonacci Search Sorting Techniques:
Basic concepts, Sorting by : insertion (Insertion sort), selection (heap sort), exchange (bubble
sort, quick sort), distribution (radix sort )and merging (merge sort ) Algorithms.
UNIT II:
Objectives: Applying stack and queue techniques for logical operations Stacks and Queues:
Basic Stack Operations, Representation of a Stack using Arrays, Stack Applications:
Reversing list, Factorial Calculation, Infix to postfix Transformation, Evaluating Arithmetic
Expressions. Queues: Basic Queues Operations, Representation of a Queue using
array, Implementation of Queue Operations using Stack, Applications of Queues-Round
robin Algorithm, Circular Queues, Priority Queues.
UNIT III:
Objectives: Exposure to list representation models in various types of applications Linked
Lists: Introduction, single linked list, representation of a linked list in memory, Operations on
a single linked list, Reversing a single linked list, applications of single linked list to
represent polynomial expressions and sparse matrix manipulation, Advantages and
disadvantages of single linked list, Circular linked list, Double linked list.
UNIT IV:
Objectives: Implementation of tree implementation in various forms Trees: Basic tree
concepts, Binary Trees: Properties, Representation of Binary Trees using arrays and linked
lists, operations on a Binary tree , Binary Tree Traversals (recursive), Creation of binary tree
from in, pre and post order traversals.
UNIT-V:
Objectives: Advanced understanding of other variants of trees and their operations Advanced
concepts of Trees: Tree Travels using stack (non recursive), Threaded Binary Trees. Binary
search tree, Basic concepts, BST operations: insertion, deletion, Balanced binary trees – need,
basics and applications in computer science (No operations)
UNIT VI:
Objectives: orientation on graphs, representation of graphs, graph traversals, spanning trees
Graphs: Basic concepts, Representations of Graphs: using Linked list and adjacency matrix,
Graph algorithms Graph Traversals (BFS & DFS), applications: Dijkstra’s shortest path,
Transitive closure, Minimum Spanning Tree using Prim’s Algorithm, warshall’s
Algorithm( Algorithemic Concepts Only, No Programs required).
TEXT BOOKS:
1. Data Structure with C, Seymour Lipschutz, TMH.
2. Data Structures using C,Reema Thareja, Oxford.
3. Data Structures, 2/e, Richard F, Gilberg , Forouzan, Cengage.
4. Data Structure & Algorithm Analysis in C, 2nd Edition Mark Allen Weiss REFERENCE.
