11 Pages

t2fa00reviewsol

Course: CS 100, Fall 2008
School: Cornell
Rating:
 
 
 
 
 

Word Count: 2498

Document Preview

are Explanations often given in the comments. Read the comments carefully. Below are some important ideas for developing algoithms. They may make more sense after you read/try the review questions. I put them up front to make sure that you see them. Important ideas for developing algoithms (learned from review questions below): + Try to identify when iterations are necessary or "Smell the...

Register Now

Unformatted Document Excerpt

Coursehero >> New York >> Cornell >> CS 100

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.
are Explanations often given in the comments. Read the comments carefully. Below are some important ideas for developing algoithms. They may make more sense after you read/try the review questions. I put them up front to make sure that you see them. Important ideas for developing algoithms (learned from review questions below): + Try to identify when iterations are necessary or "Smell the iteration" When you say to yourself "do something until some condition is met," that's an iteration, like question 6 below. This is what we call indefinite iteration--you don't know how many iterations before you stop. In this case, $while$ is a good loop to use. Ask yourself what is the condition for continuing the iteration and how to update the variable(s) to be tested in that condition. Sometimes, some "smart" initialization is needed to enter the loop correctly. Don't let that bother you--just start by writing the general condition for continuing the iteration and whatever initialization you can think of. Then go back to check to see if you enter the loop correctly and make sure that your update works properly. Now you're ready to make any necessary changes to make the initialization/condition "smart." When you say to yourself "one at a time," like "add one space at a time" in question 4a, that's an iteration also. If you know when to stop (e.g., add $x$ spaces), a good choice is the $for$ loop. + Try to identify simple tasks within a complicated problem/procedure. In an exam, we sometimes help you break down the problem by listing the methods or saying that one method should call another. Tackle the simple tasks one at a time, but occasionally jump around for inspiration. Don't forget to check the whole thing in the end! + Give yourself a concrete example and draw some diagrams, box-scope or not. If you went to the review session, think back to how we worked on question 6. Sometimes we help you by giving you an example in the question statement. Read (and analyze) the example and any example output carefully! Lots of information/insights can be gained. E.g., instance vs static, parameter types for methods, etc. ============================================================ Question 1: Box-scope diagram Numbers in square brackets [] indicate step number. Please see http://courses.cs.cornell.edu/cs100/2000sp/Prelims/box.txt for step-by-step explanation. class Frippy { int x; Frippy F; } class Boingo { String a; Frippy b; } public class Problem1 { public static void main(String[] args) { Frippy F1 = new Frippy(); Frippy F2 = new Frippy(); Boingo B1 = new Boingo(); Boingo B2 = new Boingo(); B2.a = "grok"; B1.b = new Frippy(); F2.F = B1.b; B1.b.F = F1; ++B1.b.F.x; Boingo B3; F2 = null; // ****draw the box/scope diagram up to this point*** } } class Problem1 +--------------------------------------------------------------[10]-+ | +---+ +---+ +----+ +---+ +---+ +---+ | | args | *-+-+ F1 | * | F2 |null| B1 | * | B2 | * | B3 | ? | | | +---+ | +-+-+ +-+--+ +-+-+ +-+-+ +---+ | +------------+------+----------+----------+----------+--------------+ | | | | | <----+ | [1] [11] X [2] [3] +--+ [4] +------+ class Frippy | | | | +-------------------+----------+-------------+--------------+--------------+ | [12] V | | | [12] | | +--\-------/ +----------+ >+----------+ | +----------+ | +--\-------/ | | | \----+/| | \-/--+ | | +----+ | | | +----+ | | | \----+/| | | | x |\ / | | x |0[9]|1| | x |0 | | | | x |0 | | | | x |\ / | | | | +-\-/+ | | /-\--+ | | +----+ | | | +----+ | | | +-\-/+ | | | | X | | | | [7] | | | | | | X | | | | +-/-\+ | | +----+ | | +-\-/+ | | | +-\-/+ | | | +-/-\+ | | | | F |/ \ | | F |null| | | F |nuXl*-+-+>| F |nuXl| | | | F |/ \ | | | | /----+\| | +----+ | | +-/-\+ | | | +*/-\+ | | | /----+\| | | +--/-------\ +----------+ +----------+ | +----+-----+ | +--/-------\ | | [8] ^----------------+------+ ^ | | +--------------------------------------------+--------+-----+--------------+ | | | | [6] | | class Boingo | | | +--------------------------------------------+--------|-----+--------------+ | [12] [12] [12] | | | | | +--\-------/ +--\-------/ +--\-------/ +>+------|---+ +>+----------+ | | | \----+/| | \----+/| | \----+/| | +--|-+ | | +-\-/+ | | | | a |\ / | | a |\ / | | a |\ / | | a |nu|l| | | a |nuXl*-+-+-+ | | +-\-/+ | | +-\-/+ | | +-\-/+ | | +--|-+ | | +-/-\+ | | | | | X | | X | | X | | | | | | | | | | +-/-\+ | | +-/-\+ | | +-/-\+ | | +-\*/+ | | +----+ | | | | | b |/ \ | | b |/ \ | | b |/ \ | | b |nuXl| | | b |null| | | | | | /----+\| | /----+\| | /----+\| | +-/-\+ | | +----+ | | | | +--/-------\ +--/-------\ +--/-------\ +----------+ +----------+ | | | | | +--------------------------------------------------------------------------+ | | class String | +----------------------+ | | | [5] | | "grok"<--------------+-----------------------------------------------------+ | | +----------------------+ ============================================================ Question 2: constructors, passing parameters Solution: $swap4$ is the only method that swaps sucessfully. Use box-scope diagrams to prove it to yourself. //------------------------------------ // Class $FatInteger$ is a "wrapper class". Its purpose is to allow us to // treat an $int$ as an object by simply storing the $int$ in an object. // It provides constructors to create $FatInteger$s, a method to set the value // of a $FatInteger$ from another $FatInteger$, and a $toString()$ method. class FatInteger{ private int n; // the interger inside the object // Constructor for default case ($n$=0), no argument FatInteger(){} // Constructor: assign to $n$ the value of an integer argument FatInteger(int n){ this.n = n; // note: $this$ is necessary } // Constructor: assign to $n$ the value stored in the $FatInteger$ argument FatInteger(FatInteger other){ this.n = other.n; // note: $this$ is NOT necessary } // Set the value of a FatInteger based on another FatInteger void setValue(FatInteger other){ this.n = other.n; // note: $this$ is NOT necessary } // The toString() method for printing public String toString(){ return "" + n; } } class Swap{ public static void main(String arg[]){ // Call various methods to attempt to swap the variables that are // passed to the methods. You determine which of them succeed. // Predict the output from each of the four print statements. int x = 5, y = 7; swap1(x,y); System.out.println("After swap1, x = " + x + ", y = " + y); FatInteger p = new FatInteger(6); FatInteger q = new FatInteger(8); swap2(p,q); System.out.println("After swap2, values in p, q are " + p + ", " + q); FatInteger r = new FatInteger(15); FatInteger s = new FatInteger(17); swap3(p,q); System.out.println("After swap3, values in r, s are " + r + ", " + s); FatInteger t = new FatInteger(16); FatInteger u = new FatInteger(18); swap4(t,u); System.out.println("After swap3, values in t, u are " + t + ", " + u); } static void swap1(int a, int b){ int temp; temp = a; a = b; b = temp; } static void swap2(FatInteger a, FatInteger b){ FatInteger temp; temp = a; a = b; b = temp; } static void swap3(FatInteger a, FatInteger b){ FatInteger temp; temp = new FatInteger(a); a = new FatInteger(b); b = new FatInteger(temp); } static void swap4(FatInteger a, FatInteger b){ FatInteger temp = new FatInteger(); temp.setValue(a); a.setValue(b); b.setValue(temp); } } ============================================================ Question 3: Returning multiple values in methods via objects Write the code for method $calcStats$ to calculate some statistics given 3 numbers. Then fill in the missing code in method $main$ where you call the $calcStats$ method. If necessary, check out the example in the book on page 227 (in the grey box) for additional help. //------------------------------------ // class StatValues{ // instance variables double average; double minimum; double maximum; // constructor that does nothing public StatValues(){} } class Statistics{ // main method public static void main(String[] args){ // assign 3 double variables // note: we forgot to declare num1,num2,num3 in the original question double num1=12.32; double num2=66.01; double num3=32.39; // call method $calcStats$ to get the average, minimum, // and maximum for the 3 numbers above //--------------------------------------------- StatValues mystat=calcStats(num1,num2,num3); //--------------------------------------------- // Output System.out.println("My avg: "+mystat.average); System.out.println("My min: "+mystat.minimum); System.out.println("My max: "+mystat.maximum); } // Determine the average, minimum, and maximum of exactly 3 $double$ // numbers. Return a reference to an object of class $Statvalues$ . // (Once you know how arrays work you can easily change the code // to determine these statistics for any number of numbers.) public StatValues calcStats(double a,double b,double c){ StatValues result; // reference variable for results StatValues(); result=new double sum=a+b+c; double min,max; // determine $max$ and $min$ if (a<=b){ min=a; max=b; } if (min>c) min=c; if (max<c) max=c; // assign values to $result$ result.average=sum/3.0; result.minimum=min; result.maximum=max; // return result return result; } } // What are the necessary changes if you make method $calcStats$ $private$? // NONE (because method $calcStats$ is called and defined in the same class) ============================================================ Question 4: for-loop, encapsulation Mistake in the original question: Change all occurrences of $Person$ to $PersonWOutEncaps$ Part a: Complete class $PersonWOutEncaps$ by writing method $addstrings$ //------------------------------------ class PersonWOutEncaps { // instance variables public String firstname; public String lastname; // constructor PersonWOutEncaps() { }; // Add blank spaces between 2 Strings. The number of spaces is passed as // an Integer. public String addstrings(int spaces, String start, String stop) { // create middle string of blank spaces String middle = ""; // iterate to get the correct number of spaces for(int s = 1; s <= spaces; s++) middle = middle + " "; return (start + middle + stop); } // method addstrings } // class PersonWOutEncaps Part b: Given the complete class $PersonWOutEncaps$ and the following class $WOutEncaps$, make all changes necessary to implement encapsulation in both classes and call the new classes $PersonWithEncaps$ and $WithEncaps$. //------------------------------------ public class WOutEncaps { public static void main(String args[]) { // instantiate nic using constructor PersonWOutEncaps() PersonWOutEncaps nic = new PersonWOutEncaps(); // assign values to instance variables of nic nic.firstname="Nici"; nic.lastname ="Waldhausen"; // Retrieve individual values from nic System.out.println(nic.firstname); System.out.println(nic.lastname); // Determine fullname String f=nic.firstname; String l=nic.lastname; String fullname = addstring(2,f,l); System.out.println(fullname); } // method main } // class WOutEncaps Solution to Part b: Read all comments carefully. //------------------------------------ class PersonWithEncaps { // declare public if used in another file // instance variables (hide) private String firstname; private String lastname; // constructor PersonWithEncaps() { }; // utility methods (hide) // this method adds blanks spaces between 2 Strings private String addstrings(int spaces, String start, String stop) { // create middle string of blank spaces String middle = ""; // iterate to get the correct number of spaces for(int s = 1; s <= spaces; s++) middle = middle + " "; return (start + middle + stop); } // method addstrings // service methods (public) // these are the getters and setters the user needs public void set_firstname(String name) { firstname = name; } // method set_firstname public void set_lastname(String name) { lastname = name; } // method set_lastname public String get_firstname() { return firstname; } // method get_firstname public String get_lastname() { return lastname; } // method get_lastname public String get_fullname(int spaces) { String fn = get_firstname(); String ln = get_lastname(); return addstrings(spaces, fn, ln); } // method get_fullname } // class PersonWithEncaps public class Encaps { public static void main(String args[]) { // instantiate using constructor PersonWithEncaps() PersonWithEncaps nic = new PersonWithEncaps(); // assign values to instance variables of nic nic.set_firstname("Nici"); nic.set_lastname("Waldhausen"); // Retrieve individual values from nic System.out.println(nic.get_firstname()); System.out.println(nic.get_lastname()); // Determine fullname String fullname = nic.get_fullname(2); System.out.println(fullname); } // method main } // class Encaps /* OUTPUT Nici Waldhausen Nici Waldhausen */ ============================================================ Question 5: instance methods, test equality Part a: Complete the class $Person$ with instance variables $name$, $age$, and $friend$ a constructor to initialize the $name$ and $age$ and instance methods $describe$Print the Person's name, age, and one of the following: "self sufficient" if the Person's friend is himself/herself; "no friend" if the Person does not have a friend; or the name of the Person's friend. $makefriend$Get another Person, passed in the argument, as a friend. $befriend$Become the friend of another Person passed in the argument //------------------------------------ class Person{ String name; int age; Person friend; // Constructor to initialize $name$ and $age$ based on passed arguments Person(String n, int a) { name = n; age = a; } // Print description of a Person void describe(){ String s = "name "+name+"age "+age; if (friend == this) s += " self sufficient"; else if (friend == null) s += " no best friend"; else s += " friend " + friend.name; System.out.println(s); } // Make a friend void makefriend(Person p){ friend = p; } // Become another Person's friend void befriend(Person p){ p.friend = this; } } // class Person Part b: Write a method $main$ in class $Xfiles$ using the methods in class $Person$ to create the people and relationships below and print a description of each $Person$. Scully, 31, has friend Mulder Mulder, 31, has friend Scully Skinner, 49, is his own best friend CSM, 103, has no friend //------------------------------------ class Xfiles{ public static void main(String[] args){ Person s, m, k, c; s = n...

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:

