Sparse matrix,
Index generation.
The manipulation of Arithmetic expression,
Symbol Table construction,
Syntax analysis.
(d) Deletion.
Using insertion we can perform insertion sort, using selection we can
perform selection sort, using exchange we can perform the bubble sort
(and other similar sorting methods). But no sorting method can be done
just using deletion.
Prefix Notation:
^ – * +ABC – DE + FG Postfix Notation:
AB + C * DE – - FG + ^
Polish and Reverse Polish notations.
Stack. Because of its LIFO (Last In First Out) property it remembers
its ‘caller’ so knows whom to return when the function has to return.
Recursion makes use of system stack for storing the return addresses
of the function calls.
Every recursive function has its equivalent iterative (non-recursive)
function. Even when such equivalent iterative procedures are written,
explicit stack is to be used.
Two. One queue is used for actual storing of data and another for
storing priorities.
The heterogeneous linked list contains different data types in its
nodes and we need a link, pointer to connect them. It is not possible
to use ordinary pointers for this. So we go for void pointer. Void
pointer is capable of storing pointer to any type as it is a generic
pointer type.
RDBMS – Array (i.e. Array of structures)
Network data model – Graph
Hierarchical data model – Trees
What is the type of the algorithm used in solving the 8 Queens
Backtracking