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.
3 Pages
exam_3.1
Course: MATH 170, Fall 2008School: UPenn
Rating:
Word Count: 190
Document Preview
Math 1 170 Practice Final Exam 3 Name Section Number 2 (1) Suppose A is a symbol which represents ten and B is a symbol which represents eleven. What is AAA base 11 expressed base 6? (2) What is 555.55 base 6 expressed base 10? (3) What is 123.123 base 5 as a fraction (base 10) in lowest terms? (4) What is [3; 5, 3, 5, 8] expressed as a fraction in lowest terms? (5) What does [3; 5, 3] equal? (6) Which of the...
Unformatted Document Excerpt
Coursehero >> Pennsylvania >> UPenn >> MATH 170Course 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.
Math 1 170 Practice Final Exam 3
Name
Section Number
2 (1) Suppose A is a symbol which represents ten and B is a symbol which represents eleven. What is AAA base 11 expressed base 6? (2) What is 555.55 base 6 expressed base 10? (3) What is 123.123 base 5 as a fraction (base 10) in lowest terms? (4) What is [3; 5, 3, 5, 8] expressed as a fraction in lowest terms? (5) What does [3; 5, 3] equal? (6) Which of the following are rational numbers? 24 35 116 3 (ii) 23 56 1312 6 (iii) 22 1111 1313 5 (iv) 210 55 2325 (i)
2 (7) Let Rn+1 = 2Rn 2Rn 2 be a mathematical model with R0 = 0.
What is R3 ? (8) Let Rn+1 = 2(Rn )3 17Rn be a mathematical How model. many equilibrium points does Rn have and what are they?
2 (9) Consider the mathematical model Mn+1 = Mn + (2 4i) with M0 = 0.
What is M3 ? (10) What are the values of x such that 2x2 5x + 2 = 0? (11) What does (1 + 2i) (12 5i) equal? What about (1 + 2i) + (12 5i)?
3 (12) What does
6+3i 5+i
equal? What about (6 + 3i) (5 + i)?
(13) Let Mn+1 = (Mn )2 + 5 be a mathematical mod...
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:
Below is a small sample set of documents:
UPenn - MATH - 170
1 Math 170 Practice Final Exam 1NameSection Number2 (1) Suppose A is a symbol which represents ten and B is a symbol which represents eleven. What is B9A base 12 expressed base 7? (2) What is 123.45 base 8 expressed base 10? (3) What is 123.123
UPenn - MATH - 170
16) Consider the discrete dynamical system given byPn+1 = 2Pn - Pn2What are the equilibrium and are they stable or unstable? The following is the graph of y =x y=2x -x 247) Below is an outline of the Mandelbrot Set. The points marked are: A = -0
UPenn - MATH - 170
15) Consider the discrete dynamical system given byPn+1 = 2What are the equilibrium and are they stable or unstable from the left and right? The following is the graph of y =x y=216) Below is an outline of the Mandelbrot Set. The points marked a
UPenn - MATH - 170
15) Consider the discrete dynamical system given byPn+1 = Pn 2What are the equilibriums and are they stable or unstable? The following is the graph of y =x y= y=x 216) Below is an outline of the Mandelbrot Set. The points marked are: A = -1.25 i
UPenn - MATH - 170
1 Math 170 Homework 10 Due December 4, 2008Name TA: Section Number:2 (1) Suppose A is a symbol representing ten. What is AA1 base 11 expressed base 4? (2) What is 123.12 base 4 in base 10? (3) Express 102.102 base 3 as a fraction (in lowest terms
UPenn - MATH - 170
1Straightedge and CompassThe goal of the presentation is to discuss constructions with a strait edge and compass. Your presentation should include at least A discussion what a straightedge and compass are. A discussion of what a straightedge and
UPenn - M - 584
# > restart;> #In this worksheet we use maple to compute some Fourier transform and> graph the results. We can define a function as a integral. The> function defined in the next line is the Fourier transform of the> characteristic function of th
UPenn - M - 584
# # > restart;> #This worksheet is intended to give you some feeling of how to use> convolution to approximately compute derivatives. In the next command> replace sin(x) with the function of your choice. Use a function for> which maple can comp
UPenn - M - 584
# # > restart;> #Here we define several functions with support in the interval [-1,1].> f0 := x->piecewise(x>-1 and x<1, 1, 0);> f1 := x-> piecewise(x>-1 and x<1, (1-x^2), 0);> f2 := x-> (f1(x)^2;> #We plot the functions defined above. f0 has
UPenn - M - 584
# This routine uses the fast fourier transform to compute the DFT. The input is a # vector [fh[1], .fh[n] of samples and the length, n of this vector. The routine finds # the smallest power of 2 larger than n and computes a FFT of that length with
UPenn - M - 509
Math 509 Problem set 3, due February 2, 2006 Dr. EpsteinIn class we will discuss material on pages 44-58 of Fourier Analysis. The following are standard or review problems. Please be sure you know how to do them. You do not need to hand in solutions
UPenn - M - 584
Math 584, Problem set 4 due November 7, 2006 Dr. EpsteinReading: Read sections 5.1, 5.2, 5.3, and 6.1. You are free to use maple (or Mathematica, MATLAB etc.) to do these problems. Try running maple worksheets 4, and 5. If your browser does not auto
UPenn - M - 584
Math 584, Problem set 1 due September 26, 2006 Dr. EpsteinReading: Read chapters 1 and 2 of the textbook. You may use Maple (or Mathematica, MATLAB etc.) to do these problems. If you do, then please attach the output of the program to your solutions
UPenn - CIT - 597
RailsApr 10, 2009What is Rails? Rails is a framework for building web applications This involves: Getting information from the user (client), using HTML forms Doing validation Maintaining session information Managing a database Displayin
UPenn - CIT - 597
XPathApr 10, 2009What is XPath? XPath is a syntax used for selecting parts of an XML document The way XPath describes paths to elements is similar to the way an operating system describes paths to files XPath is almost a small programmin
UPenn - CIT - 594
SearchingSearching an array of integersIf an array is not sorted, there is no better algorithm than linear search for finding an element in itstaticfinalintNONE=1;/notalegalindex staticintlinearSearch(inttarget,int[]a){ for(intp=0;p<a.length;p+
UPenn - CIT - 591
Everything You Ever Wanted To Know About Java O-OApr 10, 2009What is a class?A class is primarily a description of objects, or instances, of that class A class contains one or more constructors to create objects A class is a type A type
UPenn - CIT - 594
State MachinesApr 10, 2009What is a state machine? A state machine is a different way of thinking about computation A state machine has some number of states, and transitions between those states Transitions occur because of inputs A pure
UPenn - CIT - 594
A Binary Tree ADTFields The definition of a binary tree pretty much requires the following fields: Objectvalue; BinaryTreeleftChild; BinaryTreerightChild; I also wanted to have this additional field: BinaryTreeparent; Should these fields b
UPenn - CIT - 591
RecursionApr 10, 2009Definitions IA recursive definition is a definition in which the thing being defined occurs as part of its own definition Example: An atom is a name or a number A list consists of: An open parenthesis, "(" Zero or m
UPenn - CIT - 597
DOMApr 10, 2009SAX and DOMSAX and DOM are standards for XML parsers-program APIs to read and interpret XML files DOM is a W3C standard SAX is an ad-hoc (but very popular) standard There are various implementations available Java imple
UPenn - CIT - 597
More JavaScriptApr 10, 2009Browser support JavaScript works on almost all browsers Internet Explorer uses JScript (referred to in menus as Active Scripting), which is Microsofts dialect of JavaScript Older browsers dont support some of the n
UPenn - CIT - 591
ArraysA problem with simple variables One variable holds one value The value may change over time, but at any given time, a variable holds a single value If you want to keep track of many values, you need many variables All of these variables
UPenn - CIT - 591
State MachinesApr 10, 2009What is a state machine? A state machine is a different way of thinking about computation A state machine has some number of states, and transitions between those states Transitions occur because of inputs A pure
UPenn - CIT - 597
<?xml version="1.0" encoding="UTF-8"?> <Error><Code>NoSuchKey</Code><Message>The specified key does not exist.</Message><Key>4ef63fcf58f1ab753365b9d97a3437ac45e082e8.ppt</Key><RequestId>D F69F396087F7AD8</RequestId><HostId>avMP9wNCqTnFBeRSd6/yIudFtAy
UPenn - CIS - 500
CIS 500 Software Foundations Midterm I Review questionsOctober 10, 2007The following problems should give you a general idea of the style and coverage of the exam questions. Note that this is not a sample exam: in particular, we have not tried to
UPenn - CIS - 500
CIS 500 Software Foundations Final Exam Review questionsDecember 11, 2007The following problems should give you a general idea of the style and coverage of the exam questions from the last part of the course. Note that this is not a sample exam:
UPenn - CIS - 500
CIS 500 Software Foundations Midterm I, Review QuestionsUntyped lambda-calculus1. (2 points) We have seen that a linear expression like x. y. x y x is shorthand for an abstract syntax tree that can be drawn like this: x y applyxr rrr apply M
UPenn - CIS - 500
1 Exercise Show the derivations of the following typing judgments: 1. if false then 0 else succ 0 : Nat 2. succ (if iszero 0 then succ 0 else pred 0) : Nat 1 Solution This solution uses the prooftree package. 0 : Nat 1. false : Bool T-False 0 : Nat T
UPenn - CIS - 500
CIS 500 Software Foundations Final Exam Review questions with answersDecember 11, 2007Work each of the review problems yourself before looking at the answers given here. If your answer diers from ours, make sure you understand why.SubtypingThe
UPenn - CIS - 500
CIS 500 Software Foundations Midterm II Answer keyNovember 8, 2006Instructions This is a closed-book exam. You have 80 minutes to answer all of the questions. The entire exam is worth 80 points for students in section 002 and 90 points for stud
UPenn - CIS - 500
CIS 500 Software Foundations Final Exam Answer keyDecember 18, 2007Operational semanticsThe questions in this section concern a variant of the language of untyped arithmetic and boolean expressions that we used in the course. The original deniti
UPenn - CIS - 500
CIS 500 Software Foundations Fall 2006Some HintsNovember 6HintsThe exam will potentially cover everything in the course so far, but will focus on material weve seen since the rst midterm. There will be a question that is also a one-star exerci
UPenn - CIS - 500
CIS 500 Software Foundations Midterm IOctober 12, 2005Name:Student ID: Email Status registered for the course not registered: trying to improve a previous grade not registered: just taking the exam for practice Program undergrad undergrad (MSE s
UPenn - CIS - 500
CIS 500 Software Foundations Midterm IINovember 14, 2007Name: Email:Score 1 2 3 4 5 6 7 8 9 10 11 12 13 TotalInstructions This is a closed-book exam: you may not use any books or notes. You have 80 minutes to answer all of the questions.
UPenn - CIS - 500
CIS 500 Software Foundations Midterm II Answer keyNovember 12, 2003Simply typed lambda-calculusThe following questions refer to the simply typed lambda-calculus with booleans and exceptions. The syntax, typing, and evaluation rules for this syst
UPenn - CIS - 500
CIS 500 Software FoundationsHomework Assignment 5Simple types Due: Monday, October 9, 2006, by noon Submit your solutions as hw5, for example using the command: ~cis500/bin/cis500submit hw5 hw5.pdf1 Exercise Give a typing derivation showing that
UPenn - CIS - 500
CIS 500 Software Foundations Midterm I Answer keyOctober 8, 2003Inductive DenitionsReview: Recall that the function size, which calculates the total number of nodes in the abstract syntax tree of a term in the language of arithmetic and boolean
UPenn - CIS - 500
CIS 500 Software Foundations Fall 2006The Lambda CalculusSeptember 25The lambda-calculusIf our previous language of arithmetic expressions was the simplest nontrivial programming language, then the lambda-calculus is the simplest interesting p
UPenn - CIS - 500
CIS 500 Software Foundations Fall 2004 Induction; Operational SemanticsCIS 500, Induction; Operational Semantics1AnnouncementsReview recitations start this week. Y may go to any recitation section ou that you wish. Y do not need to register fo
UPenn - CIS - 500
CIS 500 Software Foundations Fall 2006Review (and more details)September 20Simple Arithmetic ExpressionsThe set T of terms is dened by the following abstract grammar: t := true false if t then t else t 0 succ t pred t iszero t terms constant t
UPenn - MEAM - 245
UPenn - ESE - 206
Q1First, convince yourself that the following three statements are true.In[300]:=eqs = :DOut VInt AOut HVLED + VDiodeL Sign@AInD, AIn R12 + DOut R11 R11 + R12 R10 >; VInt 1 + R9 ,where Sign@x; x < 0D = -1 and Sign@x; x > 0D = 1 Then we combine
UPenn - CIS - 550
Fall, 2007 CIS 550Database and Information SystemsFinal Examination Version CName: _Please sign the following statement: I agree not to discuss this examination with anyone until after the deadline of 2PM on December 14, 2007. I will only cons
UPenn - CSE - 240
Whats CSE 240 All About?!The new CSE240:CSE 240 Introduction to Computer Architecturehttp:/www.seas.upenn.edu/~cse240/ Autumn 2006 Not at 9am! New approach (bottom up) New textbook New instructor Well integrated into curriculum Cooler a
UPenn - CSE - 372
Hardware Description Languages (HDLs) Textural representation of a digital logic designCSE372 Digital Systems Organization and Design LabProf. Milo Martin Unit 1: Synthesizable Verilog Easier to edit and revise than schematics However, you sti
UPenn - CSE - 372
Constraints Guide8.1iRRXilinx is disclosing this Document and Intellectual Property (hereinafter the Design) to you for use in the development of designs to operate on, or interface with Xilinx FPGAs. Except as stated herein, none of the Desi
UPenn - CSE - 240
Computer System: Layers of AbstractionApplication Program Algorithms Language Instruction Set Architecture(and I/O Interfaces)Chapter 1 Welcome AboardBased on slides McGraw-Hill Additional material 2004/2005/2006 Lewis/MartinSoftware Hardwar
UPenn - CSE - 372
Final Two Projects Lab 3 - Non-pipelined ProcessorCSE372 Digital Systems Organization and Design LabProf. Milo Martin Unit 4: The P37X Processor Projects Worksheet - ~1 week Note: use colored pen or pencil Simulation demo - ~1 week Hardware
UPenn - CSE - 240
Name:1Intro. to Computer Architecture CSE 240 Autumn 2006Homework 1 Due: Fri. 15 September 2006Write your answers on these pages. Additional pages may be attached (with staple) if necessary. Please ensure that your answers are legible and sho
UPenn - CIS - 371
This Unit: Putting It All TogetherApplication OS! Anatomy of a game consoleFirmware I/OCIS 371 Computer Organization and DesignUnit 15: Putting It All Together: Anatomy of the XBox 360 Game ConsoleCompiler CPU! Microsoft XBox 360! Focus
UPenn - CSE - 372
XST User Guide8.1iRRXilinx is disclosing this Document and Intellectual Property (hereinafter the Design) to you for use in the development of designs to operate on, or interface with Xilinx FPGAs. Except as stated herein, none of the Design
UPenn - CSE - 240
System CallsSome ops. require specialized knowledge and protection Abstract I/O device registers and how to use them Programmers dont want to know this! Protection for shared I/O resources - isolate programs from OS Reuse of common code Low-leve
UPenn - CSE - 240
Guide to Using the Unix version of the LC-3 Simulatorby Kathy Buchheit The University of Texas at Austin copyright, Kathy Buchheit January 2001, October 2003Guide to Using the Unix version of the LC-3 SimulatorThe LC-3 is a piece of hardware,
UPenn - CSE - 240
A Few Words on Fridays ExamLogistics In-class, 50 points in 50 minutes Open-book, open-note exam No calculators, cell phones, laptops, etc.Example Topics (non-exhaustive)Bits and data Data types and conversions Binary arithmetic and logical
UPenn - CSE - 240
Intro. to Computer Architecture CSE 240 Autumn 2004Homework 2 Solution DUE: Fri. 24 September 2004Write your answers on these pages. Additional pages may be attached (with staple) if necessary. Please ensure that your answers are legible. Please
UPenn - CSE - 240
ECE 199 Final Exam Fall 2003Tuesday, December 16th, 2003Name: Be sure your exam booklet has 11 pages. Write your name at the top of each page. This is a closed book exam. You are allowed three 8.5 x 11 sheets of notes. Absolutely no int
UPenn - CIS - 501
This Unit What is a computer and what is computer architectureCIS501 Introduction to Computer ArchitectureProf. Milo Martin Unit 1: Technology, Cost, Performance, Power, and Reliability Forces that shape computer architecture Applications (cov
UPenn - CSE - 240
Programming LevelsApplication Languages (Java, C#) Scripting Interpreted Languages Or Compiled (Perl, Python, VB)Chapter 11 Introduction to Programming in CBased on slides McGraw-Hill Additional material 2004/2005/2006 Lewis/MartinHigh-Level
UPenn - CSE - 240
How do we represent data in a computer?At the lowest level, a computer has electronic plumbing Operates by controlling the flow of electronsChapter 2 Bits, Data Types, and OperationsBased on slides McGraw-Hill Additional material 2004/2005/200