46 Pages

lecture14F05

Course: IB 150, Fall 2009
School: Lake County
Rating:
 
 
 
 
 

Word Count: 2180

Document Preview

back Welcome to IB 150... Channel 12, 8 PM Sept. 26 & 27 "he not busy being born is busy dying" Lecture 13: Microevolution Assigned Readings: Putting genetic drift and mutation together allele gain and loss; infinite alleles model; "neutral evolution" Predicting genotype frequencies from allele frequencies - the Hardy-Weingberg equilibium random mating Forensic...

Register Now

Unformatted Document Excerpt

Coursehero >> Illinois >> Lake County >> IB 150

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
back Welcome to IB 150... Channel 12, 8 PM Sept. 26 & 27 "he not busy being born is busy dying" Lecture 13: Microevolution Assigned Readings: Putting genetic drift and mutation together allele gain and loss; infinite alleles model; "neutral evolution" Predicting genotype frequencies from allele frequencies - the Hardy-Weingberg equilibium random mating Forensic genetics microsatellites Ch. 23 (rest of chapter) IB 150 EXAM ONE INFORMATION-Fall 2005 WHEN: THURSDAY, September 29th , 7-9 PM LOCATIONS-You must go to your assigned room. 1 2 3 4 BRING TO EXAM 1 2 IF YOUR TA IS ROSE or DEVI = GO TO 314 ALTGELD HALL IF YOUR TA IS BEN or ADAM = GO TO 112 GREGORY HALL IF YOUR TA IS DOMINIC or LIZ= GO TO 228 NATURAL HISTORY IF YOUR TA IS MONI, MAHESHI, or BETH =GO TO 213 GREGORY HALL Sharpened PENCILS NON-PROGARAMMABLE CALCULATOR IT IS PAST THE DEADLINE TO SIGN UP FOR THE CONFLICT A Hardy-Weinberg Equilibrium is just like a Punnett square except for a population rather than a single pair cross. Gamete frequencies are the same as the allele frequencies. Sperm with allele A p p2 AA Sperm with allele a q pq Aa q2 aa Ova with allele A p Ova with allele a q pq Aa Fig. 23.5 Note: exam questions only on general issues, calculations on next exam If the genotype frequencies predicted from the allele frequencies turn out to be close to those observed in the population, the population is said to be in a Hardy-Weinberg Equilibrium. A perfect Hardy-Weinberg equilibrium is seen only if there is no genetic drift, no mutation, no subdivision of populations, no natural selection, etc., but it is in fact rather robust to violations of these conditions. Using H-W to determine frequencies of carriers in a population (must assume at least approximately random mating) Phenylketonuria = recessive Mendelian trait 1/10,000 children born in the US have the disease What proportion of the population are carriers? q2 = 0.0001 2pq = 0.0198 q = 0.01 p = 0.99 ~2% of the population are carriers The Hardy-Weinberg Equilibrium is important because: 1. It helps us understand human genetic diseases - (e.g., why are carriers so much more common than affected people?) 2. It is robust to many assumptions. 3. It is basic to a lot of more complex population genetics. 4. It is used in forensic genetics Forensic genetics uses variation such as microsatellite variation differing numbers of short DNA repeats such as AC or AG or ATG. The replication enzymes tend to make frequent mistakes once a few repeats are in place, adding more repeats. Deletions also occur from time to time, so microsat loci do not grow infinitely long. One strand of a DNA molecule shown repeats length ...AATGCGTTAGCACACACGCTAGTACCGCATAG... 3 32 ...AATGCGTTAGCACACACACGCTAGTACCGCATAG... 4 34 ...AATGCGTTAGCACACACACACGCTAGTACCGCATAG... 5 36 These are 3 "alleles" of a microsatellite locus. VoceroAkbani et al. 1996. Mapping human telomere regions with YAC and P1 clones: Chromosome specific markers for 27 telomeres including 149 STSs and 24 polymorphisms for 14 proterminal regions. Genomics 36:492506 . Microsatellite variation - differing numbers of short DNA repeats an actual example with a pedigree. The DNA is run in an electrophoresis gel (bottom towards top), and the bands represent DNA fragments of a given size like 150 base pairs, etc.) Examples of calculations of genotype frequencies using microsatellite variation - the more alleles, the more genotypes, and the lower the frequency will be for each. Note: allele frequencies are all the same in each case just to simplify calculations! Try the Punnett square yourself! Forensics uses Hardy-Weinberg Equilibrium (HWE)! (Alleles) All. p HWE genotype frequencies 11 12 22 2 0.5 0.25 0.50 0.25 11 12 13 22 23 33 3 0.33 0.11 0.22 0.22 0.11 0.22 0.11 11 12 13 14 22 23 24 33 44 4 0.25 0.06 0.13 0.13 0.13 0.06 0.13 0.13 0.13 0.06 Frequencies become even lower when multiple loci (genes) are considered. If the genes are unlinked, you can determine the genotype frequencies for the two-locus genotypes by just multiplying the single locus HWE genotypes. Here the allele frequencies for the A gene are freq. A1 = p = 0.5, A2 = q = 0.5, and for the B gene are B1 = r = 0.4, B2 = s = 0.6. Thus, with enough alleles and enough loci, the frequency (probability) of any genotype is very small - so we are all unique! Lecture 13: Microevolution Assigned Readings: Putting genetic drift and mutation together allele gain and loss; infinite alleles model; "neutral evolution" Predicting genotype frequencies from allele frequencies - the Hardy-Weingberg equilibium random mating Forensic genetics microsatellites Ch. 23 (rest of chapter) Lecture 13: Natural selection Assigned Readings: Natural selection fitness, discrete traits, continuous traits Patterns of natural selection directional, balancing, stabilizing, disruptive, diversifying Sexual selection secondary sexual characteristics, intersexual, intrasexual selection Guppies natural versus cultivated strains, field observations of effects of predators on male color, experiments on balance of natural and sexual selection, field experiments Ch. 23 Natural selection and the influenza virus influenza; surface proteins; immune response; 1918 flue epidemic; antigenic "drift"; antigenic shifts Natural selection - examples and details Anytime there is unequal survival and/or unequal reproduction of genotypes, there is selection. It results in changes in the frequencies of alleles. Fitness = a quantitative measure of an individual organisms ability to survive and reproduce. There are 3 basic patterns of natural selection (same 3 occur with artificial selection also): They are basically the same whether one is studying selection on discrete characters - e.g., white flowers vs purple flowers or quantitative characters - (polygenic or multifactorial characters) - e.g., height, weight, etc. A useful term - polymorphism "A population is said to be polymorphic for a character if two or more distinct morphs are each represented in high enough frequency to be readily noticeable". (p 453) Selection on discrete traits fitness AA Aa aa AA Aa aa AA Aa aa Directional selection: AA has higher fitness than Aa and aa Outcome: allele A replaces a Diversifying or disruptive selection: Aa has a lower fitness than AA and aa Outcome: alleles A and B can be maintained (not fixed by drift). Special conditions. Balancing or stabilizing selection: Aa has higher fitness than AA and aa Outcome: alleles A and B can be maintained (not fixed by drift) Assuming independent assortment there are 23 = 8 gamete type (ABC, Abc, AbC, Abc, aBC, aBc, abC, abc) which can be combined in 64 ways, to produce 27 genotypes, and in this example, 7 phenotypes. Selection on continuous traits - look back at normal curve. Fig. 14.12 aabbcc Aabbcc - 2 ways aaBbcc - 2 ways aabbCc - 2 ways Fig. 23.11 - a "common garden" experiment tells us if the continuous variation we see has a genetic basis. Fig. 23.12 patterns of selection on a continuous trait. Dark individuals have high fitness Dark and light individuals have high fitness Intermediate individuals have high fitness Figure 23.16x1 Sexual selection and the evolution male of appearance Figure 23.16x2 Male peacock Another type of selection is called sexual selection. This often involves secondary sexual characteristicts. In one common type of sexual selection (intersexual selection), females choose males that have the most conspicuous "ornaments". In another (intrasexual selection), males fight for access to females. In intersexual selection, natural selection is still really occurring - males that can survive when burdened with lots of ornaments must have good genes for running ability, flight ability, etc. Examples of natural and sexual selection: Guppies (Poecillia reticulata) are small tropical American fish that have become good examples of microevoluton because 1. Spectacular success in artificial selection. 2. Observations on the interaction of natural and artificial selection "in the field" (nature). 3. Experimental replication of natural and artificial selection in the lab. 4. Experimental studies on the interaction of natural and artificial selection "in the field" (nature). From Dr. K. Hughes web site at UIUC. The three guppies in the middle are females, which show no pronounced color variation. The males on either side are representative of the enormous variation in this species - effectively all male have a different appearance. Domesticated guppies Above falls, predators only of baby guppies (killifish). Below falls, predators of adult guppies (pike cichlid). Field observation: male size and coloration differs even in the same stream, and seems to be related to the presence or absence of predators of adult guppies. Can this observation be acted upon with experiments? Yes. Lab experiments (in above ground swimming pools in a greenhouse at Princeton) showed that the amount of color on male guppies increases due to sexual selection females prefer to mate with brightly colored males. Adding killifish (prey only on baby guppies) does not affect the increase in male brightness. But adding a pike cichlid to a pool results in the fish evolving back to the appearance of "below-falls" fish dul colored males. Can this experiment be done "in the field"? Yes, in one direction (brighter males). Small streams can be found (in Trinidad) which do not have guppies or pike cichlids (although even the smallest streams have killifish) Moving guppies from a "below-falls" population (dull males) to an "empty stream" results in males evolving to be brighter. So both lab and field experiments have corroborated the field observations about the balance of sexual and natural selection in guppies. Fig. 22.12 Other features of guppies have also been found to be subject to experiments on natural selection. Natural selection and medicine An example using the influenza virus. The influenza virus Causes the "flu" symptoms we all know, but is not the only virus to cause runny noses, fevers, and all the rest of the symptoms. Is an RNA virus that replicates itself in animal cells. Like all viruses, it is a complete parasite, and cannot replicate unaided. The influenza virus in the electron microscope. Note the projections on the outside, and in the photo on the left, indications of structures inside the capsule. The projections are two types of proteins, haemaglutinin and neuramindase, which are antigens - molecular sites to which the human body can make antibodies. The other player in this story is the human immune system. It is capable of making antibodies to various chemicals that are introduced into the body. Such chemicals are called antigens. Viral coat proteins are important antigens. A key fact is that it takes about 2 weeks for humans to make a new antibody. Once a human has made an antibody, it can be made more rapidly the second time (antibody "memory"). Influenza coat protein evolution: The human immune system usually (given 2 weeks) destroys a virus infection (but often not before it is transmitted to another person). Eventually, almost all of the people who get the virus become immune and second infections fail. But the influenza virus is constantly giving rise to new mutations, with different amino acid sequences in coat proteins. Such a new sequence (surviving in a few people) can re-infect many people the next flu season because antibodies cannot be made rapidly against it. Thus there is continual evolution of new viral sequences. This process is called, con...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Lake County - IB - 150
Lecture 10: Genetics: Patterns of Inheritance in HumansReadings: Ch. 14, 14.4 to endYou need to be able to explain the following to yourself and to me (on exams):Pedigree analysis for determining patterns of inheritance in humans. reasons, symbols Five
Purdue - EE - 562
Procedure SyntaxCreate [or replace] procedure Procname [(argument [IN|OUT | INOUT] datatype,.)] AS Variable declarations Begin statements End;1Function SyntaxCreate [or replace] function funcname [(argument [IN|OUT | INOUT] datatype,.)] Return datatyp
CofC - TESTS - 102
CHEM 102Dr.D.PRACTICE TEST 2This practice test is meant to suggest the types of questions and content to be covered. It is not meant to be all inclusive of either. Please let me know of any errors that you find.MULTIPLE CHOICE.1.Which of the followi
Rose-Hulman - ECE - 130
ECE130-2 Winter 2003-2004ECE 130-02 General InformationWhat Is Expected of You I expect your work to be handed in on time, in a neat and clearly explained format consistent with the departmental guidelines. Messy work won't be accepted. Be prepared to g
Wheaton College - CS - 215
AlgorithmsSelf-Directed Team Exercise Standard Tries Friday 4/21/06Hello from Worcester! Today you have this assignment to work on as a team; you can break some of it into pieces as you see fit (in particular, different people can work on #s 3, 4, and 5
Wheaton College - CS - 115
Programming FundamentalsThe Candy Store Due Date: Tuesday, September 28, 2004Youre 10 years old. No, really, you are. Just humor me for a moment.PROJECT #1Youre 10 years old, and you loooooove chocolate. You love it so much that you save every cent yo
Wheaton College - CS - 115
Programming FundamentalsDo you want fries with that? Due Date: Tuesday, October 12, 2004PROJECT #2You have been hired to put together a mock-up for the cash registers at the world-famous "Snarky Burger" fast food restaurant. Your cash register program
Wheaton College - CS - 115
Programming FundamentalsCan robots walk a line? Due Date: Wednesday, October 27, 2004PROJECT #3This is now an extra credit project. Please note that the points distribution has been changed. In this project, you are going to use a Lego robot to follow
Wheaton College - CS - 115
Programming FundamentalsREVISED ROBOT PROJECT Due Date: Wednesday, October 27, 2004This is the revised robot project.PROJECT #3Your task is now to write a program assuming that the robot is starting somewhere in a box: Your robot should drive forward
Wheaton College - CS - 115
Programming FundamentalsPROJECT #4The ghost of fractions past haunted by grade school math Due Date: Friday, November 5, 2004From the darkness of your educational past, a ghost has arisen your third grade math teacher. You had hoped to forget her, but
Wheaton College - CS - 115
Programming Fundamentals(Smarter than your AVERAGE Lyon) Due Date: Tuesday, November 16, 2004PROJECT #5Once again, youre going to write a program to help out a teacher except this time, its a college professor. Your program is going to read from a data
Wheaton College - CS - 115
Programming Fundamentals(Arrayed in Your Finest) Due Date: Tuesday, November 30, 2004PROJECT #6Its your first job out of college and you get hired by a cool online company to design their ordering system! Your project will print the catalog of choices
Wheaton College - CS - 116
Pile of Dirty LaundryWow, this is quite impressive. Either the owner of these clothes has an extremely extensive wardrobe, or she must be working pretty hard these days to find something to wear. The pile has reached the height of your knees, and you hav
Wheaton College - CS - 116
/=/ COMP 116 Lecture Examples// RECURSION - main program/#include <iostream>using namespace std;/=/ defining an array to demonstrate these/#define ARRAY_SIZE 15int SortedArray[] = cfw_ 1,3,6,8,10,22,34,45,60,67,72,76,89,92,100;int RandomArray[
Wheaton College - CS - 116
Data StructuresSTL iterator examples#include <stdlib.h> #include <vector> int main() cfw_ vector<char> name; vector<char>:iterator i; vector<char>:reverse_iterator r; char c; / obtain contents of name vector cout < "Enter your name & hit return: "; do c
Wheaton College - CS - 116
Data StructuresSTL vector classAN INTRODUCTION TO STL VECTORS URL for more info: http:/www.sgi.com/tech/stl/ Vector.htmlHandoutAs introduced in lecture, a vector can be seen mostly as a dynamic array. It is an ordered sequence, it can be randomly acce
Wheaton College - CS - 116
Data Structurespoint class (overloaded operators)Handout/ flower.h : a class to hold information about a flower.#include <string> class flower cfw_ public: float GetPollenAmount(); bool operator=( const flower& ); flower& operator=( const flower& ); p
Wheaton College - CS - 116
Data Structurespoint class (overloaded operators) point.h:Handout/ point.h : Defining a class to store the x,y coordinates in a plane / includes overloaded operators for input, output, comparison, / addition, and assignment #include <iostream> class po
Wheaton College - CS - 116
Data Structuresreview class review.h:Handout/ review.h : defines a class to store a review of a computer game / for a website on gaming. / possible genres of computer games enum GenreType cfw_FPS, RPG, ADVENTURE, PUZZLE, STRATEGY, SIM, ACTION; / minimu
Wheaton College - CS - 255
Computer Science 255: Artificial IntelligenceProlog Due Date: Fri, 2/29/08 Name your Prolog source file YourlastnameHW4.pl and submit it to my dropbin when you are completed. Comment each predicate as you would comment a function/method and include a sta
Wheaton College - CS - 255
Computer Science 255: Artificial IntelligenceKnowledge Representation Due Date: Wednesday 4/9/08 1. (20 points) Come up with a script representation of a process you deal with on a regular basis, constructed of a minimum of 4 scenes, using the same forma
Wheaton College - CS - 255
Computer Science 255: Artificial IntelligenceScripts ExampleScripts Handout Page 1 of 2Scripts Handout Page 2 of 2
Wheaton College - CS - 255
Computer Science 255: Artificial IntelligenceNatural Language Processing ExamplesPronoun resolution examples1. John and Mike: a. He has been acting quite odd. He called up Mike Yesterday. John wanted to meet him quite urgently. b. He has been acting qu
Wheaton College - CS - 255
Computer Science 255: Artificial IntelligenceIntroduction to PrologBasic Prolog Syntax Programs are made of two kinds of sentences, including facts, simple predicates that are true about the world and the objects in it: male(fred). male(bob). male(frank
Wheaton College - CS - 255
Computer Science 255: Artificial IntelligenceMore Forward and Backward ChainingFrom Lewis Carrolls Logic Puzzles: No interesting poems are unpopular among people of real taste. [1] x Interesting(x) Popular(x) No modern poetry is free from affectation. [
Wheaton College - CS - 255
ComputerScience255:ArtificialIntelligenceBackward ChainingBackward chaining uses Modus Ponens in the opposite direction. If you want to prove Q, and you know that P Q .then you try to prove P, and that will prove Q. The general approach is the following
Wheaton College - CS - 255
Computer Science 255: Artificial IntelligenceForward ChainingRecall that Modus Ponens says that if you have the implication P Q And you know that P is true, then Q must be true. The way forward chaining works is the following: Find all implications in y
Wheaton College - CS - 255
ComputerScience255:ArtificialIntelligenceLogical InferenceAND-INTRODUCTION: If you have two sentences each which are known to be true: P is true Q is true Brilliant( Mary ) Funny( Mary ) Mary is brilliant. Mary is funny.then you know their conjunction
Wheaton College - CS - 255
Computer Science 255: Artificial IntelligenceFirst Order (Predicate) Logic"ATOMIC" SENTENCES in First-Order Logic: Indivisible propositions which are either TRUE or FALSE. They are written as predicates and usually express a fact, or a relationship, abo
Wheaton College - CS - 255
Computer Science 255: Artificial IntelligencePropositional Logic"ATOMIC" SENTENCES: Indivisible propositions which are either TRUE or FALSE. Usually expresses a fact, or a relationship. Noah is cute. Malory is Lisa's pet. Noah plays with a ball. Sue gav
Wheaton College - CS - 106
The BASICS of COMPUT I NGdue Friday, 9/21/071. (1 pt) General gate questions:HW #3: Logica. What are the three notational methods for describing the behavior of gates and circuits? What is the common information which is conveyed in different ways in
Wheaton College - CS - 106
The BASICS of COMPUTINGdue Friday, 10/5/07HW #5: Objects and Methods1. (1 pt) If we are given an object called human which has the following subparts: head body And the head had the following subpart: eyes While the human had the following properties:
Wheaton College - CS - 106
The BASICS of COMPUT I NG HW #6: If/else and More Objectsdue Friday, 10/12/071. (2 pts) Pick the letter below that best fits the description: A. Variable B. Property C. Method D. Function E. Expression a. b. c. d. e. f. g. h. An instruction that returns
Wheaton College - CS - 106
The BASICS of COMPUT I NGdue Friday, 10/19/07HW #7: Loops1. (1 point) Identify each of these as being an (E)vent controlled loop, or a (C)ounter controlled loop. a. A loop which executes something 7 times every time you run the program. b. A loop which
Wheaton College - CS - 106
The BASICS OF COMPUT I NGThe Game of PigProject #1Due: Friday, November 9In this project, you will be creating a playable version of the game PIG, in which two players roll a die in a race to get to 100 points. During a turn, a player can accumulate p
Wheaton College - CS - 106
The BASICS of COMPUT I NG WWWdue Friday, 11/16/07HW #11: Networks and the(7 pts) For the following, identify the term that goes with the description possible answers are: A. B. C. D. E. F. G. bandwidth data transfer rate HTML attribute <head></head> <b
Wheaton College - CS - 106
-Go to Main Menu <./DataArchive.html>Go to Power Search </cgi-bin/iform?DASL>Go to Datafile Subjects <./allsubjects.html>-*Datafile Name:* Hot dogs *Datafile Subjects:* Food</cgi-bin/isearchb?DATABASE=DASL&SEARCH_TYPE=boolean&ELEMENT_SET=title&MAX
Wheaton College - CS - 106
Lisa MichaudProject #2Page 1 out of 3Chart 1 : Composition of Data Set by Type31% 100% 90% 80% 70% 60% 50% 40% 30% 20% 10% 0%Chart 2 : Percentage of Hot Dogs Which are High-Calorie37% Beef Meat Poultry31%BeefMeatPoultryChart 3 : Calories by Typ
Wheaton College - CS - 106
The BASICS of COMPUT I NGExample SubmissionsProposalPROJECT #2The file I have chosen to do my analysis on is the Hot Dogs file. This file contains information about the composition type, calories, and sodium level of 54 different brands of hot dogs. T
Wheaton College - CS - 106
The BASICS of COMPUT I NGProposal Due: Friday, November 16, 2007 Final Due Date: Wednesday, November 28, 2007SummaryPROJECT #2Data Analysis and Presentation Using SpreadsheetsNow that you have some experience using a spreadsheet to do both data proje
Wheaton College - CS - 106
The BASICS of COMPUT I NGDale & Lewis Chapter 2: Number Systems Final Exam ReviewNumbers in different bases: binary, decimal, hexadecimal Conversion: from other bases to decimal, from decimal to binary Math in different bases: addition in binary Key c
Wheaton College - CS - 106
The BASICS of COMPUT I NGSQL SyntaxSQL (Structured Query Language) is a powerful language for designing databases, modifying them, and, and drawing information out of them. It provides a standardized interface between applications and the underlying inf
Wheaton College - CS - 106
The BASICS of COMPUT I NGReview of Set Notation A = cfw_1,2,3,4 xA B = cfw_3,4,5,6 xASet TheoryU = cfw_1,2,3,4,5,6,7,8,9,10 1A 1B x is a member / is not a member of set A the intersection of sets A and B A B = cfw_x : x A and x B the union of sets A
Wheaton College - CS - 106
The BASICS of COMPUT I NGPages and FramesThe idea of paging is two-fold: Demand PagingAll programs currently running and all of their data must be in the main memory, from where the Control Unit can fetch the next instruction in order to execute it. H
Wheaton College - CS - 106
The BASICS OF COMPUT I NGRecording Your Alice ProgramsIf you are using Windows, there is a freeware screen recording software called CamStudio that will allow you to make movies of your Alice programs in action to share with your friends and family who
Wheaton College - CS - 215
AlgorithmsBig O: The Upper BoundBig O and its Cousinscg(n)f(n)n n0f(n) is O(g(n) ifthere is some real constant c > 0 and some integer constant n0 0 such that f(n) cg(n) for all n n0 Big Omega: The Lower Bound f(n) cg(n)n0nf(n) is (g(n) ifthere
Wheaton College - CS - 215
AlgorithmsAssignment #1 Homework: Big "Oh" Analysis Due Friday 2/3/061. (1 point) Bill has an algorithm, find2D, to find an element x in an n n array A. The algorithm find2D iterates over the rows of A, and calls the algorithms arrayFind, of Code Fragme
Wheaton College - CS - 215
AlgorithmsAN INTRODUCTION TO STL VECTORSLab #2 STL Vectors Tuesday 2/6/06As introduced in lecture, a vector can be seen mostly as a dynamic array. It is an ordered sequence, it can be randomly accessed (using the same kind of subscripts you are used to
Wheaton College - CS - 215
AlgorithmsOBJECTIVEAssignment #2 Program: Big O Due Thursday 2/9/05Write an program to prime numbers from 2 to n, where n is entered by the user at runtime. In addition to finding (and printing) the primes, you are going to analyze the amount of work y
Wheaton College - CS - 215
AlgorithmsLab #3 STL Lists and Recursion Tuesday 2/14/06AN INTRODUCTION TO STL LISTS URL for more information: http:/www.sgi.com/tech/stl/List.html The list class in the STL is an implementation of a doubly-linked list. Unlike with a vector, you cannot
Wheaton College - CS - 215
AlgorithmsRECURSIVE FUNCTIONS FOR EXPRESSING RUNNING TIMERecurrence RelationsThe idea behind a recurrence relation is to find a way to express the running time of an algorithm in terms of n, the size of its input: TA(n) = the time it takes algorithm A
Wheaton College - CS - 215
AlgorithmsThe recurrence relation was: T(1) = 0 T(n) = 2 T(n/2) + n Expand:Solution to Practice ProblemT(n) = 2 T(n/2) + n = 2 [ 2 T(n/4) + n/2 ] + n = 2 2 T(n/4) + n + n = 2 2 T(n/4) + 2n = 2 2 [ 2 T(n/8) + n/4 ] + 2n = 2 2 2 T(n/8) + 3n Guess: k expa
Wheaton College - CS - 215
AlgorithmsWork on this problem as practice for the first midterm.Practice ProblemThe recurrence relation that expresses the running time of most efficient sort algorithms is: T(1) = 0 T(n) = 2 T(n/2) + n For example, in merge sort, you first sort each
Wheaton College - CS - 215
AlgorithmsOBJECTIVEAssignment #3 Program: Recursion Due Friday 2/24/05Write a program to find all Inverted Repeats (IRs) of a given length L in an input file of nucleotides (DNA!) in the FASTA format. The length L is determined by the user at run-time;
Wheaton College - CS - 215
AlgorithmsLab #5 STL Stacks and Depth-First Search Tuesday 3/7/06AN INTRODUCTION TO STL STACKS URL for more information: http:/www.sgi.com/tech/stl/stack.html #include <stack> By this point, you know that most of the STL types work the same way as the o
Wheaton College - CS - 215
AlgorithmsDESCRIPTION Today you are going to implement a binary search tree. TO DO TODAY: 1. Download the starter files for this lab from the course website: node.h node.cpp tree.h 215 Lab 06 Starter.cppLab #6 Binary Search Trees Tuesday 3/21/062. Crea
Wheaton College - CS - 215
AlgorithmsAN INTRODUCTION TO STL SORTING ALGORITHMSLab #8 Sorting in the STL Tuesday 4/04/06One of the really cool things about the Standard Template Library is the series of generic algorithms that can be used on just about any one of the STL types. E
Wheaton College - CS - 215
AlgorithmsTHE RECURRENCE RELATION T(1) = 1 T(n) = 1 + 2 T(n/2) + n EXPAND T(n) T(n) T(n) = 1 + 2 [1 + 2 T(n/22) + n/2] + n = 3 + 22 T(n/22) + 2nThe Merge-Sort Running Time Proof2 expansions= 1 + 2 + 22 [1 + 2 T(n/23) + n/4] + 2n = 7 + 23 T(n/23) + 3n
Wheaton College - CS - 215
Algorithms: SupplementProving a Lower Bound for Comparison Algorithmsn1 2 4 8 16 32 64 128log n! log(n/2)^n/2)0 1 4.58 15.30 44.25 117.66 296.00 716.16 -0.5 0 2 8 24 64 160 384log(n^n) log(n/x)^n/x)0.00 2.00 8.00 24.00 64.00 160.00 384.00 896.00 -0
Wheaton College - CS - 215
AlgorithmsAssignment #5 Program: Game Trees Phase I Due Wednesday 3/29/06 Phase II Due Friday 4/7/06OBJECTIVE In this project, you will be designing a variant of the Checkers game in which the user plays against the computer. This is a very large and in
Wheaton College - CS - 215
AlgorithmsCOMPARING THE ALGORITHMSLab #9 Pattern Matching with Different Algorithms Tuesday 4/18/06In class we have studied the algorithms and implementation of three different pattern-matching algorithms: 1. Brute Force 2. Boyer-Moore 3. Knuth-Morris-