java with ds

II BSC IV SEMESTER - JAVA WITH DATASTRUCTURES 

IMPORTANT QUESTIONS

UNIT-I ( Introduction and Linked List)

1. Explain about different primitive and non-primitive data structures with examples.
2. Explain about different Linear and Non linear data structures with examples.
3. What are spare matrices? Explain them?
4. What is Linked list? Write about all possible operations on single linked list.
5. What is double linked list? Write its advantages over single linked list.
6. What is circular linked list? Write a program to explain the concept of circular linked list.

UNIT-II (Stack and Queue)

1. What is stack? Explain its operations?
2. What is stack? Write a program to implement stack using arrays.
3. What is stack? Write a program to implement stack using inked List.
4. Explain about infix, Prefix and Post fix notations.
   
5. What is Queue? Explain different types of Queues available in data structures.
6. What is Circular Queue? Write algorithms to insert and delete an element from circular Queue.
7. What is Circular Queue? Write a program to explain its operations.
8. What is Deque? What are the different techniques used to represent Deque? Explain.
9. What are priority queues? When they are useful? Write about in detail.
10. What is Queue? Write a program to implement Queue using arrays and linked list.

 UNIT-III (Trees)

1. What is Binary Tee? Explain various representations of binary tree.
2. Write about different tree traveling techniques and also write algorithms for each traveling technique.
3. What is BST? How to its differs from Binary Tree? Write about two possible representations of BST.
4. With an example explain insertion and deletion of elements from BST. Also Write algorithms for same.
5. How to find minimum and maximum elements from a Tree? Write algorithms for same.
6. What is Threaded Binary Tree? Explain.
7. What are Heap Tree? Explain Heap sort with example.
8. Explain different types of Binary Trees with example 

UNIT-IV ( Graphs)

1. What is Graph? Explain various representations of Graphics.
2. Write about various Graph Traveling Techniques.
3. How to find a Node in a Graph? Write about basic searching techniques with programs.
4. What are the various ways to find Minimal Spanning Tree? Explain.
5. Explain DFS with example?
6. Explain Topological sort with example.

UNIT-V ( Searching and Sorting)

1. What is Searching? Explain Linear search algorithm with example.
2. What is Searching? Explain Binary Search Algorithm with example.
3. What is Sorting? Explain different sorting Techniques.
4. Explain Quick sorting Technique with example.
5. Explain selection sorting Technique with example.
6. Explain bubble sorting Technique with example.