Scribd
Upload
72 views

Aknu-Data Structures and Algorithms - 093633

syllabus foe ads aknu rajamundry

Uploaded by

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

Aknu-Data Structures and Algorithms - 093633

syllabus foe ads aknu rajamundry

Uploaded by

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

DATA STRUCTURES AND ALGORITHMS

Introduction to Data Structures:Information and Meaning, Representation of Multidimensional


arrays, Review of some basic c programs: addition multiplication of matrices, reversing a given
integer number.
Algorithm Analysis:Model, what to Analyze, Running time calculation –A Simple Example,
General Rules, Logarithms in the running time –Binary Search.
UNIT-II
Lists, Stacks & Queues:Abstract Data Types,The List ADT-Simple ArrayImplementation Lists,
Simple Linked Lists, implementation of list, The ADT-Stack Model, Implementation and
Applications of Stacks.The Queue ADT-Queue Model Array Implementation of Queues, Application
of Queues.
Trees:Implementation and traversal of trees, Binary Trees and Binary search trees, Concepts of AVL
Trees, Splay Trees and B-Trees.
UNIT-III
Hashing:Hash Function, Separate Chains,Hash table without Linked List –Linear Probing, Quadratic
Probing, Double hashing, Rehashing, Extendible Hashing
Priority Queues:Model, Simple Implementation, BinaryHeap: Structure Property, Heap-Order
Property, Basic Heap Operations.
UNIT-IV
Sorting:Insertion Sort,Bubble Sort, Selection Sort, Shell Sort, Heap Sort, Merge Sort, Quick Sort,
Bucket Sort and External Sorting.
Graph:Definition,Topological Sort, Shortest-Path Algorithm-Unweighted Shortest Paths, Dijkstra’s
Algorithm, Graphs with negative Edge costs, Acyclic Graphs, Shortest Path Examples, Network
Flow Problem, Minimum Spanning Tree: Prim’sAlgorithm, Kruskal’s Algorithm.
TEXT BOOK:
Data Structures & Algorithm Analysis in C++ , Mark AllenWeiss. Second edition, Pearson Edition.
Asia.
REFERENCE BOOKS:
1. Data Structures & Algorithm in C++, Adam Drozdek. Vikas publication House.
2. Data Structures, Algorithms and Applications in C++,SartajSahni,McGraw-Hill.
3. Data Structures Using C by Yddishlangsam, Moshe J. Augenstein and Aaron M, Tanenbaum, PHI
2ndEdition. (Chapter 1 to 8)

DATA STRUCTURES AND ALGORITHMS LAB

1. Perform various operations such as insertion, deletion, display on single linked


lists.
2. Implement
(i) Stacks using linked list. (ii) Queues using linked list.
3. Implement different types of searching techniques on a given list
(i) Sequentialsearch (ii) Transpose sequential search (iii) Binary search
(iv) Fibonacci search
4. Demonstrate different types of sortings on a given list
(i) Bubble sort (ii) Insertion sort (iii) Selection sort(iv) Merge sort
5. Different types of sortings on a given list
(i) Quick sort (ii) Shell sort (iii) Radix sort (iv) Topological sort
6. (i) To convert the given infix expression to postfix expression
(ii) To evaluate the given postfix expression.
7. Operations on graphs
(i) Vertex insertion.
ii) Vertex deletion.
iii) Edge insertion.
(iv)Edge deletion.
(v) BFS.
(vi) DFS.

8. Implement dictionaries using hashing technique


9. Perform various operations on binary heap.
10. Perform various operations on Binary search tree.
11. Perform operations on AVL trees.
12. Perform various operations on B-tree.

You might also like