Q1 (8%) True or False (T/F) For the following, "graph" means "connected graph": a) b) An undirected graph with all edge

[answerhappygod]

Q1 8 True Or False T F For The Following Graph Means Connected Graph A B An Undirected Graph With All Edge 1 (135.57 KiB) Viewed 45 times

Q1 (8%) True or False (T/F) For the following, "graph" means "connected graph": a) b) An undirected graph with all edge weights the same has only 1 minimum spanning tree The splay function in a splay tree might lengthen the longest path rather than shorten it If the number of nodes in a tree is odd, then that tree is a bi-partite graph c) d) Every graph that is a tree has no Euler path e) No complete graph is planar f) Every non-planar graph has at least one spanning tree g) A hash table using probing cannot fill up... one more item can always be inserted h) A hash table using chaining cannot fill up... one more item can always be inserted Q2 (2%): Consider this code fragment for function funOne: public static long funOne (int N) { long sum = 0; answer: for (int i=1; i<=N; i*=2) { for (int k=0; k<5; k++) { sum = sum + i*k; } } return sum; } For No nositive intogor what is a good "Din Oh" worst 0000 ovocution time of function funOno 2
Q9 (12%) For this question, you will select from this list of items: (A) recursion (L) merge sort (M) SHA-256 (B) no efficient solution is known (C) insertion sort (N) is efficiently solvable (D) heap sort (0) dynamic memory in Java (P) bucket sort. (E) can be solved in constant time. (F) nonce (Q) skip list (G) sparse graph (R) solution is impossible (H) no efficient solution is possible (S) selection sort (I) trie (T) dense graph (J) Hash table with chaining (U) quick sort (K) average list length (V) traveling salesman problem For each of the following definitions, select the item above that best matches (put the corresponding letter in the blank); any item above may be used more than once: i) lambda for a chaining hash table ii) finding a minimum spanning tree for a graph iii) used for type ahead suggestions in apps like google search iv) v) hash function used for cryptography and block-chain mining the halting problem vi) sort that has near linear best case time complexity vii) run time heap, and call stack viii) find a Hamiltonian path in a graph ix) complete graph with 8 vertices. x) "fudge factor" integer used to create a valid data fingerprint
(F) nonce (Q) skip list (G) sparse graph. (R) solution is impossible (S) selection sort (H) no efficient solution is possible (I) trie (T) dense graph (J) Hash table with chaining (U) quick sort. (K) average list length (V) traveling salesman problem For each of the following definitions, select the item above that best matches (put the corresponding letter in the blank); any item above may be used more than once: i) lambda for a chaining hash table ii) finding a minimum spanning tree for a graph iii) used for type ahead suggestions in apps like google search iv) hash function used for cryptography and block-chain mining the halting problem sort that has near linear best case time complexity run time heap, and call stack find a Hamiltonian path in a graph complete graph with 8 vertices "fudge factor" integer used to create a valid data fingerprint for a blockchain block probabilistic alternative to balanced BST graph formed with a node for every person in the US and an edge between every pair of people that know each other v) vi) vii) viii) ix) x) xi) xii)