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

1 Page

### 10-11

Course: MATH 240, Fall 2009
School: Hendrix
Rating:

Word Count: 283

#### Document Preview

8, Assignment Math 240, Fall 2005 Due: 2:45pm, October 11. Value: 30 pts. On all questions, here and elsewhere, you can feel free to express answers as a simple expression without writing down the specic number; for example, if the answer is 2 100 C(100, 3), you can write that rather than attempt to compute the number. However, your answer should always be as simple as possible, and it should always involve only...

Register Now

#### Unformatted Document Excerpt

Coursehero >> Arkansas >> Hendrix >> MATH 240

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.
8, Assignment Math 240, Fall 2005 Due: 2:45pm, October 11. Value: 30 pts. On all questions, here and elsewhere, you can feel free to express answers as a simple expression without writing down the specic number; for example, if the answer is 2 100 C(100, 3), you can write that rather than attempt to compute the number. However, your answer should always be as simple as possible, and it should always involve only well-known mathematical functions. In all cases, you should justify your answer: Never write just a number or an expression. Without a justication, I will give you zero credit, even if the answer is correct. Based on September 29 material (4.1) Problem A. How many strings of n bits are there where every 1 bit is followed by a 0 bit? Problem B. How many strings of 10 bits have either 0 bits in the rst, third, fth, seventh, ninth and places, or 0 bits in the rst, fourth, seventh, and tenth places. Problem C. Suppose we have a set of six tiles labeled as listed below. How many different six-letter strings can be formed using the tiles? a. b. O,H,D,E,A,R. O,H,D,E,E,R. (Hint: Think about the list of all possible orderings, and think about how often an ordering is a duplicate of another.) Based on October 4 material (4.2) Problem D. 4.2 (p 319): 8. Problem E. 4.2 (p 319): 32. Problem F. 4.2 (p 319): 36. Knowing is mutual; that is, if I know somebody, then that person also knows me. Based on October 6 material (4.3) Problem G. How many strictly increasing sequences of three integers between 1 and 100 (inclusive) are there? Problem H. 4.3 (p 325): 26abc. In parts a and c, take the eld means that we dont care which positions the individual players take.
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:

