Login with Facebook
Login
Books
NCERT
CBSE
AIEEE
IITJEE
Tamilnadu
BITS MSSS
ANU
IPE
UPSC
DATA STRUCTURES
(
3
,
0
,
3
0
)
Share
add note
UNIT - I
Algorithm Analysis
Mathematical Back Ground
MOdel
What to Analyze
Running Time Calculations
Lists
Abstract Data types
The List ADT
Single Linked List ADT
Doubly Linked List ADT
Circular Linked List ADT
Polynomial ADT
UNIT - II
Stacks and Queues
The Stack ADT and its applications such as Infix to Postfix expression conversions
Evaluation of Postfix expressions
Delimeter Matching
The Queue ADT
The Circular Queue ADT
Sorting Preliminaries - Shellsort - Mergesort- Quicksort
UNIT - III
Preliminaries
Binary Trees
Implementation
Expression Trees
The Search Tree ADT
Binary Search Trees
Implementation
AVL Trees - Single Rotations, Double Rotations
UNIT - IV
Hashing
General Idea
Hash Function
Seperate Chaining
Open Addressing
Linear Probing
Priority Queues (Heaps)
Model
Simple Implementations
Binary Heap
Heap Sort
Graphs : Definitions, representations,graph traversals
Engineering
Computer Science
Bapatla Engineering College
Acharya Nagarjuna University
Ist Semester
3rd
Yearbook
see all moderators
,
become moderator
see all followers
Attachments
DATA STRUCTURES in C
DATA STRUCTURES in C++ DOWNLOAD
DATA STRUCTURES in JAVA DOWNLOAD
Your Ad Here
,
, 