Mich Tech - EE - 3301
Orcad Component Information System Quick ReferenceShortcut keys CIS toolbars Command mapping from CIS v7.20 to CIS Release 9Cadence PCB Systems Division (PSD) offices PSD main office (Portland) PSD Irvine office PSD Japan office PSD UK office PSD
University of Illinois, Urbana Champaign - ECE - 390
NetLib: NetBIOS Library Calls- John Lockwood, lockwood@ipoint.vlsi.uiuc.edu Department of Electrical and Computer Engineering University of Illinois at Urbana/Champaign Version 1.2, March 1999Purpose- General purpose ASM network librar
Washington - PHYS - 334
ASU - MAT - 274
F ggfY(zgg(@Y9 gfYic@Y( D 9 $Y ( u y G z v y z E 7 5 q 4 o X f ! &quot;YiV (e {( f b S gyT f f(YPi f b S i ' k T ` ' gfYic@Y(@$Y g u z v y z 97 5 q 4 h ` b T &quot; #! YWY3&quot;T iS dY(ig&quot;Pi f b S i ' C F C iciv g Y(g
ASU - MAT - 274
MAT 275Parachute WorksheetThe purpose of this worksheet is to discuss the rst order dierential equation k dv = g v (1) dt m Suppose the above equation describes the fall of a skydiver who jumps out of an airplane at the altitude of 2000m. Assume
ASU - CET - 459
CET 458/598Fall 2000Lecture NotesChapter 1 IntroductionSection 1.1 mostly terminology Connectivity, scale, link, node, point-to-point, multiple-access, switched network (circuit vs packet switched, similarities to telephone system and snail-ma
ASU - CET - 459
CET 458/598Graph TheoryFall 2000graph - a set of nodes (vertices) and a set of arcs (edge, link, line) connecting the nodes adjacent nodes - if an arc connects them directed or undirected arc - if information only flows in direction of arrow de
Alaska Anch - GEOL - 301
earth sciencethe Origin of theand L Under seatheThe deep basins under the oceans are carpeted with lava that spewed from submarine volcanoes and solidified. Scientists have solved the mystery of how, precisely, all that lava reaches the seaflo
CSU Northridge - MLM - 85331
Midwestern State University - EM - 4284
4-H LEADER GUIDECAT PHYSIOLOGYUNIT 3COOPERATIVE EXTENSIONEM4284CONTENTSLesson Questions 1: Introductory Lesson . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2: Vision, Hearing, Respiratory System . . . . . . . . . . . . .
Washington University in St. Louis - CSE - 306
Gran's Guide to SVGA Programming(640 x 480 x 256 colors)-(For more information on all SVGA modes, see: http:/www.osha.igs.net/~dandelong/nw/index.htm)Due to the VESA standards, SVGA is pretty simple to do.The screen is setup as if it were mult
Washington University in St. Louis - CS - 577
CS/EE 577 - Homework 2Due 10/10/001. Derive the equations for the mean and variance of the geometric distribution, by applying the definitions given in the notes. Show that if x and y are geometric random variables with parameters p and q respecti
Penn State - SEF - 5013
Penn State - PUBS - 173
SERIES SUBSCRIPTION ORDER FORMOfficial Use OnlyReceived Initials SourceAccount Number (from mailing label) Name StreetSydn ey Danc e CoCitymp an y GRA NDState EveningZIPPhone: Day E-mailMay we add you to our marketing and commu
Penn State - SMK - 5085
Syracuse - PHY - 351
DAQ6023E/6024E/6025E User ManualMultifunction I/O Devices for PCI, PXI , CompactPCI, and PCMCIA Bus Computers6023E/6024E/6025E User ManualDecember 2000 Edition Part Number 322072C-01Support Worldwide Technical Support and Product Information n
U. Memphis - FIR - 7721
Determination of Forward and Futures PricesChapter 5Options, Futures, and Other Derivatives 6th Edition, Copyright John C. Hull 20055.1Consumption vs Investment Assets Investmentassets are assets held by significant numbers of people purel
U. Memphis - FIR - 7721
Interest RatesChapter 4Options, Futures, and Other Derivatives 6th Edition, Copyright John C. Hull 20054.1Types of Rates Treasuryrates LIBOR rates Repo ratesOptions, Futures, and Other Derivatives 6th Edition, Copyright John C. Hull 2
U. Memphis - FIR - 7721
Wiener Processes and It's LemmaChapter 12Options, Futures, and Other Derivatives, 6th Edition, Copyright John C. Hull 2005Types of Stochastic Processes Discretetime; discrete variable Discrete time; continuous variable Continuous time; dis
U. Memphis - FIR - 7721
Options on Stock Indices, Currencies, and FuturesChapter 14Options, Futures, and Other Derivatives, 6th Edition, Copyright John C. Hull 200514.1European Options on Stocks Providing a Dividend YieldWe get the same probability distribution for
U. Memphis - FIR - 7721
Hedging Strategies Using FuturesChapter 3Options, Futures, and Other Derivatives 6th Edition, Copyright John C. Hull 20053.1Long &amp; Short HedgesAlong futures hedge is appropriate when you know you will purchase an asset in the future and wa
U. Memphis - FIR - 7721
The Greek LettersChapter 15Options, Futures, and Other Derivatives, 6th Edition, Copyright John C. Hull 200515.1ExampleA bank has sold for $300,000 a European call option on 100,000 shares of a nondividend paying stock S = 49, K = 50, r = 5
Auburn - ELEC - 4200
KCPSM38-bit Micro Controller for Spartan-3, Virtex-II and Virtex-IIPROFor Spartan-II(E) and Virtex(E) please use KCPSM Virtex-II and Virtex-IIPro are also supported by KCPSM2Ken Chapman Xilinx Ltd October 2003Rev.7ContentsUnderstanding KCPSM
WVU - RESM - 440
The Universal Transverse Mercator (UTM) GridMap ProjectionsThe most convenient way to identify points on the curved surface of the Earth is with a system of reference lines called parallels of latitude and meridians of longitude. On some maps, the
UVA - ASTR - 511
Getting Started with IDLIDL Version 6.0 July, 2003 EditionCopyright Research Systems, Inc. All Rights Reserved0703IDL60GSRestricted Rights NoticeThe IDL, ION ScriptTM, and ION JavaTM software programs and the accompanying procedures, functio
Ole Miss - CS - 490
EActiveState PerlE.1 IntroductionWhile Perl was initially developed on the UNIX platform, it was always intended to be a cross-platform computer language. ActivePerl is a version of Perl for Windows. The latest version of ActivePerl, the Perl 5.6
UGA - BCMB - 8020
REVIEWAssembly of Cell Regulatory Systems Through Protein Interaction DomainsTony Pawson1,2* and Piers Nash1 The sequencing of complete genomes provides a list that includes the proteins responsible for cellular regulation. However, this does not i
Montana - MB - 437
JOURNAL OF VIROLOGY, Aug. 2000, p. 70797084 0022-538X/00/$04.00 0 Copyright 2000, American Society for Microbiology. All Rights Reserved.Vol. 74, No. 15A Hypothesis for DNA Viruses as the Origin of Eukaryotic Replication ProteinsLUIS P. VILLARR
UCSB - ECE - 124
Errata for the Dally/Poulton &quot;Digital Systems Engineering&quot; Text.This list compiled by Fred Rosenberger (fred@cse.wustl.edu, http:/www.cse.wustl.edu/~fred ) as an aid to anyone using the Dally/Poulton text. I expect some of the &quot;errors&quot; reported here
N.C. State - CSC - 405
&quot;&quot; % &amp;' () ' '$#! $# *'+ ,+-+./, # '34 ! ! ! ! &quot; ! #$ '34 3 2 '34 6 $ 0 1 ! 5, % % &amp; !07 .1,'
CSU Bakersfield - FIN - 600
18 - 1Distributions to Shareholders: Dividends and Repurchases Theories of investor preferences Signaling effects Residual model Dividend reinvestment plans Stock dividends and stock splits Stock repurchasesCopyright 2002 by Harcourt Inc. A
CSU Bakersfield - FIN - 600
13 - 1CHAPTER 13The Basics of Capital Budgeting: Evaluating Cash FlowsShould we build this plant?Copyright 2002 Harcourt, Inc.All rights reserved.13 - 2What is capital budgeting? Analysis of potential additions to fixed assets. Long-t
CSU Bakersfield - FIN - 600
20 - 1CHAPTER 20Lease Financing Types of leases Tax treatment of leases Effects on financial statements Lessee's analysis Lessor's analysis Other issues in lease analysisCopyright 2002 Harcourt, Inc. All rights reserved.20 - 2Who are t
CSU Bakersfield - FIN - 600
24 - 1CHAPTER 24Derivatives and Risk Management Risk management and stock value maximization. Derivative securities. Fundamentals of risk management. Using derivatives to reduce interest rate risk.Copyright 2002 Harcourt, Inc. All rights res
CSU Bakersfield - FIN - 600
12 - 1CHAPTER 12Corporate Valuation and ValueBased Management Corporate Valuation Value-Based Management Corporate GovernanceCopyright 2002 Harcourt, Inc.All rights reserved.12 - 2Corporate Valuation: List the two types of assets that
CSU Bakersfield - FIN - 600
10 - 1CHAPTER 10Stocks and Their Valuation Features of common stock Determining common stock values Efficient markets Preferred stockCopyright 2002 Harcourt, Inc. All rights reserved.10 - 2Facts about Common Stock Represents ownership.
Nevada - BADM - 720
JOHN S. HAMMONDLearning by the Case MethodSimply stated, the case method calls for discussion of real-life situations that business executives have faced. Casewriters, as good reporters, have written up these situations to present you with the in
UNC - MATH - 524
1 10.8 0.80.6 0.60.4 0.40.2 0.2-20 -20 -10 10 20-101020-0.2 -0.2Figure 1: Original function: f (x) =sin x x.Figure 2: Approximation by the Taylor polynomial of order 2110.80.80.60.60.40.40.20.2-20-101
UNC - MATH - 383
Math 302 - Dierential Equations (Metcalfe)Summer 2001 June 18, 2001Method of Undetermined Coecients (Section 3.6, 4.3) When: Use this technique to solve linear nonhomogeneous equations when the forcing term consists of combinations of polynomials,
UNC - MATH - 383
Math 302 - Dierential Equations (Metcalfe)Summer 2001 June 5, 2001Reduction of Order When: We know that the general solution of a second-order, linear homogeneous dierential equation consists of two independent pieces. If we know one of these two
UNC - MATH - 383
Math 302 - Dierential Equations (Metcalfe)Summer 2001 June 3, 2001Solving Linear, Homogeneous Second-Order Equations with Constant Coecients (Sections 3.1,3.4 When: Use this technique for linear homogeneous second-order equations with constant coe
UNC - MATH - 383
Math 302 - Dierential Equations (Metcalfe)Summer 2001 May 30, 2001Solving First Order Linear Equations using Integrating Factors (Section 2.1) When: Use this technique for rst-order linear equations. What: We will multiply the entire equation by a
UNC - MATH - 383
Math 302 - Dierential Equations (Metcalfe)Summer 2001 June 1, 2001Solving Exact Dierential Equations (Section 2.6) When: Use this technique for rst-order exact equations. If you write your rst-order (ordinary) dierential equation in the form M (x,
UNC - MATH - 383
Math 302 - Dierential Equations (Metcalfe)Summer 2001 June 26, 2001Series Solutions Near an Ordinary Point (Section 5.2) When: This technique can be used to solve linear homogeneous dierential equations near an ordinary point. It can, also, be use
UNC - MATH - 383
Math 302 - Dierential Equations (Metcalfe)Summer 2001 June 18, 2001Solving Euler Equations (Section 5.5) When: Use this technique for second order Euler equations. With a little work, these techniques can be extended to higher order Euler equation
UNC - MATH - 383
Math 302 - Dierential Equations (Metcalfe)Summer 2001 June 18, 2001Variation of Parameters (Section 3.7, 4.4) When: Use this technique to solve linear nonhomogeneous equations (usually when the forcing terms do not meet the conditions for method o
UNC - COMP - 832
UVA - CS - 662
Query by Image The QBIC SystemMyron Flickner, Harpreet Sawhney, Wayne Niblack, Jonathan Ashley, Qian Huang, Byron Dom, Monika Gorkani, Jim Hafher, Denis Lee, Dragutin Petkovie, David Steele, and Peter YankerZBMAlmaden Research Centericture yourse
Illinois State - CHE - 232
Chapter 5 Sheet 2Assigning Configurations1) Indicate whether the chiral centers in the following molecules are R or S.a) H OH Br b) c) H H H d) Br He) Hf) HHg)HOH h) HBr CH 3 Br H IHi)j) H Hk)Hl) HH H HH m) Br H HO H
Illinois State - CHE - 232
Chapter 11Bonus Sheet (Reaction Fun!) #21) Show all the products for the following reactions.a) CH3O-Clb)CH3OHOHH2SO4 c)OHH2SO4 d)CH3 Bre)CH3CH2OCH3CH2OH H2SO4 CH3CH3 OHCH3CH3f)ICH3CH2OCH3CH2OH
Illinois State - CHE - 232
Chapter 7 Sheet 4Alkenes from Haloalkanes/E2 Reactions1) Show all the products for the following E2 reactions and, where possible, indicate the one that will be the major product.Bra) CH3CH2OCH3CH2OHb)ClCH3CH2OCH3CH2OHc)CH3O-ClCH3O
Illinois State - CHE - 232
Chapter 11 Sheet 4Alkenes from Alcohols (Revisited!)1) Show all the products for the following elimination reactions and, where possible, indicate the one that will be the major product. (Do not worry about carbocation rearrangement!)OHa) H2SO4
University of Illinois, Urbana Champaign - CS - 598
NVIDIA CUDA Compute Unified Device ArchitectureProgramming GuideVersion 1.06/23/2007iiCUDA Programming Guide Version 1.0Table of ContentsChapter 1. Introduction to CUDA. 1 1.1 1.2 1.3 2.1 2.2 The Graphics Processor Unit as a Data-Paralle
University of Illinois, Urbana Champaign - ECE - 391
Computer Engineering IIJanuary 2003 Laboratory NotesThe ECE 291 Documentation ProjectDepartment of Electrical and Computer EngineeringUniversity of Illinois at Urbana-ChampaignEdited byPeter L. B. JohnsonJanuary 2003 Laboratory Notes by
University of Illinois, Urbana Champaign - STAT - 426
Berkeley - EE - 122
TCP Vegas: New Techniques for Congestion Detection and Avoidance Lawrence S. BrakmoSean W. OMalley Department of Computer Science University of Arizona Tucson, AZ 85721Larry L. PetersonAbstractVegas is a new implementation of TCP that achie
Minnesota - AVER - 0050
Gateway A - Answers1. g (x) = x + 1 x-3/2 8 2. h (t) = 4e4t-8 - 3. f (x) = 4. f (x) = 1 (24t2 2 8t3 -2t+1- 2)1 (-3(2x2 (5-3x)(2x2 +0.7) 3 1-9x2+ 0.7) + (-3x + 5)4x)-0.36x3 1+0.0009x85. f (x) = 4 (sin(4x3 - 8) - 5x)1/3 (12x2 cos(4x3 - 8
Minnesota - AVER - 0050
Gateway C1. g(x) =ex7/3 +x-2/3 -0.08x2/3 . x2/3Simplify your answer.2. f (t) =36.8 + e2t +3t3 + t2 - t3. g(x) = lnx3 + x2 - x4. g(x) = arctan(x/7) - arcsin(5x2 )5. h(x) = [cos(3x2 + x) + ex ]886. g(x) =x ln(x2 ) 2+x1/2
Midwestern State University - EM - 2778
EM2872 Washington 4-H Natural Resources ProjectOUTDOOR SURVIVALa guide for leadersP ERCOOPERATIVE EXTENSIONCOOATIVE EXTENSI ONWASH ING TO NS TATE UNIVER SITY1This publication prepared by Roger Easton, teacher in Nort
Midwestern State University - EM - 2778
EM46904 -H SUPP L E M E N TAL M ATE RI AL4-H CEREMONIESINITIATION CEREMONYOne way to welcome new members at the first meeting and to make them feel a part of the group is to have an initiation ceremony. It acquaints the members and their parent
Midwestern State University - C - 0809
C0809DAIRY RECORDAdd this sheet to your regular 4-H Record Book. Keep all your records in one book.Project enrollment numberDAIRY PROJECT INVENTORYBeginning of Project Year Date List all project animals, feed, equipment, etc., you own at beg