# 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

### quiz4key

Course: CSE 2813, Fall 2009
School: Mississippi State
Rating:

Word Count: 215

#### Document Preview

2813 CSE Spring 2008 Quiz 4 (2/14/2008) KEY (8 point quiz--question 3 for a 1 point bonus) 1. [4 points] Let m be a positive integer. Show that ab(mod m) if a mod m = b mod m. We are given that a mod m = b mod m. This means that the remainder of a when divided by m is the same as the remainder of b when divided by m. So: a = q1m + r b = q2m + r a-b = q1m q2m = m(q1 q2) since q1 and q2 are integers q1 q2 is...

Register Now

#### Unformatted Document Excerpt

Coursehero >> Mississippi >> Mississippi State >> CSE 2813

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.
2813 CSE Spring 2008 Quiz 4 (2/14/2008) KEY (8 point quiz--question 3 for a 1 point bonus) 1. [4 points] Let m be a positive integer. Show that ab(mod m) if a mod m = b mod m. We are given that a mod m = b mod m. This means that the remainder of a when divided by m is the same as the remainder of b when divided by m. So: a = q1m + r b = q2m + r a-b = q1m q2m = m(q1 q2) since q1 and q2 are integers q1 q2 is an integer. The definition of a b (mod m) is that a-b = km for some integer k. Since q1 q2 is an integer, we have shown that if a mod m = b mod m then a (mod b m) 2. [2 point each] Determine whether the integers in each of these sets are pairwise relatively prime. If they are not, explain why not. a) 12,17,31,37 Yes, these are pairwise relatively prime since there are no common factors among the four numbers. b) 14, 15, 21 No, these are not pairwise relatively prime: 14 and 21 share 7 as ...

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:

Mississippi State - CSE - 2813
CSE 2813 Spring 2008 Quiz 5 (2/21/2008)KEY1) [4 points] Let F be the function such that F(n) is the sum of the first n positive integers. Give a recursive definition of F(n). F(1) = 1 F(n+1) = n+1 +F(n)2) [6 points] Using mathematical induction
CSU Chico - GEOS - 342
GEOS 342Concepts in Earth and Space SciencesGEOS 342Concepts in Earth and Space SciencesGEOS 342Concepts in Earth and Space SciencesGEOS 342Concepts in Earth and Space SciencesGEOS 342Concepts in Earth and Space Sciences
Mississippi State - CSE - 2813
CSE 2313 Spring 2008 Key to Quiz 9Name: _1) (3 points) Determine which of the following relations on {0, 1, 2, 3} are equivalence relations? Determine the properties of an equivalence relation that the others lack. a) {(0,0), (1,1), (1,2), (2,1),
UNF - CHAP - 2551
Chapter 5: Enhancing ClassesPresentation slides forJava Software SolutionsFoundations of Program DesignThird Edition by John Lewis and William LoftusJava Software Solutions is published by Addison-WesleyPresentation slides are copyright 2002
UNF - CHAP - 2551
Chapter 7: I nheritancePresentation slides forJava Software SolutionsFoundations of Program DesignThird Edition by John Lewis and William LoftusJava Software Solutions is published by Addison-WesleyPresentation slides are copyright 200s by Jo
UNF - CHAP - 2551
Chapter 1: Computer SystemsPresentation slides forJava Software SolutionsFoundations of Program DesignThird Edition by John Lewis and William LoftusJava Software Solutions is published by Addison-WesleyPresentation slides are copyright 2002 b
UNF - CHAP - 2551
Chapter 4: Writing ClassesPresentation slides forJava Software SolutionsFoundations of Program DesignThird Edition by John Lewis and William LoftusJava Software Solutions is published by Addison-WesleyPresentation slides are copyright 2002 by
UNF - CHAP - 2551
Chapter 6: ArraysPresentation slides forJava Software SolutionsFoundations of Program DesignThird Edition by John Lewis and William LoftusJava Software Solutions is published by Addison-WesleyPresentation slides are copyright 2002 by John Lew
Mississippi State - CSE - 2813
Introduction to TreesSection 10.1CSE 2813 Discrete StructuresTree A tree is a connected undirected graph with No simple circuits No multiple edges No loops An undirected graph is a tree if and only if there is a unique simple path betwee
UNF - CHAPTER - 2551
Java Software SolutionsChapter 2 Objects and Primitive Data1Object-Oriented Programming This course introduces the idea of developingsoftware by defining objects: Objects with which we can interact via our programs. Objects which can inte
Elon - CSC - 130
Intro to OOP with Java, C. Thomas WuChapter 4Defining Your Own Classes Part 1Animated VersionThe McGraw-Hill Companies, Inc. Permission required for reproduction or display.4th Ed Chapter 4 - 1ObjectivesAfter you have read and studied thi
Elon - CSC - 130
Intro to OOP with Java, C. Thomas WuChapter 1ObjectivesAfter you have read and studied this lecture, you should be able toIntroduction to Problem Solving and Object-Oriented Programming Name the three parts of solving problems using computer
Elon - CSC - 130
Intro to OOP with Java, C. Thomas WuChapter 1ObjectivesAfter you have read and studied this chapter, you should be able toIntroduction to Problem Solving and Object-Oriented Programming Name the three parts of solving problems using computer
Elon - CSC - 130
Using Methods in CodeMethods Methods are small pieces of code that can be used in other pieces of code. They have _ or more inputs, and _ output. This allows you to write code _rather than many times This allows you to __ a hard problem into ea
Elon - CSC - 130
Public and Private Primitives versus Objects public: everyone can use private: only used by this object.Accessibility Example Service obj = new Service(); obj.memberOne = 10; obj.memberTwo = 20; obj.doOne(); obj.doTwo(); class Service { public
Elon - CSC - 130
Programming RemindersProgram Life CycleYou have to type most things exactly Spaces don't matter, much (most cases) Capitalization matters Punctuation mattersFollow the examples.Types of ProgramsApplications: Programs that run in windows
Elon - CSC - 130
Review Game 1int num = 5; double x = 3; if(x&lt;num){ System.out.println(&quot;x is &quot;+x + &quot; and &quot; +num); if(x&lt;0){ System.out.println(&quot;x is negative&quot;); } else{ System.out.println(&quot;x is not negative&quot;); } } else if(x &lt; 7){ System.out.println(&quot;x is &quot;+x); } x =
Drexel - CS - 451
Software PrototypingqAnimating and demonstrating system requirementsIan Sommerville 1995/2000 (Modified by Spiros Mancoridis 1999)Software Engineering, 6th edition. Chapter 8Slide 1Uses of System PrototypesqqqThe principal use is to
Berkeley - ASTRO - 00336489
chi^2/nu= 994.01754 / 868The fit is rejectable at 99.816511 % Confidence -62.2200 -57.5400 249.91190 -57.5400 -38.0400 254.47097 -38.0400 -28.6800 258.05386 -28.6800 -9.9600
Berkeley - ASTRO - 00336489
89.219 89.399 271.606 89.719989.399 89.643 225.781 72.914389.643 89.837 278.23 87.278389.837 89.99 346.295 110.85789.99 90.125 362.141 119.62690.125 90.255 376.069 124.22790.255 90.411 313.391 103.52390.411 90.536 431.813 135.45690.536 90.634
Berkeley - ASTRO - 00336489
Source Contamination: 3.66E-06 +/- 4.5E-07 cts/s
Berkeley - ASTRO - 00336489
# t1 t2 dt rad_min rad_max cts err scl bg bg_rat wt 0.089219 0.089271 0.000052 0. 16. 11.00 3.32 0.878525 0.000000 0.281406 1 0.089271 0.089312 0.000041 0. 16. 10.44
Berkeley - ASTRO - 00336489
# tmin tmax 0.649048 468.14651 [ksec];instrument XRT;exposure 53506.160;xunit kev;bintype counts0.000000 0.010000 0.000000 0.0000000.010000 0.020000 0.000000 0.0000000.020000 0.030000 0.000000 0.0000000.030000 0.040000 0.00000
Berkeley - ASTRO - 00336489
# tmin tmax 0.089219000 4.17137 [ksec];instrument XRT;exposure 549.03391;xunit kev;bintype counts0.000000 0.010000 0.000000 0.0000000.010000 0.020000 0.000000 0.0000000.020000 0.030000 0.000000 0.0000000.030000 0.040000 0.00000
Berkeley - ASTRO - 00336489
output00336489000_999/sw00336489000xwtw2po_cl.evt
Berkeley - ASTRO - 00336489
SIMPLE = T / file does conform to FITS standardBITPIX = 8 / number of bits per data pixelNAXIS = 0 / number of data axesEXTEND = T / FITS dataset may contain extensio
Berkeley - ASTRO - 00336489
# Ep lEiso95.211 122.075100.406 122.078107.816 122.234110.525 122.238111.473 122.202113.633 122.173114.976 122.288116.161 122.317117.980 122.204118.052 122.206118.865 122.250120.177 122.238120.661 122.296121.661 122.274122.632 122.304
UAB - CS - 624
%!PS-Adobe-2.0 %Creator: dvipsk 5.58f Copyright 1986, 1994 Radical Eye Software %Title: as2w00.dvi %Pages: 1 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentPaperSizes: Letter %EndComments %DVIPSCommandLine: dvips -o as2w00.ps as2w00.dvi %DVIPS
Berkeley - ASTRO - 00336489
-294.56990 -289.65580 -283.83720 -276.47580 -267.04230 28.141600 44.368900 55.737500 821.97890 840.28780 855.62490 868.05090 881.10050 4033.5266 4033.
Berkeley - ASTRO - 00336489
# tmin tmax 10.0000 468.14651 [ksec];instrument XRT;exposure 51429.258;xunit kev;bintype counts0.000000 0.010000 0.000000 0.0000000.010000 0.020000 0.000000 0.0000000.020000 0.030000 0.000000 0.0000000.030000 0.040000 0.00000
UAB - CS - 624
An Operating System Exampleclass Kerneld thread while true do skip end Kerneld class Ftpd thread while true do skip end Ftpd class Syslogd thread while true do skip end Syslogd class Lpd thread while true do skip end Lpd class Httpd thread while tru
UAB - CS - 624
The AVL Tree Classclass AVLTree is subclass of Tree functions tree_isAVLTree : tree -&gt; bool tree_isAVLTree(t) = true end AVLTree
UAB - CS - 624
The Queue Classclass Queue instance variables vals : seq of Tree`node := []; operations Enqueue : Tree`node =&gt; () Enqueue (x) = vals := vals ^ [x]; Dequeue : () =&gt; Tree`node Dequeue () = def x = hd vals in ( vals := tl vals; return x) pre not isEmpt
UAB - CS - 624
The Tree Classclass Tree types tree = &lt;Empty&gt; | node; node : lt: Tree nval : int rt : Tree instance variables root: tree := &lt;Empty&gt;;operations nodes : () =&gt; set of node nodes () = cases root: &lt;Empty&gt; -&gt; return ({}), mk_node(lt,v,rt) -&gt; return(lt.n
UAB - CS - 624
The ATMCard Classclass ATMCard is subclass of BankAccount instance variables cardnumber : seq of digit; expiry : digit * digit * digit * digit; inv (let mk_(m1,m2,y1,y2) = expiry in m1 * 10 + m2 &lt;= 12) and len cardnumber &gt;= 8 operations GetCardnumbe
UAB - CS - 624
The ATMMachine Classclass ATMMachine types digit = BankAccount`digit functions encryptPin : seq of digit -&gt; nat encryptPin (digs) = if digs = [] then 0 else (hd digs) + 10 * encryptPin(tl digs); instance variables status : &lt;InService&gt; | &lt;OutOfServic
UAB - CS - 624
The Test Classclass Test instance variables atm: ATMMachine := new ATMMachine(); operations Init: () =&gt; () Init () = start(atm) end Test
UAB - CS - 624
A Sorting Example Illustrating Statementsclass St values v15 = selection_sort([3,2,9,1,3]); st1 = mk_(1,6,[3,2,-9,11,5,3]) instance variables x:nat; y:nat; l:seq1 of nat;functions min_index : seq1 of nat -&gt; nat min_index(l) = if len l = 1 then 1 e
UAB - CS - 624
%!PS-Adobe-2.0 %Creator: dvipsk 5.58f Copyright 1986, 1994 Radical Eye Software %Title: new.dvi %Pages: 18 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentPaperSizes: Letter %EndComments %DVIPSCommandLine: dvips -o new.ps new.dvi %DVIPSParamete
UAB - CS - 624
The GroupPhase Classclass GroupPhase values secondRoundWinners = [&lt;A&gt;,&lt;B&gt;,&lt;C&gt;,&lt;D&gt;,&lt;E&gt;,&lt;F&gt;,&lt;G&gt;,&lt;H&gt;]; secondRoundRunnersUp = [&lt;B&gt;,&lt;A&gt;,&lt;D&gt;,&lt;C&gt;,&lt;F&gt;,&lt;E&gt;,&lt;H&gt;,&lt;G&gt;] types Team = &lt;Brazil&gt; | &lt;Norway&gt; | &lt;Morocco&gt; | &lt;Scotland&gt; | &lt;Italy&gt; | &lt;Chile&gt; | &lt;Austria&gt; |
UAB - CS - 624
)
Laurentian - CHEM - 200303
Chemistry 2100 Carbon Oxidation Numbers HandoutWhen dealing with carbon compounds, one problem arises with the conventional method for determining oxidation numbers. It calculates the AVERAGE oxidation number but this does not tell us anything abou
Laurentian - CHEM - 200303
Dr. Ying Zheng NAME: Question Mark Possible INSTRUCTIONS:Chemistry 2100 Practice Quiz 5 (for Chapters 11 &amp; 12) Stu. No.: 1 2 3 4 5 6 730 minutes Section A or B (circle one) Total4445355301) Please read the exam over carefully be
Laurentian - CHEM - 200303
Dr. Ying ZhengChemistry 2100 Practice Quiz 2 (for Chapters 1, 2, 4)30 minutesNAME:Student Number:INSTRUCTIONS:1) Please read the exam over carefully before beginning. 2) Marks will be deducted for improper use of significant figures. 3) I
Laurentian - CHEM - 200303
Dr. Ying Zheng NAME: Question Mark Possible INSTRUCTIONS:Chemistry 2100 Practice Quiz 4 (for Chapters 6,7) Stu. No.: 1 2 3 4 5 6 Section Total30 minutes A or B (circle one)654357301) Please read the exam over carefully before begi
Laurentian - CHEM - 200303
Dr. Ying Zheng NAME:Chemistry 2100 Practice Quiz Chapter 13-14 (No. 2) Stu. No.: Question Mark Possible 7 4 5 5 9 1 2 3 4 5 Total30 minutes Section A or B (circle one)30INSTRUCTIONS:1) Please read the questions carefully before beginning. 2
Allan Hancock College - COMP - 5028
Introduction OO BasicsLecture 1 Wednesday March 8, 20061AgendaAdministrative Course objective and outline OO BasicsWhat's OOAD? Functional decomposition and its problem What's UML? Software Development ProcessCOMP5028 Object-Oriented Analysi
George Mason - CS - 672
&amp;6 &amp;DSDFLW\ 3ODQQLQJ 0HWKRGRORJ\Dr. Daniel A. Menasc http:/www.cs.gmu.edu/faculty/menasce.html Department of Computer Science George Mason University 1999 Menasc. All Rights Reserved. 1:KDW LV \$GHTXDWH &amp;DSDFLW\&quot;:H VD\ WKDW D :HE VHUYLFH KDV DGH
George Mason - CS - 672
CS 672 Modeling MultiprocessorsDr. Daniel A. Menasc http:/www.cs.gmu.edu/faculty/menasce.html Department of Computer Science George Mason University1 1999-2001 D. A. Menasc. All Rights Reserved.Approximation for MultiprocessorsD 1 . m D/m D*(
George Mason - CS - 672
&amp;6 :RUNORDG &amp;KDUDFWHUL]DWLRQDr. Daniel A. Menasc http:/www.cs.gmu.edu/faculty/menasce.html Department of Computer Science George Mason University 1999 Menasc. All Rights Reserved. 1:KDW LV :RUNORDG &amp;KDUDFWHUL]DWLRQ&quot; 1999 Menasc. All Rights Res
Allan Hancock College - COMP - 5028
AgendaInceptionLecture 2 March 15, 2006Inception overview Evolutionary Requirements Use cases Other requirements Assignment 1 instruction1COMP5028 Object-Oriented Analysis and Design (S1 2006) Dr. Ying Zhou, School of IT, The University of
George Mason - CS - 672
Using Performance Models to Design Self-Configuring and Self-Otimizing Computer SystemsProf. Daniel Menasc Department of Computer Science E-Center for E-Business George Mason University Fairfax, VA, USA Menasce@cs.gmu.edu www.cs.gmu.edu/faculty/mena
Allan Hancock College - COMP - 5028
AgendaAssociations, contracts and UML interaction diagramsRefine Domain ModelMore on AssociationsSystem sequence diagram Operation Contract On to Object designInteraction diagramsSequence diagrams Communication diagramsWeek 4 lecture March
Allan Hancock College - COMP - 5028
AgendaDesign persistence serviceWeek 11 Lecture May 24, 2006Failover to local services with a proxy Persistence servicesObject-Relation Mapping Faade as single point of access Persistent Object mapper Materialization with Template Method Design
Berkeley - CS - 162
%!PS-Adobe-2.0 %Creator: dvips 5.516 Copyright 1986, 1993 Radical Eye Software %Title: osdi99.dvi %CreationDate: Mon Feb 15 14:56:35 1999 %Pages: 14 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Italic Times-Bold Cour
Allan Hancock College - AGSM - 9806
6The Application of Mathematical Programming Techniques to Financial Statement Analysis: Australian Gold Production and ExplorationbyAndrew C. Worthington Abstract: A sample of thirty listed Australian gold producers is used to compare the fina
Oregon State - BA - 590
Your Name: _Please rate your team members from 1 to 5, as defined to the right.5 = Strongly Agree 4 = Agree 3 = Neutral 2 = Disagree 1 = Strongly Disagree 1 = Strongly DisagreeTeam Member Names Kept up with team activities, participating on a r
Oregon State - BA - 590
BA 590Basic Marketing Concepts OverviewBA 590 Marketing Review Modules Marketing Concepts Customer Needs Industry Competition Target Marketing, Segmentation, and Marketing Research New Product Development and Sales1-5BA 590Module 1B
Oregon State - BA - 590
PreviewConceptEvaluation(Chapters812) ConceptEvalSystem ConceptTesting FullScreen SalesandForecasting ProductProtocolGroupConceptEvaluation Discussion(TimePermitting)PARTTHREECONCEPT/PROJECTEVALUATIONMcGrawHill/IrwinCopyright2006T
Allan Hancock College - COMP - 5028
AgendaGoF patterns IIComposite pattern Faade pattern Observer pattern Template MethodWeek 9 Lecture May 10, 20061COMP5028 Object-Oriented Analysis and Design (S1 2006) Dr. Ying Zhou, School of IT, The University of Sydney2Composite (st
Marist - FREN - 251
5 semaines des vacances or:6/7/09Par John edit Master subtitle style Click to YorkeBienvenue !Bonjour ! Je mappelle Luc, et jai 35 ans. Je travaille pour une entreprise depuis 6 ans. Chaque anne, ma boulot me donne cinq semaines de vacances,