bg
bg
bg
bg

GradePack

(45 points) Work out the following problems (12, 13, and 14)…

(45 points) Work out the following problems (12, 13, and 14) on paper.  When you are done, take a photo of your work and upload it to CANVAS as a SINGLE jpeg or pdf.  You must SHOW ALL OF YOUR WORK (no work – no points).  You also must show ALL relevant reactions (equilibria and/or 100% complete). Report answers to three significant figures. Circle your final answers.   Determine the molar solubility of silver sulfide, Ag2S, in a solution that is 1.5×10–4 M AgNO3. The Ksp of silver sulfide is 6.2×10–30. Determine the change in entropy for the following reaction using the entropies of formations given:                   2 Pb(s)  +  O2(g)  

 Read Details

Problem 2 (5 points) – B-Tree (1) (1 point) Explain how to f…

Problem 2 (5 points) – B-Tree (1) (1 point) Explain how to find the minimal key stored in a B-tree; (2) (2 points) Give the pseudo code of the predecessor function B-Pred(x, k) of a given key k stored in node x of a B-tree; (3) (2 points) Show the process of inserting the following keys into a B-tree with degree t = 2 in the given order using the algorithm in our Textbook: Your Family Name, FIU, SCIS, COP5407,  Final, Exam, and Spring2025 (you only need to show the relative positions of the keys without drawing the nodes).

 Read Details

Problem 1 (8 points) – Concepts on Data Structures and Analy…

Problem 1 (8 points) – Concepts on Data Structures and Analysis Techniques      Please keep your answers short (one sentence for the problem description and a couple of sentences for meaningful explanations). (1) (1 point) Briefly describe a simple problem where hash tables can be effectively used. (2) (1 point) Briefly describe a simple problem where B-trees can be effectively used. (3) (1 point) Briefly describe a simple problem where disjoint sets can be effectively used. (4) (1 point) Briefly describe a simple problem where average case complexity analysis is needed. (5) (1 point) Briefly describe a simple problem where amortized analysis is needed. (6) (1 point) Briefly describe a simple problem where greedy methods can be effectively used. (7) (1 point) Briefly describe a simple problem where dynamic programming is needed. (8) (1 point) Briefly describe a simple problem where graph search algorithms can be effectively used.

 Read Details