1. Apply Kruskal’s and Prim’s algorithm for the following graph.

Find the minimum cost at

each sace.

Edge Weight

3–2 16
4–3 12
5–4 22
6–5 25
1–6 10
8–7 14

What is the meaning of Lower Bound Theory and how it can be used in solving Algebraic
Problems.

The lower bound theory is the method that has been utilized to establish the given
algorithm in the most efficient way which is possible. This is done by discovering a
function g (n) that is a lower bound on the time that any algorithm must take to
solve the given problem.

What are B-Trees? What is the height of B-Tree of order m?

The B-Trees are specialized m-way search tree. This can be widely used for disc access. A
B-tree of order m, can have maximum m-1 keys and m children. This can store large number of
elements in a single node. So the height is relatively small. This is one great advantage of B-
Trees.

A B-Tree of order m can have at most m-1 keys and m children. One of the main reason of
using B tree is its capability to store large number of keys in a single node and large key values
by keeping the height of the tree relatively small. A B tree of order m contains all the
properties of an M way tree.

Explain tree traversal techniques.

It is a technique similar to graph traversal. In this process, each node is visited in a tree data
structure. It consists of two techniques for traversing:
1. Depth First Traversal
a. In-order
b. Pre-order
c. Post-order
2. Breadth First Traversal