B)(5 points) Consider the binary tree representing the following arithmetic expression (sign $ stands for exponentiation...
Please address all the questions on the photo. 5. Consider the following binary tree: A B C E F e De G H. K . M NO RO P Q T a. What is the height of the tree? b. What is the height of vertex H? c. Write the preorder traversal representation of the tree. d. Write the array representation of the tree by completing the following table: Right Child Left Child Vertex A C D G H K...
1 Binary Search Trees (25 points) Consider the binary tree as shown in Figure 1. 9 5 15 10 17 8 Figure 1: Binary Tree: The letter next to each node (e.g., a, b) denotes the tree node, and the number inside each node is the key. 1.1 Correctness (10 points) Is this binary tree a valid binary search tree? In other words, does it satisfy the binary search tree property? If not, which node(s) violates the binary search tree...
acer Question Three Design a circuit with t wo inputs x & y representing the bits in a binary number and outputs a& b also representing bits in a binary number. When t output is reversed. When the input is 1 and 3, the output s O and 2, the Any carry forward is discarded a) Show your truth table b) Find and simplify the Boolean expression for the o utputs a & b. c) Draw one logic circuit to...
) Draw a red-black tree for the following values inserted in this order. Illustrate each operation that occurs: y t p r k w o s 10 points 2) Draw a red-black tree for the following values inserted in this order. Illustrate each operation that occurs: 13 55 52 26 50 87 30 20 11 28 16
7 Consider the following algebraic exp expressicon x+3)2-4 (a) Construct a binary tree that represents that expression. (b) Write the expression in Reverse Polish (postfix) notation. 8. A game consists of two players taking turns removing 1, 2, or 3 stones fro stones and the player that removes the last stone loses. Construct the game tree of this game and decide which player has a winning strategy m a pile of r
6. Convert .3710 to a binary fraction of 10 binary digits. 7. Use two's compliment arithmetic to perform the following 8 bit binary operations. a. 0010 1110 + 0001 1011 b. 0101 1101 – 0011 1010 c. 1011 1000 – 1000 1011 d. 1000 1100 – 1111 0111 8. Convert 150.8476562510 to IEEE Floating Point Standard. 9. Simplify the following Boolean expressions. a. xy + xy + xz b. (w + x)(x + y)(w + x + y + z)...
write the c++ code. The records are insSerted Hl 6. A B tree: You are given a series of records whose keys are letters. the following order: C,S,D,T.A,M,PI,B,W,N,G,U,R,K,E,H. Show the B+ tree of order 4 that results from inserting these records. Assume that the leaf nodes are capable of storing up to 3 records. The records are insSerted Hl 6. A B tree: You are given a series of records whose keys are letters. the following order: C,S,D,T.A,M,PI,B,W,N,G,U,R,K,E,H. Show the...
6. The following expression is for an FM signal for transmitting the message signal m(t) rt) across a channel with additive white Gaussian noise that has a power spectral density of n/2 5 x 1 0-6 W/Hz r(t) 7cos [10 t (a) (5 points) Calculate the output SNR (in dB) of the FM system. 6sin (4000Tt) (b) (5 points) The message signal can instead be transmitted using the Frequency- Shift Keying (FSK) digital system that consist of equally-likely pulses si(t)...
4. 5. 6. 7. 8 Find the 15th term of the arithmetic sequence whose common difference is d=9 and whose first term is a, = 2. 8 Х 5 ? 3 4 5 6 For a given arithmetic sequence, the 89th term, agg, is equal to – 233, and the 9th term, do, is equal to 7. Find the value of the 33' term, 233- 0 433 X ? Check 2020 Merwe 2 # 3 $ 4 % 5 8...
Data structures Exercises: For the following binary tree (Index-Value): 0 1 2 3 4 5 6 7 8 9 A C E G B P D X F H Give the pre-order traversal. Give the post-order traversal. Give the in-order traversal. Determine the height of the tree. Using these values: 8 6 4 3 5 9 2 1 6 Build a binary search tree. Build an AVL Tree. Build a 2-3 Tree. Build a min-heap. Build a max-heap. Apply a...