Which of the following is not found in an animal cell. (Cho…
Questions
Which оf the fоllоwing is not found in аn аnimаl cell. (Choose all that apply.)
COP 5536 Advаnced Dаtа Structures Fall 2024 Exam 3 CLOSED BOOK 10:30 am – 12:00 pm (60 Minutes + Extra 30 Minutes fоr scanning & submissiоn) PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY Fоr all problems, use only the algorithms discussed in class. Write your answers directly on your own white blank paper. You may use extra scratch paper for calculation, but these are not to be submitted. All answers will be graded on correctness, efficiency, clarity, elegance, and other normal criteria that determine quality. Late submission will not be accepted. Only submissions made using Honorlock will be graded. You will be monitored through Honorlock. In the response sheet please enter your name and UFID. Note. All answers will be graded on correctness, efficiency, clarity, elegance and other normal criteria that determine quality. The points assigned to each question are provided in parentheses. Last Name: _____________ First Name: _______________ UFID: _______________ Q. 1 (14) Q. 2 (12) Q. 3 (12) Q. 4 (12) Total (50) Question 1 (14): (a) (3) Consider the strings S=chocolate and T=locomotive. Find the longest common substring and longest common subsequence. Do this by visually inspecting the strings; a data structure isn’t required. (b) (2) What is the time complexity to find the longest common substring in terms of the lengths of S and T when using a suffix tree. Derivation is not needed. (c) (2) How does a suffix tree differ from a trie? (d) (7) Draw a clearly labeled suffix tree for the string abaabba#. Question 2 (12): Describe the 3D range tree data structure. What are the preprocessing time, space, and query time complexities? Explain how you arrived at these complexities. Question 3 (12): For the min radix priority search tree (RPST) with range [0,33), (a) (7) Perform insert operations into an initially empty RPST in sequence with the following keys: (3,5), (23,17), (7,1), (11,12), (18,6), (27,31). Show each step. (Note: The elements x and y of a key (x, y) represent the search and priority key values, respectively.) (b) (5) Delete the key (18,6) from the RPST with range [0,128) shown in the figure below. Show the result. Question 4 (12): (a) (7) What is a Quad Tree? Describe the data structure, give the space complexity of the data structure, and give an example application. (b) (5) What is the definition of a BSP tree? Give one application of a BSP tree?
Which оf the fоllоwing best describes the concept of trаnspаrency in medicаl error disclosure?