Reference no: EM13338936

I. Say whether the following statements are true or false.

1) Definiteness is one of the properties of an algorithm.

2) Graph is a linear data structure.

3) A tree is a connected graph.

4) The data structure used by recursion is stack.

5) Queue works on the strategy "First in First out".

II. Using suitable word or phrase fill up the blanks in the following sentences:

1) _____________is the process of executing a correct program on data sets and measuring the time and space.

2) Tree is a_____________data structure.

3) For a graph with 'n' number of nodes the number of edges to form a tree is _____________

4) "Last in First out" Data structure is referred to as _____________

5) A binary tree of depth 'K' has maximum of_____________number of nodes.

6) A _____________is a graph without self loop and parallel edges.

7) The two methods of searching are_____________and_____________

III. Write brief answers to the following questions:

1) Define algorithm. What are its properties?

2) Give atleast four real life examples where we use stack operations.

3) Differentiate full and complete binary trees.

4) What are the demerits of recursion?