Q6 1 Which Of The Following Is The Best High Level Description Of The Blockchain Such As Used To Implement Bitcoin 1 (154.75 KiB) Viewed 41 times
Q6 (1%): Which of the following is the best high-level description of the blockchain (such as used to implement Bitcoin)? a) Skip list that uses hashing instead of coin flips b) Balanced binary search tree with hashes as node values c) Hash map of data blocks that uses chaining for collisions d) Linked-implementation stack with hash values as links e) Doubly linked list with hash values as links f) Minimum binary heap of hashes as priorities Answer: Q7 (6%) True or False: Consider the graph G to the right, then answer T or F (true or false) for each of these: 2 2 a) G is a complete graph b) G has more than 5 spanning trees c) G has more than one minimum spanning tree 4 G has an Euler circuit G has an Euler path (that cannot be made a circuit) G is not a planar graph d) e) f) G: 1 1 4 6 5 10 1 3
Q8 (4%) Consider this undirected graph (at right) a) Is there a Hamiltonian path? b) If so, show one: c) If not, why not? d) Is there a Hamiltonian circuit? e) If so show one: f) If not, why not? H X T K M E F
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!