TITLE: Implementation of Singly Linked list

1. How to insert the new node in Singly Link List?

2. How to delete the node from front of Singly Link List ?

3. How to delete the node from end of Singly Link List ?

4. How to delete the node in between of Singly Link List ?

TITLE: Implementation of Doubly Linked list

1. How to insert the new node in Doubly Link List?

2. How to delete the node from front of Doubly Link List ?

3. How to delete the node from end of Doubly Link List ?

4. How to delete the node in between of Doubly Link List ?

TITLE: Implementation of Circular Linked list

1. How to insert the new node in Circular Link List?

2. How to delete the node from Circular Link List ?

3. What is use of the Circular Link List?

4. How to perform multiplication of two polynomials?

5. How to perform Addition of the two polynomials?

TITLE: Implementation of Circular queue and Double ended queue

1. How to insert the new node in Circular queue & double ended queue?

2. How to delete the node from the front end of the Circular queue & double ended
queue ?

3. What is difference between Circular queue & double ended queue?

4. How to search the element in circular queue & double ended queue?
TITLE: Implementation of Generalized Linked list

1. What is GLL?

2. How to create GLL ?

3. What is use of the GLL?

4. Explain the data structure of the GLL?

TITLE: Implementation of Binary Tree

1. What is the time complexity of binary tree algorithm?

2. What are right and left spin binary trees?

3. What is the concept of threads in trees? How it is helpful?

4. What is height and weight balanced trees?

TITLE: Implementation of Binary Search Tree

1. What is the time complexity of binary search algorithm?

2. What are right and left spin binary trees?

3. What is the concept of threads in trees? How it is helpful?

4. What is height and weight balanced trees?

TITLE: Implementation of Binary tree and find the height of tree and
print it’s leaf nodes. Find it’s mirror image

1. How to create the mirror image of the tree?

2. What is the logic for printing the tree level wise ?

3. What is the advantage of creation of the mirror image?

TITLE: Implementation of Inorder binary Threaded tree and perform
Inorder traversal using the Inorder threads.

1. How to create Threaded BST?

2. What is use of Threaded BST?

3. How to travel Treaded BST?

TITLE: Implementation of Graph and perform DFS and DFS.

1. What is the time complexity of BFS &DFS Graph?

2. How to create BFS?

3. How to create DFS?

4. What is difference between BFS & DFS?

TITLE: Minimum Spanning trees.

1. What is the Prim’s algorithm?

2. What Kruskal’s algorithm?

3. What is the diffrence between Prim’s & Kruskal’s algorithm?

TITLE: Shortest path in Graphs.

1. What is the time complexity of Dijkstra’s Graph?

2. How to find the shortest path by using Dijkstra’s Graph?

3. Why we are learning Dijkstra’s algorithm?

TITLE:C++ Program Using Files and Command Line arguments

1. What is the time complexity of binary search algorithm?

2. What are right and left spin binary trees?

3. What is the concept of threads in trees? How it is helpful?

4 What is height and weight balanced trees?

TITLE: Direct Access file.

1. What is chaining?

2. What are the types of chaining?

3. How to access data directly by using direct access file?

TITLE: Add the binary numbers.

1. What is STL?
2. Why we are using STL?
3. What are the functions used in this program?
4. What is Itrator?
5. What is Container?

TITLE: Implementation of the Deque.

1. What are the deque functions declared in the STL?

2. How to use deque functions?

3. What is the use of these deque functions?

TITLE: Sorting and Searching with user defined records.

1. How to search the records by roll number?

2. How to sort the records by roll number?

TITLE: Hashing.

1. What is Hashing?

2. Why we are using Hasing?

3. What is Linear Probing?