3. Graph traversal can be either depth first traversal or breadth first traversal. Pleasewrite pseudo code, without using recursion, for (a) depth first traversal (10%), and(b) breadth first traversal (10%).

6. A simplest known sorting method called “counting sort” is described as follows.Declare an array count and set count[k] to the number of key values that are lessthan k. Therefore, the record with key k can be placed in position count[k] of anoutput list. (You should beware of the possibility of equal key values. See anexample in Figure 1.) Assume that all keys of the records are integers and theirvalues are in range of [0, d], where d is a constant. Write an algorithm to sort a setof records with size n by the key value using this method (including how todetermine the count[k]). (15%)

3. Graph traversal can be either depth first traversal or breadth first traversal. Please
write pseudo code, without using recursion, for (a) depth first traversal (10%), and
(b) breadth first traversal (10%).

相關申論題

相關試卷