The document outlines the syllabus for a course on Data Structures and Algorithms. It covers 5 units: introduction to data structures like arrays, stacks, queues and linked lists; linked lists, trees and graphs; analysis of algorithms and asymptotic notations; divide and conquer and greedy algorithms; and input/output file management and reflection API in Java. The final unit discusses streams, reading/writing characters and bytes, random access files, and class/interface/method identification in reflection API.

1. Dr.Babasaheb Ambedkar Marathwada University,
Aurangabad
Advances in Data Structure & Algorithms
Dr.Kaveri Lad
Assistant Professor(MCA)
Department of Management Science
Dr.Babsaheb Ambedkar Marathwada University,
Auranagabad
Introduction to Data Structure

2. Unit-V
Managing Input / Output Files in JAVA : streams, streams classes, Byte streams classes , reading and writing characters , bytes, Random Access Files
, Interactive I/p and o/p,
Reflection API- class identification, interface identification, parent class information and methods information.
Unit- I : Introduction To Data Structure
• Array, Polynomial Operations using An Array
• Data Structure Definition and Its Types
• Sparse Matrix & Its applications with implementations
• Stack - Definition , Applications and Implementations
• Queue -Definition , Applications and Implementations
Syllabus

3. Unit-V
Managing Input / Output Files in JAVA : streams, streams classes, Byte streams classes , reading and writing characters , bytes, Random Access Files
, Interactive I/p and o/p,
Reflection API- class identification, interface identification, parent class information and methods information.
Unit- II : Linked List
• Definition
• Representation of Linked List
• Types of Linked List
• Implementations of Linked List
• Queue -Definition , Applications and Implementations
• Tree – Definition , types applications , traversing methods
Syllabus

4. Unit-V
Managing Input / Output Files in JAVA : streams, streams classes, Byte streams classes , reading and writing characters , bytes, Random Access Files
, Interactive I/p and o/p,
Reflection API- class identification, interface identification, parent class information and methods information.
Unit- III : Graph
• Definition
• Types of Graph
• Representation of Graph
• Traversing Methods
• Searching and Sorting Algorithms and Implementations
Syllabus

5. Unit-V
Managing Input / Output Files in JAVA : streams, streams classes, Byte streams classes , reading and writing characters , bytes, Random Access Files
, Interactive I/p and o/p,
Reflection API- class identification, interface identification, parent class information and methods information.
Unit- IV : Data Analysis and Algorithms
• Concepts
• Running Time Analysis
• Asymptotic Notations
• Divide and Conquer Algorithms & Implementations
Syllabus

6. Unit-V
Managing Input / Output Files in JAVA : streams, streams classes, Byte streams classes , reading and writing characters , bytes, Random Access Files
, Interactive I/p and o/p,
Reflection API- class identification, interface identification, parent class information and methods information.
Unit- V : Greedy Algorithms and Dynamic Programming
• Concepts
• Greedy Choice, optimal substructure property
• minimum spanning trees -- Prims and Kruskals,
• Knapsack Problem
• Dynamic Programming: Multistage Graph, 0/1 Knapsack Problem
• Networks: Ford Fulkerson Max Flow Algorithm& Implementations
Syllabus