- The fundamental design, analysis, and implementation of basic data structures.
- Basic concepts in the specification and analysis of programs.
- Principles for good program design, especially the uses of data abstraction.
- Sample Problems on Data structures:
- Write Java programs that use both recursive and non-recursive functions for implementing the following searching methods:
- Linear search
- Binary search
- Write Java programs to implement the following using arrays and linked lists
- List ADT
- Write Java programs to implement the following using an array.
- Stack ADT
- Queue ADT
- Write a Java program that reads an infix expression and converts the expression to postfix form. (Use stack ADT).
- Write a Java program to implement circular queue ADT using an array.
- Write a Java program that uses both a stack and a queue to test whether the given string is a palindrome or not.
- Write Java programs to implement the following using a singly linked list.
- Stack ADT
- Queue ADT
- Write Java programs to implement the deque (double ended queue) ADT using
- Array
- Singly linked list
- Doubly linked list.
- Write a Java program to implement priority queue ADT.
- Write a Java program to perform the following operations:
- Construct a binary search tree of elements.
- Search for a key element in the above binary search tree.
- Delete an element from the above binary search tree.
- Write a Java program to implement all the functions of a dictionary (ADT) using Hashing.
- Write a Java program to implement Dijkstra’s algorithm for Single source shortest path problem.
- Write Java programs that use recursive and non-recursive functions to traverse the given binary tree in
- Preorder
- Inorder
- Postorder.
- Write Java programs for the implementation of bfs and dfs for a given graph.
- Write Java programs for implementing the following sorting methods:
- Bubble sort
- Merge sort
- Binary tree sort
- Insertion sort
- Heap sort
- Quick sort
- Radix sort
- Write a Java program to perform the following operations:
- Insertion into a B-tree
- Searching in a B-tree
- Write a Java program that implements Kruskal’s algorithm to generate minimum cost spanning tree.
- Write a Java program that implements KMP algorithm for pattern matching.
- Data Structures and Algorithms in java, 3rd edition, A.Drozdek, Cengage Learning.
- Data Structures with Java, J.R.Hubbard, 2nd edition, Schaum’s Outlines, TMH.
- Data Structures and algorithms in Java, 2nd Edition, R.Lafore, Pearson Education.
- Data Structures using Java, D.S.Malik and P.S. Nair, Cengage Learning.
- Data structures, Algorithms and Applications in java, 2nd Edition, S.Sahani, Universities Press.
- Design and Analysis of Algorithms, P. H. Dave and H.B.Dave, Pearson education.
- Data Structures and java collections frame work, W. J. Collins, Mc Graw Hill.
- Java: the complete reference, 7th edition, Herbert Schildt, TMH.
- Java for Programmers, P. J. Deitel and H. M. Deitel, Pearson education / Java: How to Program P. J. Deitel and H. M. Deitel , 8th edition, PHI.
- Java Programming, D.S. Malik, Cengage Learning.
- A Practical Guide to Data Structures and Algorithms using Java, S. Goldman & K. Goldman, Chapman & Hall/CRC, Taylor & Francis Group. (Note: Use packages like java.io, java.util, etc)
Download iStudy App (Android & iOS)
Get instant JNTUH updates, timetables, results, and notices on mobile.