Here, Data structure material is provided as per the JNTU syllabus.
To DOWN LOAD UNIT I MATERIAL CLICK DOWN
UNIT-I
To DOWN LOAD UNIT II MATERIAL CLICK DOWN
UNIT-II
To DOWN LOAD UNIT II MATERIAL CLICK DOWN
UNIT-III
To DOWN LOAD ONLINE BITS CLICK DOWN
ONLINE BITS
To DOWN LOAD UNIT IV MATERIAL
To DOWN LOAD UNIT V MATERIAL
To DOWN LOAD UNIT VI MATERIAL
To Download questions Click Here
To Download II mid bits Click HERE
Download the programs of Single linked list and BST
Hello not simply downloading keep some comments.
DATA STRUCTURES
UNIT
I:
Recursion and Linear Search:
Preliminaries of algorithm, Algorithm
analysis and complexity.
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,
UNIT
II: 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
III: Stacks and Queues:
Basic
Stack Operations, Representation of a Stack using Arrays, Stack Applications:
Reversing list, Factorial Calculation,
In-fix- 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, Enqueue,
Dequeue, Circular Queues, Priority Queues.
UNIT
IV: Linked Lists:
Introduction, single linked list, representation of
a linked list in memory, Operations on a single linked list, merging two single
linked lists into one 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
V: 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-order and
pre(post)order traversals,
UNIT
VI: 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
VII: 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.
Unit
VIII:
Sets:
Definition,
Representation of Sets using Linked list, operations of sets using linked
lists, application of sets- Information storage using bit strings
Abstract
Data Type
Introduction to abstraction, Model for an Abstract Data Type, ADT Operations,
ADT Data Structure, ADT Implementation of stack and queue .
TEXT BOOKS:
1.
Data
Structures, 2/e, Richard F, Gilberg , Forouzan, Cengage
2.
Data
Structures and Algorithms, 2008,G.A.V.Pai, TMH
REFERENCE BOOKS:
1.
Data
Structure with C, Seymour Lipschutz, TMH
2.
Classic
Data Structures, 2/e, Debasis ,Samanta,PHI,2009
3.
Fundamentals
of Data Structure in C, 2/e, Horowitz,Sahni, Anderson Freed,University Prees
UNIT-I
To DOWN LOAD UNIT II MATERIAL CLICK DOWN
UNIT-II
To DOWN LOAD UNIT II MATERIAL CLICK DOWN
UNIT-III
To DOWN LOAD ONLINE BITS CLICK DOWN
ONLINE BITS
To DOWN LOAD UNIT IV MATERIAL
To DOWN LOAD UNIT V MATERIAL
To DOWN LOAD UNIT VI MATERIAL
To Download questions Click Here
To Download II mid bits Click HERE
Download the programs of Single linked list and BST
Hello not simply downloading keep some comments.
