Reference no: EM131080805
Part 1: Refer to Figure HW 7for problems 1-5.
![1371_treee.png](https://secure.expertsmind.com/CMSImages/1371_treee.png)
1) List all of the following:
a) Level-2 vertices
b) Leaves
c) Siblings of v6
d) Descendants of v6
2) Is this an n-tree? If so, for what integer n?
3) Explain how many vertices would need to be added to each existing vertex to create a complete 3-tree. For example, writing "v0: 2" would mean that two vertices need to be added to the existing v0 vertex. Writing "v0: 0" would mean that no vertices need to be added to the existing v0 vertex.
v0: v1: v2: v3:
v4: v5: v6: v7:
v8: v9: v10: v11:
4) Compute the tree T(v3).
![2215_Y.png](https://secure.expertsmind.com/CMSImages/2215_Y.png)
5) Give the height of each tree:
a) (T, v0)
b) T(v3)
Part 2:
1) Construct the tree of the algebraic expression:
((x-2)+3)/((2-(3+y))x(w-8))
Refer to the following Huffman code tree for problems 2 and 3:
![2186_graph.png](https://secure.expertsmind.com/CMSImages/2186_graph.png)
2) Decode the message: 000110000101
3) Find the string that represents the word SEAT.
Part 3:
Here, to visit a node means to print the contents of the node. Refer to the tree that you constructed in section 7.2 homework problem 1 (above) to complete problems 1-3 below.
1) Show the results of performing a preorder search.
2) Show the results of performing an inorder search.
3) Show the results of performing a postorder search.
4) Draw the digraph of the binary positional tree that corresponds to Figure HW 7 from section 7.1 of this homework assignment.Below are images you can use to create the diagraph. You may copy/paste the arrow and alter the directions and length as needed.
![544_root.png](https://secure.expertsmind.com/CMSImages/544_root.png)
Part 4:
Refer to this figure for problems 1 and 2.
![1148_tree.png](https://secure.expertsmind.com/CMSImages/1148_tree.png)
1) Use vertex A as the initial vertex and use Prim's algorithm to find a minimal spanning tree. You do not need to draw the tree, but do list the edges (as an ordered pair) in the order in which they are chosen.
2) Use Kruskal's algorithm to find a minimal spanning tree. You do not need to draw the tree, but do list the edges (as an ordered pair) in the order in which they are chosen.
Discuss user interface characteristics
: Search the Internet to find resources that discuss user interface characteristics that we can expect to see in the future, in terms of:
|
Implementation of security mechanisms
: A security designer is planning the implementation of security mechanisms in a RBAC (Role Based Access Control) compliant system. The designer has determined that there are three types of resources in the system including files, printers, and mail..
|
Find the most general bilinear mapping
: Find the most general bilinear mapping
|
Primary functions of documentation
: What the primary functions of documentation are as contained in "the record" or "the personnel file?" Describe each of the functions, evaluating and explaining the importance of each.
|
Find the string that represents the word seat
: Explain how many vertices would need to be added to each existing vertex to create a complete 3-tree. For example, writing "v0: 2" would mean that two vertices need to be added to the existing v0 vertex. Writing "v0: 0" would mean that no vertices..
|
Type of malicious code
: When the administrator's user ID is deleted, the system suddenly begins deleting files. This is an example of what type of malicious code?
|
Review gary kovac tedtalk called tracking our online tracker
: Review Gary Kovacs' TedTalk called Tracking our online trackers. After reviewing the video and your history of Facebook discuss the following: Who is it good for and how can it be used? Who is it bad for and how can it be abused?
|
Find the image region in the w plane
: find the image region in the w plane
|
System for an internal network
: An administrator wants to set up a system for an internal network that will examine all packets for known attack signatures. What type of system will be set up?
|