Name: Reg. No: ___
Midd Term Exam of Data Structures Spring 2012 Page 1 of 2
CS2143-2144 Data Structures Time 90 Minutes
Max. Marks 50
Note: Carefully understand the questions and give to the point answers. Write neat and
clear so that one can understand. Do not split the code to more than one page. Write all
the assumption, if you have made, before writing the code.
1. [10] For the following graph class, implement the function, void DFS (int v), to print all the
vertices of the graph in depth first traversal order starting from vertex v. Assume that all the
other methods given in the class have been implemented.
2. [10] For the following binary tree class (not a BST), implement the functions / methods
given in the class.
3. [10] For the following binary search class, implement the insert and search methods.
class graphWithArrays
{
protected:
int **G;
unsigned int size;
int *visit;
public:
graphWithArrays(unsigned int x);
void storeGraph();
void printGraph();
void DFS (int v);
};
class btree
{ protected:
int *p; // array of values
int *f; // array of flag
unsigned int size;
public:
btree(unsigned int s)
{ int i;
p = new int [s];
f = new int [s];
size = s;
for (i=0; i<s; ++i)
f[i] = 0;
}
int Find(int v); // Find value element v node in the binary tree. if found
//return the index of the location where it is found. Otherwise, return -1
int findCousine(int v) // find index of the cousin of the node with index v (whose
//grandparent is same
PostOrderVisit (int v) // A function to visit the tree in post order, starting from
//node with index v,
};
Docsity.com Docsity.com
