B Trees - A) For a sequence of keys {a, j, b, i, c, h, d, g, e, f}, suppose we would like to construct a B-Tree, with degree 2, by successively inserting those keys, one at a time, into an initially empty tree. Please draw the sequence of B-Trees after inserting each of the 10 keys.
Note: please draw only one tree after each insertion.
B) Let t be the (minimal) degree of a BTree. Suppose the size of each object, including the key, stored in the tree is 40 bytes. Also, suppose the size of a BTreeNode pointer is 4 bytes. In addition, 100 bytes of meta-data is required for each BTree node to keep track of some useful information. Suppose each BTreeNode has only the meta- data, a parent pointer, a list of objects, and a list of child pointers. What is the optimal (minimal) degree for this BTree if a disk block is 4096 bytes?
C) For a BTree with height 4 (or 5 levels), what is the maximal number of objects can be stored if the (minimal) degree t = 51?

Which of the following is a true statement about milestones

Some of your friends have gotten into the burgeoning field of time-series data mining, in which one looks for patterns in sequences of events that occur over time. purchases at stock exchanges--what’s being bought-- are one source of data with a natural ordering in time. given a long sequence s of such events, your friends want an efficient way to detect certain "patterns" in them--for example, they may want to know if the four events buy yahoo, buy ebay, buy yahoo, buy oracle occur in this sequence s, in order but not necessarily consecutively. they begin with a collection of possible events (e.g., the possible’ transactions) and a sequence s of n of these events. a given event may occur multiple times in s (e.g., yahoo stock may be bought many times in a single sequence s). we will say that a sequence s’ is a subsequence of s if there is a way to delete certain of the events from s so that the remaining events, in order, are equal to the sequence s’. so, for example, the sequence of four events above is a subsequence of the sequence buy amazon, buy yahoo, buy ebay, buy yahoo, buy yahoo, buy oracle their goal is to be able to dream up short sequences and quickly detect whether they are subsequences of s. so this is the problem they pose to you: give an algorithm that takes two sequences of even~s--s’ of length m and s of length n, each possibly containing an event more than once--and decides in time o(m n) whether s’ is a subsequence of s

Write a program that defines symbolic names for several string literals (chars between quotes). * use each symbolic name in a variable definition. * use of symbolic to compose the assembly code instruction set can perform vara = (vara - varb) + (varc - vard); ensure that variable is in unsigned integer data type. * you should also further enhance your symbolic logic block to to perform expression by introducing addition substitution rule. vara = (vara+varb) - (varc+vard). required: debug the disassembly code and note down the address and memory information.