Q1. What do you mean by linked representation of a graph? Describe with the help of an illustration. As well prepare its merits over other representations of graph.
Q2. Define the term connected graph. For a connected graph of n vertices, determine the number of minimum and how many maximum edges must be in the graph? Prove it.
Q3. prepare down the Kruskal algorithm to determine a minimum spanning tree of a Graph.
Q4. What do you mean by Garbage? prepare merits of best-fit and worst-fit memory allocation techniques.
Q5. prepare down an algorithm which reverses a given string of length n.
Q6. prepare down an algorithm which adds up two polynomials of degree n and m.
Q7. In a circular queue illustrate the conditions that distinguish between empty queue and full queue. As well describe the demerits of implementing queue (non-circular) by using array.
Q8. Make a binary tree for the given pre-order and in-order traversal sequences.