What is Stack Explain with Example Node Structure of Stack

Different Operation of stack using Array

Different Operation of stack using Linked list
PUSH an element in a stack using Array
PUSH an element in a stack using Linked List
POP an element in a stack using Array
POP an element in a stack using Linked List
Display an element in a stack using Array
Display an element in a stack using Linked List
Peep an element in a stack using Array
Peep an element in a stack using Linked List
Explain Time complexity of Stack using Array
Explain Time complexity of Stack using Linked List
Explain Stack Application of reversing a list
Explain Conversion of an infix expression into a postfix expression with algorithm
and C code
Explain Evaluation of a postfix expression with algorithm and C code

Explain Conversion of an infix expression into a postfix expression with algorithm

and C code
Explain Evaluation of a prefix expression with algorithm and C code
-----------------------------------------------------------------------------------
-----------------------------------------------------------------------------------
---------------------
What is Queue? Explain with Example Node Structure of Queue
"Explain different operation of queue Using Array
Enqueue: To insert an element to the rear of a queue
Dequeue: To delete an element from the front of a queue
Queue empty: To check whether queue is empty
Queue full: To check whether queue is full
Get front: To get first element from the front of a queue
Get rear: To get last element from the rear of a queue
Explain TIme complexity Of Queue using Array"
"Explain different operation of queue Using Linked List
Enqueue: To insert an element to the rear of a queue
Dequeue: To delete an element from the front of a queue
Queue empty: To check whether queue is empty
Queue full: To check whether queue is full
Get front: To get first element from the front of a queue
Get rear: To get last element from the rear of a queue
Explain TIme complexity Of Queue using Linked List"
"Circular Queue
Enqueue
Dequeue
Queue empty
Queue full
Get front
Get rear"
"Double ended queue
Enqueue at front and rear
Dequeueat front and rear
Queue empty
Queue full
Get front
Get rear"
"Priority Queue
Enqueue
Dequeue
Queue empty
Queue full
Get front
Get rear"
Explain application of Queue in Ticket Booking Counter write algorithm for same
-----------------------------------------------------------------------------------
-----------------------------------------------------------------------------------
---------------------
What is Linked List ? Explain with Example Node Structure of LL

Singly Linked List

Doubly Linked List
Circular Linked List
Example
Node Structure
Traversal
insertion of a node at the beginning
Insertion of a node in a middle
Insertion of a node at the end
Delete the first node
Delete node from middle
Delete the last node
reverse a linked list
Update an element
Find Front Element
Find Rear Element
-----------------------------------------------------------------------------------
-----------------------------------------------------------------------------------
---------------------
Differentiate Stack and Queue
Differentiate Linear and Non linear Data structure
Differentiate Array and Linked list
-----------------------------------------------------------------------------------
-----------------------------------------------------------------------------------
---------------------
"Which Data structure is used to ADD two polynomial
Explain with Example and write C function for same"
"Which Data structure is used to Subtract two polynomial
Explain with Example and write C function for same"
"Which Data structure is used to Multiply two polynomial
Explain with Example and write C function for same"
-----------------------------------------------------------------------------------
-----------------------------------------------------------------------------------
---------------------
Which Data structure is used in round robin Scheduling Explain with example and
Write C Code
-----------------------------------------------------------------------------------
-----------------------------------------------------------------------------------
---------------------
"Explain Tree with Example
Define terminology used in Tree with Example"
Explain Binary Tree Representation Using Linked List with Example

Explain Binary Tree Representation Using Array with Example

Explain Binary tree traversal ( Inorder ,Pre order, Post Order) with Example

Construct Binary Tree Given Inorder and Pre order ( Example with all Steps)

Construct Binary Tree Given Inorder and Post order ( Example with all Steps)
Applications Of Tree
Explain Threaded Binary tree . Finding in-order successor and predecessor of a node
in threaded tree. Explain Insertion and deletion in threaded binary
tree.
"Significance of Binary search tree: Different operation Operation
Insert an element
Delete an element
Search an element
Traversal in BST"
"Give Significance of AVL Tree . Write Algorithm and Code for following operation
Searching and traversing in AVL trees.
Insertion and Deletion in an AVL Tree."
Rotation in AVL tree
Explain Huffman Tree Which Data structure is used
Explain Heap Sort.Which Data structure is used
Differentiate BFS and DFS
Explain BFS and DFS with Example
-----------------------------------------------------------------------------------
-----------------------------------------------------------------------------------
---------------------
What is Graph. Give types of Graph .Graph terminology with diagram

How Graphs are represented.

Define adjacency list directed graph and path matrix construct the same for an
Example
Define adjacency matrix construct the same for an Example
Define Transitive closure of a directed graph construct the same for an Example

Define path matrix construct the same for an Example

Write a C Program and algorithm for Sequential Search with Example

Write a C Program and algorithm for Binary Search with Example

Explain different hash functions with Example

Explain steps in Linear Probing with Example
Explain steps in QuadraticProbing with Example
Comparisons Between Different Searching Algorithms
Write a short note on Radix Sort
Write a short note on Insertion sort, Selection sort, Merge sort, Quick sort
Comparisons Between Different Sorting techniques.
Write a C Program and algorithm for Dijkstra’s Algorithm and explain working with
example Write a C Program and algorithm for Prim’s Algorithm
and explain working with example
Write a C Program and algorithm for Kruskal’s Algorithm and explain working with
example
Differentiate Kruskal’s Algorithm and Prim's Algorithm.
Define Spanning Tree. What is the significance of spanning trees? Explain technique
to find minimum Spanning tree.
Draw a Spanning tree for a graph with four vertices.
Real-world applications of Stack
Real-world applications of Linked List
Real-world applications of Queue
Real-world applications of Tree
Real-world applications of graph
Case studies highlighting the importance of efficient algorithms in software
development and systems engineering Justify which Data structure is best suited in
terms of properties and performance for Printer Job
Justify which Data structure is best suited in terms of properties and performance
for Browser history management system . write a code for UNDO and REDO