Professional Documents
Culture Documents
--------------222222----------
Stack.
Basic operations in Queue.
Applications of Stack.
Define Queue.
Advantages of Circular Queue?
Different types of expressions.
Priority Queue.
Overflow condition in Stack?
Doubly Ended Queue.
TWO types of Priority Queue?
=================
STACK operations.
Working of Circular Queue.
Algorithm to convert Infix expression to Postfix expression.
Working of basic operations in Queue.
Stack operations with algorithms.
Operations in Doubly Ended Queue with an example.
Queue operations program.
Representation of Stack with respect to array.
Postfix evaluation algorithm and example.
Queue representation using array.
------------33333333333333-------------
Linked List.
Dynamic memory allocation?
Node in a single linked list.
Static Memory Allocation.
TWO types of Linked Lists?
TWO applications of Linked lists.
Circular Linked List.
Operations in a linked list.
Header Node.
TWO memory management operators.
=================================
------------444444444444444--------------
Tree in Data Structures.
Leaf Node
Level of a Tree.
Binary Tree
Properties of a Binary tree.
Full Binary Tree
Expression Tree.
Complete Binary Tree
Binary Tree Traversals.
Binary Search Tree.
=================================
------------5555555555555555-------
Graph.
Spanning Tree.
Simple Graph.
TWO types of Graph Traversals.
use of Prim's algorithm
Graph Traversal?
Difference between a Tree and a Graph
Degree of a Vertex.
TWO kinds of General graphs.
Simple Path
=====================================
Graph representations
Copying a linked list.
DFS working with an example.
BFS working with an example.
Prim's algorithm and example.
Kruskal's algorithm and example.
Depth First Traversal algorithm and example.
Breadth First Traversal algorithm and example.