Class Note for ADSC 730 at KU
Popular in Course
Popular in Department
This 8 page Class Notes was uploaded by an elite notetaker on Friday February 6, 2015. The Class Notes belongs to a course at Kansas taught by a professor in Fall. Since its upload, it has received 31 views.
Reviews for Class Note for ADSC 730 at KU
Report this Material
What is Karma?
Karma is the currency of StudySoup.
You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!
Date Created: 02/06/15
EECS 730 Background Survey Open book open notes open to intemet resources but NO copy and paste Develop your own solutions NO discussion among classmates treat this as a take home exam Total point 100 Assigned Aug 24th Due Aug 31th before class meeting time Problem 1 25 points Given the following graph show the result of different graph search 1 Starting at node 2 show the sequence of Visited nodes using breadth rst search 2 Starting at node 2 show the sequence of Visited nodes using depth rst search 3 What is the shortest distance between node 2 and node 6 4 Draw a spanning tree of the graph 5 Outline two data structures that you may use to implement a tree Problem 2 25 points A string T is a subsequence of a string S if T can be obtained by removing characters from S without changing the order of remaining characters For example a string T ABC is a subsequence ofthe string S ADBBCD since we could obtain ABC by removing the second D the fourth B and the last character D of S without changing the order of the remaining characters in S As another example T ABC is not a subsequence of the string S ACBD since there is no way that we can obtain T from S by removing characters from S alone With the above de nition answer the following questions Justify your answer 1 Whether the string T CCAGT is a subsequence ofthe string S ACGCTATGT If yes specify how to obtain T from S If no state your reason 2 Giving two string S1 ACGGACT S2 GTCGTTCGGGATGC find a common subsequence where a string T is a common subsequence to two string S1 and S2 if T is a subsequence to both S1 and S2 3 Identify the longest common subsequence the common subsequence with the maximal number of characters among all common subsequences of S1 and S2 from above 4 Discuss how to develop an algorithm to solve the longest common subsequence problem in general The input to the algorithm is a set of two sequences and the output from the algorithm is the common longest subsequence Write down your pseudo code and explain how it works 5 Apply your algorithm to solve question 3 Problem 3 25 points A biomedical company is evaluating a new diagnostic tool kit Scientists established that the probability that a single diagnostic kit works is p and hence the probability that a single diagnostic kit fails is lp Scientists also established that if atool kit works it produces correct diagnostic results and when it fails it produces no results 1 Suppose a technician is using the diagnostic kit to perform lab test where she use one kit for one lab test The procedure she follows is that she will stop once she obtains correct diagnostic results Otherwise she will repeat the lab test once more until she obtains the correct results Following the procedure please compute the probability that she uses exactly two tool kits to obtain correct diagnostic results 2 Following the same procedure please compute the probability that she uses exactly ktool kits to obtain correct diagnostic results where k is a positive integer 3 Compute the expected number and the variance of the number of tool kits that the technician uses to obtain correct diagnostic results Problem 4 25 points Explain the following biological terms in a concise way 13 sentences in most cases 1 Chromosome 2 DNA 3 Gene 4 Protein 5 Transcription 6 Translation in terms of protein synthesis 7 Microarray 8 Proteinprotein interaction 9 extra credit write down your comments about the class so far too fast too slow too much biology too little biology whether it is easy to nd reference 5 points
Are you sure you want to buy this material for
You're already Subscribed!
Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'