Question

(C++)Create a class node with private member data of int id (0 to 10) and char ctype (A to Z), generate random nodes and place them into a list. Sort the list according to id and display them, then move them from the list to a priority queue (basing on the ctype) and then display the contents of the queue.

Answer 1

You may only answer 3 questions out of the following options. Please zip all files together for submission.

1. Create a class Node that has three private member data; int val, int freq, int dest. Create a map of nodes, randomly create nodes with random val and dest (between 1 and 20) and freq 1. Add these random nodes to the map, if a node is generated that is already in the map, increase the freq by one. Allow the user to input N, the number of nodes to be created, after all have been created display the contents of the map and their frequencies.

2. Create a class Leaf, each leaf has private data of an int id. Create a list of queues of Leaf objects.

Ask the user how many Leaf objects they want, generate the Leaf objects randomly with id being from a normal distribution with a mean of 50, standard deviation of 10. All objects with 0<=id<10 should be in their own queue, 10<=id<<20 in their queue, 20<=id<30 etc. After all Leaf objects have been generated, sort the queues, make sure they have unique entries (no id appears more than once) then display the contents of the list of queues.

3. Create a class node with private member data of int id (0 to 10) and char ctype (A to Z), generate random nodes and place them into a list. Sort the list according to id and display them, then move them from the list to a priority queue (basing on the ctype) and then display the contents of the queue.

4. Create a stl list (of integers). Provide a menu to access the basic functions of a list,

a. push_front,

b. push_back,

c. insert(iterator),

d. pop_front,

e. pop_back,

f. erase(iterator),

g. display contents.

All list functions should work and will be tested.

HOWEVER, provide in the menu the option to mimic the behavior of a stack.

h. Convert to stack behavior

If that option is selected you must implement all stack functionality, and prohibit functions that are not supposed to work, you are NOT to use a stack, you are to still you a list but when an illegal option is selected, an error message should appear. Once again, all data will be still in the list, but your interface will make it behave as a stack.

5. Create a Node class that has two integer PMD, int id and int wt, Ask the user how many nodes are desired then generate random Nodes and load them into a binary tree of these nodes based on their id values. ids are random (1 to 100) and wts are random (1 to 10). Beginning at the root, perform a dijkstra’s algorithm analysis to determine the cost to reach each and every node in the tree if you begin at the root of the binary tree.