# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

35 Pages

Course: MATH MATH 221, Winter 2009
School: DeVry Portland
Rating:

Word Count: 3185

#### Document Preview

each Questions: Work question, using Excel where appropriate. Remember, each gestation period is its own normal distribution. Thus, you will need to change the &quot;mean&quot; and &quot;standard deviation&quot; to reflect the question you are answering. 2. What percent of the babies born with each gestation period have a low birth weight (under 5.5 pounds)? a. under 28 weeks b. 32 to 35 weeks c....

Register Now

#### Unformatted Document Excerpt

Coursehero >> Oregon >> DeVry Portland >> MATH MATH 221

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.
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:

San Jose State - EE - 271
SAN JOSE STATE UNIVERSITY Charles W. Davidson College of EngineeringDEPARTMENT OF ELECTRICAL ENGINEERING EE271 Homework #1 1. Find ( a b ) + ( a ' b ) + ( a b ' ) + ( a ' b ' ) 2. Show that a = b if and only if (a.b) + (a.b) = 0 3. Find the complement of
San Jose State - EE - 271
SAN JOSE STATE UNIVERSITY Charles W. Davidson College of EngineeringDEPARTMENT OF ELECTRICAL ENGINEERING EE271 Homework #2 1. Write the logic tables and canonical Boolean expressions of the RS-, D-, T-, and JK-flipflops and then minimize these canonical
San Jose State - EE - 271
SAN JOSE STATE UNIVERSITY Charles W. Davidson College of EngineeringDEPARTMENT OF ELECTRICAL ENGINEERINGEE271Homework #3 Solution Problem 1 module tr_latch (q_out, enable, data); output q_out; input enable, data; reg q_out; always @ (enable or data) be
San Jose State - EE - 271
SAN JOSE STATE UNIVERSITY Charles W. Davidson College of EngineeringDEPARTMENT OF ELECTRICAL ENGINEERINGEE271Homework #4 1. For the circuit Y = ( A + D ) ( DBC ) a. Write a gate-level Verilog code and its testbench. b. Write a Verilog code with user de
San Jose State - EE - 271
SAN JOSE STATE UNIVERSITY Charles W. Davidson College of EngineeringDEPARTMENT OF ELECTRICAL ENGINEERINGEE271Homework #5 1. A circuit represented by Boolean equation below: (A AND B) OR (A AND C) OR (B AND C) a. If all gates are 2-input gates: show the
San Jose State - EE - 271
SAN JOSE STATE UNIVERSITY Charles W. Davidson College of EngineeringDEPARTMENT OF ELECTRICAL ENGINEERINGEE271Homework #6 Create a directory named HW6 and a subdirectory src on your UNIX account. Write a Verilog module for a16-bit ripple carry adder (co
San Jose State - EE - 271
SAN JOSE STATE UNIVERSITY Charles W. Davidson College of EngineeringDEPARTMENT OF ELECTRICAL ENGINEERINGEE271Homework #7 1. An addition circuit running at 100MHz with a supply voltage of 3V. Assume that on the average each node change states (from 0 to
San Jose State - EE - 271
SAN JOSE STATE UNIVERSITY Charles W. Davidson College of EngineeringDEPARTMENT OF ELECTRICAL ENGINEERINGEE271Homework #8 1. Derive the formula of mapping explicit values to an implicit value of an integer in one's complementary system: X i = 2n 1 + X e
San Jose State - EE - 271
SAN JOSE STATE UNIVERSITY Charles W. Davidson College of EngineeringDEPARTMENT OF ELECTRICAL ENGINEERINGEE271Homework #9 1. For the 3 memory module below (may not work because they are not yet tested) Develop test benches to test them and correct the m
San Jose State - EE - 271
San Jose State - EE - 271
SOLUTION FOR QUESTION 1 OF HW #9 1. 16 x 8-bit Asynchronous SRAM `define DELAY 1 module Ram (data, address, memw, memr, cs); parameter width = 8, nbytes = 16, addr = 4; input memw, memr, cs; input [addr-1:0] address; inout [width-1:0] data; reg [width-1:0
San Jose State - EE - 210
SOLUTION 001Write analytical expression for the continuous-time waveform f ( t ) , shown in below figure.f (t ) 3-3SOLUTION 1:-157tP = ( x1 = -3, y1 = 0 ) P2 = ( x2 = -1, y1 = 3) 1f (t ) - 0 = 3-0 3 ( t - (-3) ) = ( t + 3) u ( t + 3) 2 -1 - ( -3
San Jose State - EE - 210
PROBLEM 001PROBLEM 1: Write analytical expression for the continuous-time waveform f ( t ) , shown in below figure.f (t ) 3-3-157t1PROBLEM 002PROBLEM 2: Write analytical expression for the continuous-time waveform f ( t ) , shown in below figure
San Jose State - EE - 210
EE 210Problem 1:CT Convolution Sample ProblemSpring 2004Consider the following two continuous time (CT) signals x1 ( t ) and y1 ( t )x1 ( t )2 1 -1 0 1 2 3 4 5 6 7 2ty1 ( t )2 1 -1 0 1 2 3 1 24567tThe signal v1 ( t ) is defined as the convo
San Jose State - EE - 270
EE270 Spring 2008 Homework #1 1) Prove the following relation using only fundamentals of Boolean a. (x+y) (x+z) = x'. ( y z)b. (ab)' = a'+b' 2) Express in DCF and CCF a. ab + a'c + bd b. (x+y+z)(x'+y') 3) Show that the following function is self dual a.
San Jose State - EE - 270
HW#2EE270 Spring 20081. Determine minimum SOP form of the following: a) F(A,B,C,D) = m (4,7,9,15) + d (1,2,3,6) b) F(A,B,C,D) = F(A,B,C,D) = m (0,2,3,4,5) + d (8,9,10,11)2. Determine POS form for the following: a) F(A,B,C,D) = M( 4,7,9,11,12). D(0,1,2,
San Jose State - EE - 270
Homework4 1. DesignafundamentalmodecircuitasdescribedusingNORgatesonly a. Itisatwoinput,oneoutputdevice(x1,x2,z) b. Whenx2=1,z=0 c. Thefirstchangex1from0to1whilex2=0causetheoutputztobe1 d. Theoutputwouldremain1untilx2goesto1,forcingzto0 2. Obtainaprimitiv
Berkeley - CS - 61B
01/21/09 18:40:54CS 61B: Lecture 1 Wednesday, January 21, 2009 Prof. Jonathan Shewchuk, jrs@cory.eecs Email to prof &amp; all TAs at once (preferred): cs61b@cory.eecs Todays reading: Sierra &amp; Bates, pp. 1-9, 18-19, 84. Handout: Course Overview (also availabl
Berkeley - CS - 61B
01/23/09 04:41:09CS 61B: Lecture 2 Friday, January 23, 2009 Todays reading: Sierra &amp; Bates, Chapter 2; pp. 54-58, 154-160, 661, 669.02METHODS = Lets look at some methods that arent constructors. s2 = s1.toUppercase(); -s2 |.+-&gt;| YOW! | -String s3 = s2.
Berkeley - CS - 61B
01/26/09 00:58:44CS 61B: Lecture 3 Monday, January 26, 2009 Todays reading: Sierra &amp; Bates, pp. 71-74, 76, 85, 240-249, 273-281, 308-309.031DEFINING CLASSES = An object is a repository of data. _Fields_ are variables that hold the data stored in objec
Berkeley - CS - 61B
01/28/09 03:52:43CS 61B: Lecture 4 Wednesday, January 28, 2009 Todays reading: S&amp;B pp. 10-14, 49-53, 75, 78-79, 86, 117, 286-287, 292, 660.041a | b | a &amp; b | a | b | !a =|= false | false | false | false | true false | true | false | true | true | fals
Berkeley - CS - 61B
01/30/09 03:02:55CS 61B: Lecture 5 Friday, January 30, 2009 Todays reading: LOOPS = &quot;while&quot; Loops -A &quot;while&quot; statement is like an &quot;if&quot; statement, but the body of the statement is executed repeatedly, as long as the condition remains true. The following e
Berkeley - CS - 61B
02/01/09 05:34:22CS 61B: Lecture 6 Monday, February 2, 2009 Todays reading: MORE ARRAYS = Automatic Array Construction -Last lecture, we used a loop to construct all the arrays that the top-level array references. This was necessary to construct a triang
Berkeley - CS - 61B
02/05/09 02:38:20CS 61B: Lecture 7 Wednesday, February 4, 2009 Todays reading: Goodrich &amp; Tamassia, Section 3.2.071public class ListNode cfw_ public int item; public ListNode next; / ListNode is a recursive type / Here were using ListNode before / we
Berkeley - CS - 61B
02/01/09 05:51:29CS 61B: Lecture 8 Friday, February 6, 2009 Todays reading: Goodrich &amp; Tamassia, Section 3.3.081THE &quot;public&quot; AND &quot;private&quot; KEYWORDS = Thus far, weve usually declared fields and methods using the &quot;public&quot; keyword. However, we can also d
Berkeley - CS - 61B
04/24/09 20:07:04CS 61B: Lecture 9 Monday, February 9, 2009 Todays reading: Sierra &amp; Bates pp. 77, 235-239, 258-265, 663.091THE STACK AND THE HEAP = Java stores stuff in two separate pools of memory:Parameter Passing -As in Scheme, Java passes all pa
Berkeley - CS - 61B
02/11/09 23:25:02CS 61B: Lecture 10 Wednesday, February 11, 2009 Todays reading: Sierra &amp; Bates, pp. 95-109, 662.101Modular testing: testing each method and each class separately. Integration testing: testing a set of methods/classes together. Result
Berkeley - CS - 61B
02/16/09 18:36:38CS 61B: Lecture 11 Friday, February 13, 2009 Todays reading: All of Chapter 7, plus pp. 28-33, 250-257.111public TailList(int x) cfw_ super(x); tail = null; The zero-parameter SList() constructor is always called by default, regardle
Berkeley - CS - 61B
02/16/09 18:08:41CS 61B: Lecture 12 Wednesday, February 18, 2009 Todays reading: Sierra &amp; Bates, Chapter 8.121public void listSort(List l) cfw_ . ABSTRACT CLASSES = An abstract class is a class whose sole purpose is to be extended. public abstract cl
Berkeley - CS - 61B
02/19/09 20:33:40CS 61B: Lecture 13 Friday, February 20, 2009 Todays reading: Sierra &amp; Bates, pp. 154-160, 587-591, 667-668.131| | | | | | | | /* list/SListNode.java */ package list; class SListNode cfw_ Object item; SListNode next; JAVA PACKAGES = I
Berkeley - CS - 61B
02/25/09 16:25:41CS 61B: Lecture 15 Wednesday, February 25, 2009 Todays reading: Sierra &amp; Bates, pp. 315-338.151EXCEPTIONS = When a run-time error occurs in Java, the JVM &quot;throws an exception,&quot; and the result is an error message. Oddly, an exception i
Berkeley - CS - 61B
02/28/09 19:50:15CS 61B: Lecture 16 Friday, February 27, 2009 Todays reading: Sierra &amp; Bates, pp. 189, 283.161EXCEPTIONS (continued) = The &quot;finally&quot; keyword -A finally clause can also be added to a &quot;try.&quot; try cfw_ statementX; return 1; catch (SomeExc
Berkeley - CS - 61B
CS 61B: Lecture 17 Monday, March 2, 2009 Game tree search How could we design a program that plays Tic Tac Toe? The standard technique searches for the best moves by using a game tree, which looks much like a family tree. A game tree is not a data structu
Berkeley - CS - 61B
03/04/09 20:28:41CS 61B: Lecture 18 Wednesday, March 4, 2009 Todays reading: Sierra &amp; Bates, pp. 80-84.181ENCAPSULATION = A _module_ is a set of methods that work together as a whole to perform some task or set of related tasks. A module is _encapsula
Berkeley - CS - 61B
03/06/09 19:03:10CS 61B: Lecture 19 Friday, March 6, 2009 Todays reading: Sierra &amp; Bates, p. 664.19(3) What happens if we invoke l.remove(n), then l.insertAfter(i, n)?1Another way to trash the DList invariants is to treat a node thats been removed fr
Berkeley - CS - 61B
03/03/09 14:57:33CS 61B: Lecture 20 Monday, March 9, 2009 Todays reading: Goodrich &amp; Tamassia, Chapter 4 (especially 4.2 and 4.3).20Next, you must learn how to express this idea rigorously. Here is the central lesson of todays lecture, which will bear
Berkeley - CS - 61B
03/03/09 14:57:33CS 61B: Lecture 21 Wednesday, March 11, 2009 ASYMPTOTIC ANALYSIS (continued): More Formalism = |-| | Omega(f(n) is the set of all functions T(n) that satisfy: | | | | There exist positive constants d and N such that, for all n &gt;= N, | |
Berkeley - CS - 61B
02/25/09 22:50:17CS 61B: Lecture 22 Friday, March 13, 2009 Todays reading: Goodrich &amp; Tamassia, Chapter 5.221BASIC DATA STRUCTURES = Stacks -A _stack_ is a crippled list. You may manipulate only the item at the top of the stack. The main operations: y
Berkeley - CS - 61B
03/16/09 22:42:55CS 61B: Lecture 23 Monday, March 16, 2009 Todays reading: Goodrich &amp; Tamassia, Sections 9.1-9.3.231WARNING: When an object is stored in a hash table, an application should never change the object in a way that will change its hash cod
Berkeley - CS - 61B
03/18/09 16:22:59CS 61B: Lecture 24 Wednesday, March 18, 2009 Todays reading: Goodrich &amp; Tamassia, Chapter 7.241ROOTED TREES = A _tree_ consists of a set of nodes and a set of edges that connect pairs of nodes. A tree has the property that there is ex
Berkeley - CS - 61B
03/18/09 21:12:44CS 61B: Lecture 25 Friday, March 20, 2009 Todays reading: Goodrich &amp; Tamassia, Sections 8.1-8.3.251The entries in a heap satisfy the _heap-order_property_: no child has a key less than its parents key. Observe that any subtree of a bi
Berkeley - CS - 61B
03/27/09 18:38:38CS 61B: Lecture 26 Monday, March 30, 2009 Todays reading: Goodrich &amp; Tamassia, Section 10.1.261Representing Binary Trees -Recall that a binary tree is a rooted tree wherein no node has more than two children. Additionally, every child
Berkeley - CS - 61B
03/26/09 22:43:22CS 61B: Lecture 27 Wednesday, April 1, 2009 2-3-4 TREES = A 2-3-4 tree is a perfectly balanced tree. It has a big advantage over regular binary search trees: because the tree is perfectly balanced, find, insert, and remove operations tak
Berkeley - CS - 61B
04/05/09 01:54:57CS 61B: Lecture 28 Friday, April 3, 2009 GRAPHS = A graph G is a set V of vertices (sometimes called nodes), and a set E of edges (sometimes called arcs) that each connect two vertices together. To confuse you, mathematicians often use t
Berkeley - CS - 61B
04/05/09 22:43:28CS 61B: Lecture 29 Monday, April 6, 2009 GRAPHS (continued) = Breadth-first search (BFS) is a little more complicated than depth-first search, because its not naturally recursive. We use a queue so that vertices are visited in order acco
Berkeley - CS - 61B
04/08/09 03:19:43CS 61B: Lecture 30 Wednesday, April 8, 2009 SORTING = The need to sort numbers, strings, and other records arises frequently. The entries in any modern phone book were sorted by a computer. Databases have features that sort the records r
Berkeley - CS - 61B
04/06/09 00:00:57CS61B: Lecture 31 Friday, April 10, 2009 QUICKSORT = Quicksort is a recursive divide-and-conquer algorithm, like mergesort. Quicksort is in practice the fastest known comparison-based sort for arrays, even though it has a Theta(n^2) wors
Berkeley - CS - 61B
04/15/09 00:32:22CS61B: Lecture 33 Wednesday, April 15, 2009 Todays reading: Goodrich &amp; Tamassia, Section 11.6.33List-Based Disjoint Sets and the Quick-Find Algorithm -The obvious data structure for disjoint sets looks like this. - Each set references
Berkeley - CS - 61B
04/15/09 20:34:08CS61B: Lecture 34 Friday, April 17, 2009 Todays reading: Goodrich &amp; Tamassia, Sections 11.3 &amp; 11.7.34A LOWER BOUND ON COMPARISON-BASED SORTING = Suppose we have a scrambled array of n numbers, with each number from 1.n occurring once.
Berkeley - CS - 61B
04/20/09 20:17:40CS 61B: Lecture 36 Monday, April 20, 2009 Counting Sort -If the items we sort are naked keys, with no associated values, bucket sort can be simplified to become _counting_sort_. In counting sort, we dont need queues at all; we need merel
Berkeley - CS - 61B
04/24/09 16:48:00CS61B: Lecture 37 Friday, April 24, 2009 SPLAY TREES = A splay tree is a type of balanced binary search tree. Structurally, it is identical to an ordinary binary search tree; the only difference is in the algorithms for finding, insertin
Berkeley - CS - 61B
04/27/09 18:30:17CS61B: Lecture 38 Monday, April 27, 2009 AMORTIZED ANALYSIS = Weve seen several data structures for which I claimed that the average time for certain operations is always better than the worst-case time. These data structures include has
Berkeley - CS - 61B
04/29/09 23:28:06CS61B: Lecture 39 Wednesday, April 29, 2009 RANDOMIZED ANALYSIS = Randomized analysis, like amortized analysis, is a mathematically rigorous way of saying, &quot;The worst-case running time of this operation is slow, but nobody cares, because
Berkeley - CS - 61B
04/30/09 00:05:23CS61B: Lecture 40 Friday, May 1, 2009 Expression Parsing (an application of stacks) -Arithmetic expressions can be written in prefix, infix, or postfix. Infix is the usual way of writing expressions that were all familiar with: 3 + 4 * 7
Berkeley - CS - 61B
05/04/09 03:52:42CS61B: Lecture 41 Monday, May 4, 2009 GARBAGE COLLECTION = Objects take up space in memory. If your program creates lots of objects, throws them away, and creates more, you might eventually run out of memory. To reduce the chance that th
Berkeley - CS - 61B
05/06/09 18:40:24CS61B: Lecture 42 Wednesday, May 6, 2009 Generational Garbage Collection -Studies of memory allocation have shown that most objects allocated by most programs have short lifetimes, while a few go on to survive through many garbage collec
Berkeley - CS - 61B
01/23/09 04:29:03CS 61B Homework 1 Due 5pm Wednesday, January 28, 2009 This homework assignment is meant to make sure you can write, compile, and run simple Java programs. This is an individual assignment; you may not share code with other students. You
Berkeley - CS - 61B
01/29/09 03:22:24CS 61B Homework 2 Due 5pm Wednesday, February 4, 2009 This homework assignment is designed to help you learn about building Java classes and to observe the decomposition of a complicated task into simple subtasks. This is an individual a
Berkeley - CS - 61B
02/07/09 19:53:10CS 61B Homework 3 Due 5pm Wednesday, February 11, 2006 This homework assignment is designed to give you practice working with arrays, linked lists, and nested loops. It will also give you practice for the similar but harder run-length en
Al Akhawayn University - FINANCE - fin 3301
FIN 3301 Homework # 1 Due: Monday, February 22Name_Show all your work. Time lines, formulas, and inputs to your financial calculator as needed. Problem # 1 Suppose a government bond will pay \$1,000 three years from now. If the going interest rate on 3-y
Al Akhawayn University - SBA - fin3301
CHAPTER 5Time Value of MoneyTopics Covered Time lines Future Values and Compound Interest Present Values Multiple Cash Flows Level Cash Flows Perpetuities and Annuities Effective Annual Interest Rates Inflation &amp; Time ValueTime lines0I%1 CF12 CF2