Hendrix - CS - 360
Questions 1 Question 13.21: (Solution, p 3) Dene a Scheme function that takes an integer n as a parameter and returns 2n , using only multiplication. Question 13.22: (Solution, p 3) Dene a Scheme function that computes the nth Fibonacci number in O(n
Hendrix - CS - 360
Questions 1 Question 45: (Solution, p 5) Say you are to prove the following using our axiomatic scheme.{n = 2k and k 0} i := 0; j := n; while j &gt; 1 loop j := j / 2; i := i + 1; end loop; {n = 2i }What is the loop invariant that will allow you to
Hendrix - CS - 151
CSci 151, 27 Oct 2008public static int fact(int n) { if(n = 0) { return 1; } else { return n * fact(n - 1); } } public static int fib(int n) { if(n &lt;= 1) { return n; } else { return fib(n - 1) + fib(n - 2); } }class Frame { public int state; publi
Hendrix - ASSN - 330
Assignment 4, CSci 330, Fall 2006Due: Nov 3, 2:10pm. Value: 40 pts. From the course Web page you can download a Java program designed for simulating network protocols. The program consists of the following classes. Wire simulates a wire that transmi
Hendrix - ASSN - 4
Assignment 4, CSci 330, Fall 2006Due: Nov 3, 2:10pm. Value: 40 pts. From the course Web page you can download a Java program designed for simulating network protocols. The program consists of the following classes. Wire simulates a wire that transmi
Hendrix - ASSN - 330
Assignment 2, CSci 330, Fall 2006Due: Sep 15, 2:10pm. Value: 40 pts. Hasbro has decided to build a new version of its Simon product line using an FPGA, and has hired you to build the Display module for this new product. (If this goes well, then they
Hendrix - CS - 330
Question Q11: (Solution, p 2) Distinguish between a load-store instruction set (such as x86) and a memory-register instruction set (such as MIPS). What are their relative performance advantages in todays technology? Question Q12: (Solution, p 2) Writ
Hendrix - CS - 330
Question Mid1: (Solution, p 2) What are the two basic models for communication in multiprocessor systems? Question Mid2: (Solution, p 2) Name and explain two advantages of shared memory over message passing. Question Mid3: (Solution, p 2) Name and ex
Hendrix - CS - 330
Question Fin1: (Solution, p 2) What are the ve layers of the network stack as studied in this class? Question Fin2: (Solution, p 2) What is the function of the Transport layer? Question Fin3: (Solution, p 2) According to Nyquists theorem, what is the
Hendrix - CS - 330
Solutions, CSci 330, Fall 2006, Midterm1. A load-store instruction set has many instructions that combine a memory access with another operation, such as an add or branch. By contrast, the only instructions in a memory-register instruction set that
Hendrix - ASSN - 330
Assignment 1, CSci 330, Fall 2006Due: Sep 1, 2:10pm. Value: 40 pts. The strstr C function searches for a substring within a bigger string. Suppose, for example, that a program calls strstr(&quot;nefarious&quot;, &quot;far&quot;); the function should return the the addr
Hendrix - CS - 330
CSci 330, Fall 2006, MidtermName: 1. [10 pts] Distinguish between a load-store instruction set (such as x86) and a memory-register instruction set (such as MIPS). What are their relative performance advantages in todays technology?2. [8 pts] The M
Hendrix - CS - 330
Solutions, CSci 330, Fall 2006, Quiz 21. Without any caller-save registers, a subroutine that needs a register for temporary computation (without any intervening subroutine calls) would need to save that register onto the stack and restore it. This
Hendrix - CS - 330
CSci 330, Fall 2006, Quiz 2Name: 1. [10 pts] The MIPS calling convention includes some caller-save registers, such as \$t0 and \$t1, whereas the calling conventions for the 8080 and the IA-32 have no caller-save registers. Explain why caller-save regi
Hendrix - CS - 330
Solutions, CSci 330, Fall 2006, Final1. A memory-register instruction set has many instructions that combine a memory access with another operation, such as an add or branch. By contrast, the only instructions in a load-store instruction set that ac
Hendrix - PROJ - 330
Project 2, CSci 330, Fall 2006Due: Oct 4, 2:10pm. Value: 60 pts. Note: You may work with another student on this project if you please; if so, you should submit your project jointly. Submit your code solution (the OutOfOrder class only) by e-mail to
Hendrix - PROJ - 330
Project 3, CSci 330, Fall 2006Due: Dec 1, 2:10pm. Value: 60 pts. Your assignment is to experiment with conict resolution schemes and to write a summary of what you found, including an English description of your best algorithm and statistics regardi
Hendrix - PROJ - 330
Project 1, CSci 330, Fall 2006Due: Sep 8, 2:10pm. Value: 60 pts. Suppose we represent a binary tree of nonnegative integers, where each node has the node value in the rst four bytes, the left nodes address in the next four bytes, and the right nodes
Hendrix - ASSN - 330
Assignment 3, CSci 330, Fall 2006Due: Oct 27, 2:10pm. Value: 40 pts. The attached paper, Evaluating the performance of four snooping cache coherency protocols, is by Susan Eggers and Randy Katz. It was rst published as part of the 1989 International
Hendrix - CS - 360
Questions 1 Question 163: (Solution, p 2) Explain why it is a poor idea to use a Haskell list to represent the Queue abstract data type, where the front of the queue is the same as the front of the list. Question 164: (Solution, p 2) Describe a data
Hendrix - CS - 360
Evaluating language efciencyCarl Burch, CSCI 360 December 11, 2004I was generally disappointed with the efciency of the programs students benchmarked for the project, which made it difcult to evaluate results. After looking over programs and papers
Hendrix - CS - 360
Midterm, CSCI 360, Fall 2004Name: 1. [10 pts] Using BNF notation, describe a context-free grammar for the language of strings consisting of a sequence of as, followed by bs, followed by cs, in which there are as many cs as there are as and bs put to
Hendrix - CS - 490
Questions 1 Question Midterm1: (Solution, p 2) Explain a reason why the painters algorithm for handling occlusion, in which objects are drawn starting from the farthest away, does not work well for general 3D rendering. Question Midterm2: (Solution,
Hendrix - ASSN - 4
CSci 490, Spring 2005, Assignment 4This assignment, worth 40 points, is due at 3pm, Friday, February 18. Submit it by attaching your modied les to an e-mail to cburch@cburch.com. Your job in this assignment is to write a program using OpenGL that ge
Hendrix - ASSN - 490
CSci 490, Spring 2005, Assignment 4This assignment, worth 40 points, is due at 3pm, Friday, February 18. Submit it by attaching your modied les to an e-mail to cburch@cburch.com. Your job in this assignment is to write a program using OpenGL that ge
Hendrix - ASSN - 490
CSci 490, Spring 2005, Assignment 5This assignment, worth 50 points, is due at 3pm, Friday, March 4. Submit it by attaching your modied les to an e-mail to cburch@cburch.com. In Assignment 3, you modied a Java graphics system that drew wire-frame dr
Hendrix - ASSN - 490
CSci 490, Spring 2005, Assignment 7This assignment, worth 40 points, is due at 3pm, Friday, April 29. Submit it by attaching your modied les to an e-mail to cburch@cburch.com. From the Web page, you can download a simple OpenGL program that uses a p
Hendrix - ASSN - 7
CSci 490, Spring 2005, Assignment 7This assignment, worth 40 points, is due at 3pm, Friday, April 29. Submit it by attaching your modied les to an e-mail to cburch@cburch.com. From the Web page, you can download a simple OpenGL program that uses a p
Hendrix - CS - 490
Quiz 1, CSci 490, Spring 2005Name: 1. [6 pts] Suppose we are performing a perspective projection onto a vertical screen one foot square which is two feet away from the eye. Forty feet away in the same direction, there is a wall ten feet high. If the
Hendrix - CS - 490
CSci 490, Spring 2005, Quiz 3Name: 1. [7 pts] Explain the goal motivating Gouraud shading (i.e., the reason for it), and describe the technique that it involves.2. [7 pts] Outline the compression algorithm used for the PNG image format.3. [8 pts
Hendrix - CS - 490
Questions 1 Question Q11: (Solution, p 2) How is it that nearly any light frequency distribution can be represented exactly using a combination of only three particular light frequencies (red, green, blue)? Question Q12: (Solution, p 2) In terms of t
Hendrix - CS - 490
CSci 490, Spring 2005, MidtermName: 1. [7 pts] Distinguish between the terms raster graphics and vector graphics, and for each, give a specic example of graphical system using it.2. [8 pts] Explain what the homogeneous coordinate system are, and e
Hendrix - CS - 490
Solutions, CSci 490, Spring 2005, Quiz 31. Curved surfaces are most easily represented in most systems with a polygon approximation, but rendering the polygon surfaces shows sharp shading differences if the polygons are relatively large, destroying
Hendrix - CS - 490
Solutions, Quiz 1, CSci 490, Spring 20051. 100 pixels. [The projection of the wall onto the screen would be 1/2 a foot, since the distance:height ratio would be the same both for the wall (40:10) and for the projection of the wall onto the screen (2
Hendrix - CS - 490
CSci 490, Spring 2005, Quiz 1Name: 1. [6 pts] Suppose we are performing a perspective projection onto a vertical screen one foot square which is one foot away from the eye. Eighty feet away in the same direction, there is a wall ten feet high. If th
Hendrix - CS - 490
Questions 1 Question Q21: (Solution, p 2) What is the motivation behind generalizing homogeneous coordinates to allow the last entry to be other than 1? Question Q22: (Solution, p 2) Explain the concept of Gouraud shading. Question Q23: (Solution, p
Hendrix - ASSN - 490
CSci 490, Spring 2005, Assignment 1This assignment, worth 40 points, is due at 3pm, Friday, January 28. Submit it by attaching your modied les to an e-mail to cburch@cburch.com. This assignment involves writing two important pieces to a rather sophi
Hendrix - ASSN - 490
CSci 490, Spring 2005, Assignment 3This assignment, worth 30 points, is due at 3pm, Friday, February 11. Submit it by attaching your modied les to an e-mail to cburch@cburch.com. From the Web page you can download a set of Java classes that implemen
Hendrix - ASSN - 490
CSci 490, Spring 2005, Assignment 6This assignment, worth 40 points, is due at 3pm, Friday, April 8. Submit it by attaching your modied les to an e-mail to cburch@cburch.com. You can download the base code from the course Web page, which implements
Hendrix - ASSN - 6
CSci 490, Spring 2005, Assignment 6This assignment, worth 40 points, is due at 3pm, Friday, April 8. Submit it by attaching your modied les to an e-mail to cburch@cburch.com. You can download the base code from the course Web page, which implements
Hendrix - CS - 360
CSci 360, Fall 2004, Assignment 9This assignment, worth 40 points, is due Wednesday, November 10, at the beginning of class. You should submit a paper copy of your lambda expressions to my ofce or at the beginning of class. For this assignment, I re
Hendrix - CS - 280
CSci 280, Spring 2009, Exam 1This take-home exam is due Friday, February 13, at 4pm. You should submit your solution on paper, either handwritten or typed. E-mailed solutions will not be accepted. Answer only four of the following ve problems. If yo
Hendrix - CS - 210
Questions 1 Question 8.11: (Solution, p 3) Name at least two generic purposes of an operating system. Question 8.12: (Solution, p 3) One way of receiving a response from a device is to poll it periodically about whether it has any additional informat
Hendrix - CS - 210
CSCI 210 Assn. 5: Caching effectsLab note: You may work with up to one other person on this assignment and submit your solution together, or you may work alone. The write-up is due at 5:00pm on Friday, April 30. It is worth 40 points.ObjectivesA
Hendrix - CS - 210
Questions 1 Question 131: (Solution, p 4) Describe the inputs and outputs of a (1-way) they relate.Question 132: (Solution, p 4) In implementing HYMNs control unit, the fetch cycle and the execute cycle each consisted of two clock phases: one phase
Hendrix - CS - 210
Solutions, Quiz 4, CSCI 210, Spring 20041. When skip is 16,384, each access to arr[i] in the inner loop maps to the same set of cache lines, the lines accessed at the beginning of the inner loop will be dropped from the cache as the inner loop conti
Hendrix - CS - 210
Questions 1 Question 7.31: (Solution, p 2) Describe the contents of the object le that is created by the compiler and subsequently given to the linker. Question 7.32: (Solution, p 2) Describe two advantages of dynamic linking (load-time or run-time)
Hendrix - CS - 210
Questions 1 Question 10.21: (Solution, p 5) Dene the following terms as they relate to processes and threads. a. race b. deadlockQuestion 10.22: (Solution, p 5) At right is a class for representing a long-term computation. It attempts to implement
Hendrix - CS - 210
Quiz 4, CSCI 210, Spring 2004Name: 1. [10 pts] Tests on an Intel Pentium III processor reveal that the performance of the code at right depends heavily on the value of skip. skip 16,352 16,384 time 40 ms 480 msSurprisingly, with a larger value of
Hendrix - CS - 210
Questions 1 Question 6.41: (Solution, p 4) In class, we examined an alternative to using a stack for supporting subroutines, where each subroutine would have its own static memory locations for remembering data. For example, consider the following sq
Hendrix - CS - 210
Lab 8: ThreadsObjectivesto gain experience using threads in a program. to understand competitive and cooperative synchronization.You can run getcs to get a minimal template for this assignment, called PrimeCount.java. Write a Java program that
Hendrix - CS - 210
Lab 6: System callsObjectivesTo become more familiar with the Intel x86 assembly language. To practice the use of interrupts for initiating system calls to Linux. To learn about how parameters typed on a command line are given to a program unde
Hendrix - CS - 210
Quiz 3, CSCI 210, Spring 2004Name: 1. [8 pts] At right, complete the Java program so that it runs two threads. One thread should execute the following code to continually update. totalfor(int i = 1; true; i+) total += i; public class Counter extend
Hendrix - CS - 210
Final, CSCI 210, Spring 2004Name: 1. [5 pts] How many bits does a kilobyte contain? 2. [7 pts] Approximate in the form need not be normalized.) 3. [8 pts] In the following function, you can assume that place is a power of two. Complete the functi
Hendrix - CS - 150
Questions1Question Seq1: (Solution, p 2) Tabulate how the circuit at right changes as the input the inputs at left. 0 1 0 1 0 1 0 1 0 1 DQ QQ1 Q0DQ Qck ! ! ! Question Seq2: (Solution, p 2) Design a ci
Hendrix - CS - 150
Questions1Question J81: (Solution, p 3) Explain the difference between using an instance method in a Java program and using a class method. Question J82: (Solution, p 3) Suppose we were to execute the method . for the at right passing array param
Hendrix - CS - 210
Solutions, Final, CSCI 210, Spring 20041. 2.3. return (number &amp; place) != 0; 4.5 7 7 76.This loop has a common subexpression of 10 * n. We can save time by computing we enter the loop, and reusing this result each iteration.int ten_times_n =
Hendrix - CS - 340
Chapter 1Object-oriented featuresThe compilers job for a procedural language like C is relatively straightforward, because C and most other compiled procedural languages have been designed to approximate what the computer does. Other language para
Muskingum - FREN - 04
Muskingum College Modern Language DepartmentSENIOR SEMINAR RESEARCH PRESENTATIONS IN FRENCH Fall, 2004Dec. 1 6:00 PM 125 BoydSenior Seminar ResearchAll Muskingum language majors complete a senior seminar capstone research project in which they
Muskingum - SEMSPN - 04
Keara Baker Spanish Capstone Seminar Abstract Images of Spanish Women in the Novels El cuarto de atrs and El embrujo de ShanghaiThe topic that I chose to study was the role of women and how each individual woman is viewed in the two contemporary Spa