You are a new student at Valencia College and just found out who your roommate is. Send an email introducing yourself to your new roommate. Tell them about yourself, your family, things you do for fun, and your schedule at Valencia College. Use at least 10 different verbs. 3 paragraphs minimum. Please only use GUSTAR no more than 3 times. First paragraph about yourself-name, describe, where you are from, your age, likes, class schedule, pastimes, work, exercise/sports, etc Second paragraph about your family –name, describe, how many people are there in your family, where you are from, your age, likes, pastimes, work, etc Third paragraph about the things you and your family do for fun.- -where, describe the place, things you can do there, and say goodbye, etc. Use of grammar/vocabulary not from lessons will result in 0 points for this section.  Remember this does not have to be factual. Do not use past tense or future tense.  For accents marks. To copy paste accent marks and question/exclamations marks, use your Ctrl C to copy and Ctrl V to paste. á      é       í       ó      ú     É     ñ      ¿      ¡    

During the Christmas season, people tend to draw money out of their checking accounts to pay for presents. As a result, the actual money multiplier will

[contracts] In a(n) ________, an individual or firm contracts with a parent company to set up a business or retail outlet.

[Red ] The ________ for the American Red Cross is “to prevent and alleviate human suffering in the face of emergencies by mobilizing the power of volunteers and the generosity of donors.”

[interactive] From an interactive marketing perspective, ________ is defined as the sum total of the interactions a customer has with a company’s website from the initial look at a home page through the entire purchase decision process.

An attacker has access to the Plain RSA signatures of messages . Show how the attacker can efficiently find the Plain RSA signature for . Note: They already have knowledge of the public key .

This question is concerned with hashing with open addressing where the (linear) probing sequence is defined by h'(k) = k mod 10 and h(k, i) = (h'(k) + i) mod 10. Assume that the content of the hash table T is as follows: T(0) = 49 T(1) = 1 T(2) = NIL T(3) = NIL T(4) = DELETED T(5) = 25 T(6) = DELETED T(7) = 36 T(8) = 64 T(9) = 9 Note that I have used parentheses (rather than brackets) due to the Canvas Syntax.   (a) The first cell (index to the table) probed by Hash-Search(T, 64) is [a]   (b) The last cell (index to the table) probed by Hash-Search(T, 64) is [b]   (c) The first cell (index to the table) probed by Hash-Insert(T, 29) is [c]   (d) The last cell (index to the table) probed by Hash-Insert(T, 29) is [d]   (e) The last cell (index to the table) probed by Hash-Delete(T, 96) is [e]

Given an unsorted array A of n distinct integers and an integer k, you need to return the k smallest integers in the array in sorted order, where k may be any integer between 1 and n. Suppose that you have the following three algorithms to solve this problem. A1: Sort the array in increasing order, then list the first k integers after sorting. A2: Build a min-heap from these n integers, then call Extract-Min k times. A3: Use the linear time selection algorithm to find the k-th smallest integer in the array, then partition the array about that number to obtain the k smallest numbers in the array, and finally sort the k smallest numbers. Assume that you are using mergesort as your sorting algorithm, and use the linear time build-heap algorithm to build the heap. Let T1(n, k) denote the worst-case running time of Algorithm A1. Let T2(n, k) denote the worst-case running time of Algorithm A2. Let T3(n, k) denote the worst-case running time of Algorithm A3. Analyze the worst-case running times of the algorithms. What is the asymptotic notation for T2(n, k)? Use the most accurate big-O notation in your answer. Note that k is between 1 and n. Hence k is nominated by n.

Write a brief justification to your answer to Q1-c1.

The following figure shows red-black tree (RBT) in which a square denotes a black node, a circle denotes a red node, and the NIL nodes are omitted. The number inside a circle/square is the key value of the corresponding node. The label (upper-case letter) next to a node is a pointer pointing to the memory location of the corresponding node. You should use the label when referring to a node.   (a) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree. After BST insertion (before RBT insertion fixup), the parent of O is [a]   (b) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree. After BST insertion (before RBT insertion fixup), is O the left child of its parent or the right child of its parent? Write LEFT or RIGHT. [b]   (c) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree. After BST insertion (before RBT insertion fixup), which property of the RBT is violated? Select 0 if none of the properties is violated. [c]   (d) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree. Then we perform insertion fixup if necessary. In the resulting RBT, what is the parent of node E? [d]   (e) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree. Then we perform insertion fixup if necessary. In the resulting RBT, what is the color of node J? [e]   (f) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree. Then we perform insertion fixup if necessary. In the resulting RBT, what is the left child of node O? [f]   (g) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree. Then we perform insertion fixup if necessary. In the resulting RBT, what is the right child of node O? [g]     (h) Suppose that we want to delete node M (with key=60) from the RBT  in the figure. In the resulting RBT, what is the right child of node A? [h]   (i) Suppose that we want to delete node M (with key=60) from the RBT  in the figure. In the resulting RBT, what is the color of node M? Write either BLACK or RED. [i]   (j) Suppose that we want to delete node M (with key=60) from the RBT  in the figure. In the resulting RBT, what is the left child of node M? [j]   (k) Suppose that we want to delete node M (with key=60) from the RBT  in the figure. In the resulting RBT, what is the right child of node M? [k]   (l) Suppose that we want to delete node M (with key=60) from the RBT  in the figure. In the resulting RBT, what is the color of node F? Write either BLACK or RED. [l]   (m) Suppose that we want to delete node M (with key=60) from the RBT  in the figure. In the resulting RBT, what is the color of node N? Write either BLACK or RED. [m]   (n) Suppose that we want to delete node M (with key=60) from the RBT  in the figure. In the resulting RBT, what is the color of node G? Write either BLACK or RED. [n]