A palindrome is a sequence that reads identically forwards and backwards. For instance, “radar” and “level” are palindromes. In a singly linked list, a palindrome means that the list’s values are the same when traversed from the head to the tail as they are when traversed from the tail to the head. The following algorithms can determine whether a singly linked list is a palindrome. Please select the time and space complexity for each algorithm. Note the stack space used by function calls must be accounted for when calculating space complexity. Suppose the linked list contains N nodes. Algorithm 1 – Stack: traverse the list and push each element onto a stack. With the help of the Stack, decide if the Linked List is palindrome. Time Complexity: [a] Space Complexity: [b] Algorithm 2 – Array: traverse the list and copy each element in an array. Then, check if the array is palindrome Time Complexity: [c] Space Complexity: [d] Algorithm 3 – Two Pointer: use two pointers: one moving at twice the speed of the other. When the fast pointer reaches the end, the slow pointer will be at the midpoint. Reverse the second half of the list and then compare it to the first half. Time Complexity: [e] Space Complexity: [f] Algorithm 4 – Recursion: recursively traverse the list until reaching the end. Use a global variable to keep track of the current node, starting from the head. As the recursion unwinds, compare the value of the current node with the value of the node being processed in the recursive stack.  Time Complexity: [g] Space Complexity: [h]

2. From the following sketch of a kidney (longitudinal slice), identify each major section of the kidney/urinary system indicated with A, B, C, and E.  A. [A] B. [B] C. [C] D. [D]  E. [E] G. In which of these areas does the main work of the nephrons take place? [G]

Which of the following is true about the treatment of hard water to reduce its mineral content?

The following fictional data represents the number of days before Christmas and the sales of a particular retail store. Use the data to answer the questions below.  #days until Christmas Sales (in thousands of dollars) 75 15 60 20 20 75 10 150 5 300 2 500   Use Exponential Regression to find the best fit exponential function for the data. [A] Use the function found in part A to estimate the sales with only 1 day left to Christmas. [B]

Quidquid id est, timeō Danaōs et dōna ferentēs.”    Sīc fātus validīs ingentem vīribus hastam     in latus inque ferī curvam compāgibus alvum    contorsit. Stetit illa tremēns, uterōque recussō    īnsonuēre cavae gemitumque dedēre cavernae.    Et, sī fāta deum, sī mēns nōn laeva fuisset,    impulerat ferrō Argolicās foedāre latebrās,    Troiaque nunc stāret, Priamīque arx alta manērēs.   The verb ‘insonuere’ in line 5 is shortened or syncopated. What is the unsyncopated form of this verb?

If I wanted you to study consistently, every day for this class, what interval reinforcement schedule (fixed/ variable) would you recommend? Why?

Complete a desk space scan right now – do not skip this question to come back to.  Take your camera and point it at your desk space and slowly scan your desk space. 

Which of the following statement explains the basic action of risvastigmine (Exelon) for patients with Alzheimer’s Disease? 

A respiratory therapist observes the following F/V Loop during a ventilator check. Which of the following is the therapist’s most appropriate action?                        

Given a DNA sequence database where each sequence is a string composed of characters “A”, “G”, “C” and “T”, we use a Trie data structure to efficiently handle operations such as searching for specific DNA sequences and finding common prefixes. Suppose we have n sequences of DNA, with lengths ranging from 3 to m. Answer the space and time complexity with Big-O notation. The maximum depth of the Trie is [depth]. The maximum space complexity of the Trie is  [space].  The worst case time complexity of searching a string in the Trie is [time].