Sub: Data Structure and Algorithms: 1. Revisiting Java Programming Construct
Sub: Data Structure and Algorithms: 1. Revisiting Java Programming Construct
CLASS S.E.(INFORMATION TECHNOLOGY) SEMESTER III Hours per Lectures : 04 Week Tutorial : -Practical : 02 Hours Marks Evaluation Theory 3 100 System : Practical 3 50 Oral - -Term work - 25
5. Trees
The tree Abstract Data Type, basic Algorithms on Tree, binary Tree, data Structures for representing Tree
6. Priority queues
The priority queues Abstract data Type, Implementing a Priority queues with a List, Heaps, Adaptable priority queues
8. Search Trees
Binary Search Trees, AVL Trees, Splay Trees, (2,4) Trees, Red-Black Trees, External searching in B-Trees
11. Graphs
The graph Abstract Data Type, Data Structures for Graphs, Graph Traversals
Directed Graphs, Weighted Graphs, Shortest Paths, Minimum spanning Trees Text Book 1. Micheal Goodrict, Roberto Tamassia,(2007) Data Structure and Algorithm in Java 3 RD Edition Wiley India 2. Langsam Data Structutre using JAVA, Pearson Education 3. Jhon R.HubbardSchaums outline of data structures with JAVA McGraw Hill 4. Hubbard, Data Structure with JAVA, Pearson Education Reference book Adam Drozdek (2001) Data Structures and Algorithms in JAVA, 1 ST Edition, Singapore: Thomson Asia Pte Ltd (ISBN 0534-37668-1) Nell Dta, Daniel T. Joyce, Chip Weems (2004) Object Oriented Dta Structures Using JAVA, 1 ST Edition, New Delhi: Narosa Publising House Kunth, Donald E.(1973). The Art of Computer Programming, Volume 1/Fundamental Algoritn=ms, 3 RD Edition, Addison-Wesley.