7 Pages

October182004

Course: EECS 4530, Fall 2008
School: Toledo
Rating:
 
 
 
 
 

Word Count: 1717

Document Preview

1 Test Results Computer Graphics High Low Median Average 97 50's 82 78 Test 1 Results Current Project A routine and class for NFF files is available on the Web Site It reads the format as specified. 100 90 80 Series1 S c o re 70 60 50 0 5 10 15 20 25 30 #ifndef __NFFOBJECT_H__ #define __NFFOBJECT_H__ /* Class to read and encapsulate a NFF object using * C++ and OpenGL. * * Author: Jerry Heuring */...

Register Now

Unformatted Document Excerpt

Coursehero >> Ohio >> Toledo >> EECS 4530

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.
1 Test Results Computer Graphics High Low Median Average 97 50's 82 78 Test 1 Results Current Project A routine and class for NFF files is available on the Web Site It reads the format as specified. 100 90 80 Series1 S c o re 70 60 50 0 5 10 15 20 25 30 #ifndef __NFFOBJECT_H__ #define __NFFOBJECT_H__ /* Class to read and encapsulate a NFF object using * C++ and OpenGL. * * Author: Jerry Heuring */ #include "drawable.h" #include <iostream> using namespace std; class NFFObject : Drawable { protected: double **vertices; double **normals; int *polygonStarts; int *polygonSizes; int nbrVertices, verticesSize; int nbrPolygons, polygonsSize; void resizeVerticesAndNormals(int addSize); void resizePolygons(int addSize); public: NFFObject( ); NFFObject(const NFFObject& orig); int getNumberOfPolygons( ) { return nbrPolygons; } int getNumberOfVertices( ) { return nbrVertices; } int addVertexAndNormal(const double vertex[], const double normal[]); int addPolygon(int startVertex, int nbrVertices); void draw( ); void draw(int polygonID); friend istream& operator >> (istream& istr, NFFObject& obj); friend ostream& operator << (ostream& ostr, NFFObject& obj); }; #endif NFFObject.cpp #include "NFFObject.h" #include "glut.h" #include <iostream> #include <fstream> #include <string> using namespace std; // Default Constructor NFFObject::NFFObject ( ) { polygonStarts = NULL; polygonSizes = NULL; vertices = NULL; normals = NULL; nbrVertices = verticesSize = 0; nbrPolygons = polygonsSize = 0; } // Copy constructor -- rather messy since I need to allocate everything. NFFObject::NFFObject( const NFFObject& orig) { int i, j; vertices = new double * [ orig.nbrVertices]; vertices[0] = new double [orig.nbrVertices*4]; nbrVertices = orig.nbrVertices; verticesSize = orig.nbrVertices; normals = new double * [orig.nbrVertices]; normals[0] = new double [orig.nbrVertices * 3]; polygonStarts = new int [orig.nbrPolygons]; polygonSizes = new int [orig.nbrPolygons]; nbrPolygons = orig.nbrPolygons; polygonsSize = orig.nbrPolygons; for (i = 0; i < nbrVertices; i++) { vertices[i] = vertices[0]+ (i*4); normals[i] = normals[0] + (i* 3); for (j = 0; j < 3; j++) { vertices[i][j] = orig.vertices[i][j]; normals[i][j] = orig.normals[i][j]; } vertices[i][3] = orig.vertices[i][3]; } for (i = 0; i < nbrPolygons; i++) { polygonStarts[i] = orig.polygonStarts[i]; polygonSizes[i] = orig.polygonSizes[i]; } } /* * Resize the vertices and normals -- both arrays should * be the same size for the NFFObject. The two * dimensional arrays are a bit messy to allocate * properly. */ void NFFObject::resizeVerticesAndNormals(int addSize) { double ** newVertices; double ** newNormals; int newSize; int vertex; int current; newSize = nbrVertices + addSize; newVertices = new double * [newSize]; newVertices[0] = new double [newSize*4]; newNormals = new double * [newSize]; newNormals [0] = new double [newSize * 3]; for (vertex = 0; vertex < newSize; vertex++) { newVertices[vertex] = newVertices[0] + (vertex*4); newNormals [vertex] = newNormals [0] + (vertex*3); } for (vertex = 0; vertex < nbrVertices; vertex++) { for (current = 0; current < 3; current++) { newVertices[vertex][current] = vertices[vertex][current]; newNormals [vertex][current] = normals [vertex][current]; } newVertices[vertex][3] = vertices[vertex][3]; } if (vertices != NULL) { delete [] vertices[0]; delete [] vertices; } if (normals != NULL) { delete [] normals[0]; delete [] normals; } verticesSize = newSize; vertices = newVertices; normals = newNormals; return; } /* * Resize the polygon array that holds the indices for * the polygon vertices. */ void NFFObject::resizePolygons ( int addSize ) { int * newPolygonStarts, * newPolygonSizes, newSize, current; newSize = polygonsSize + addSize; newPolygonStarts = new int [newSize]; newPolygonSizes = new int [newSize]; for (current = 0; current < nbrPolygons; current++) { newPolygonStarts[current] = polygonStarts[current]; newPolygonSizes[current] = polygonSizes[current]; } if (polygonStarts != NULL) { delete [] polygonStarts; } if (polygonSizes != NULL) { delete [] polygonSizes; } polygonStarts = newPolygonStarts; polygonSizes = newPolygonSizes; polygonsSize = newSize; return; } addVertexAndNormal() /* * Add a vertex and a normal. */ int NFFObject::addVertexAndNormal (const double vertex[], const double normal[]) { int i; if (nbrVertices == verticesSize) { resizeVerticesAndNormals(100); } for (i = 0; i < 3; i++) { vertices[nbrVertices][i] = vertex[i]; normals [nbrVertices][i] = normal[i]; } vertices[nbrVertices][3] = vertex[3]; nbrVertices++; return nbrVertices-1; } /* addPolygon( ) * Add a polygon to the list of polygons. * Resizes as necessary */ int NFFObject::addPolygon(int startVertex, int nbrVertices) { if (nbrPolygons == polygonsSize) { resizePolygons(100); } polygonStarts[nbrPolygons] = startVertex; polygonSizes[nbrPolygons] = nbrVertices; nbrPolygons++; return nbrPolygons-1; } draw( ) * Draw the entire group of objects. You may find the * other routine that draws a single polygon to be more * useful. */ void NFFObject::draw( ) { int currentPoly; glEnableClientState(GL_VERTEX_ARRAY); glEnableClientState(GL_NORMAL_ARRAY); glVertexPointer(4, GL_DOUBLE, 0, vertices[0]); glNormalPointer(GL_DOUBLE, 0, normals[0]); for (currentPoly = 0; currentPoly < nbrPolygons; currentPoly++) { glDrawArrays(GL_POLYGON, polygonStarts[currentPoly], polygonSizes[currentPoly]); } glDisableClientState(GL_NORMAL_ARRAY); glDisableClientState(GL_VERTEX_ARRAY); } /* /* draw ( int ) * Draw a particular polygon. The polygonID is the * value returned when a particular polygon was created. */ void NFFObject::draw(int polygonID) { int i; glBegin (GL_POLYGON); for (i = 0; i < polygonSizes[polygonID]; i++) { glVertex4dv(vertices[polygonStarts[polygonID]+i]); glNormal3dv(normals[polygonStarts[polygonID]+i]); } glEnd( ); } /* * output the information to an output stream. Comments * are lost and everything comes out as a polygonal * patch. */ ostream& operator << (ostream& ostr, NFFObject& obj) { int currentPoly, i, point; for (currentPoly=0; currentPoly < obj.nbrPolygons; currentPoly++) { ostr << "pp " << obj.polygonSizes[i] << endl; for (point=0; point<obj.polygonSizes[i]; point++) { ostr<<obj.vertices[obj.polygonStarts[i]+point][0] << " " <<obj.vertices[obj.polygonStarts[i]+point][1] << " " <<obj.vertices[obj.polygonStarts[i]+point][2] << " " <<obj.normals[obj.polygonStarts[i]+point][0] << " " <<obj.normals[obj.polygonStarts[i]+point][0] << " " <<obj.normals[obj.polygonStarts[i]+point][0] << " " << endl; } } return ostr; } /* * The input of the object is done in this routine. I * consider this to still be relatively brittle in that a * bad input file will break it. There are I/O * statements that are enabled with a debug flag in the * routine that you can use if you run into problems.. */ istream& operator >> ( istream& istr , NFFObject& obj) { string entityCode; string junk; double fromX, fromY, fromZ, atX, atY, atZ, upX, upY, upZ, angle, hither; double baseX, baseY, baseZ, baseRadius, topX, topY, topZ, topRadius; double vertex[4], normal[3], red, green, blue, diffuse, specular, shininess, transmittance, ior, radius, vector1[3], vector2[3], length; int xres, yres, nbrVertices, i, startPoly, saveStart; istr >> entityCode; while (istr.good( ) ) { if (entityCode[0] == '#') { // Comment -- skip line getline(istr, junk); } else if (entityCode=="v"){//viewpoint information } else if (entityCode == "from") { istr >> fromX >> fromY >> fromZ; #ifdef DEBUG cout << "Read from record " << fromX << " " << fromY << " " << fromZ << endl; #endif } else if (entityCode == "at") { istr >> atX >> atY >> atZ; #ifdef DEBUG cout << "At record " << atX << " " << atY << " " << atZ << endl; #endif } else if (entityCode == "up") istr { >> upX >> upY >> upZ; #ifdef DEBUG cout << "Up record " << upX << " " << upY << " " << upZ << endl; #endif } else if (entityCode == "angle") { istr >> angle; #ifdef DEBUG cout << "Angle record " << angle << endl; #endif } else if (entityCode == "hither") { istr >> hither; #ifdef DEBUG cout << "Hither record " << hither << endl; #endif } else if (entityCode == "resolution") { istr >> xres >> yres; #ifdef DEBUG cout << "Resolution record " << xres << " " << yres << endl; #endif } else if (entityCode == "f") { istr >> red >> green >> blue >> diffuse >> specular >> shininess >> transmittance >> ior; #ifdef DEBUG cout << "Material record " << red << " " << green << " " << blue << " " << diffuse << " " << specular << " " << shininess << " " << transmittance << " " << ior << endl; #endif } else if (entityCode == "p") { // Polygon -- no normals istr >> nbrVertices; cout << nbrVertices << endl; normal[0] = normal[1] = normal[2] = 0.0; vertex[3] = 1.0; for ( i = 0; i < nbrVertices; i++ ) { istr >> vertex[0] >> vertex[1] >> vertex[2]; cout << vertex[0] << " " << vertex[1] << " " << vertex[2] << endl; startPoly = obj.addVertexAndNormal(vertex, normal); } /* * Need to compute and patch the normals for this * polygon. */ vector1[0] = obj.vertices[saveStart][0] obj.vertices[saveStart+1][0]; vector1[1] = obj.vertices[saveStart][1] obj.vertices[saveStart+1][1]; vector1[2] = obj.vertices[saveStart][2] obj.vertices[saveStart+1][2]; vector2[0] = obj.vertices[saveStart][0] obj.vertices[saveStart+2][0]; vector2[1] = obj.vertices[saveStart][1] obj.vertices[saveStart+2][1]; vector2[2] = obj.vertices[saveStart][2] obj.vertices[saveStart+2][2]; normal[0] = vector1[1]*vector2[2] vector1[2] * vector2[1]; normal[1] = vector1[2]*vector2[0] vector1[0] * vector2[2]; normal[2] = vector1[0] * vector2[1] vector1[1]*vector2[0]; if (i == 0) { saveStart = startPoly; obj.addPolygon(startPoly, nbrVertices); } length = sqrt(normal[0]*normal[0] + normal[1]*normal[1] + normal[2] * normal[2]); normal[0] = normal[0] / length; normal[1] = normal[1] / length; normal[2] = normal[2] / length; for (i = 0; i < nbrVertices; i++) { obj.normals[saveStart+i][0] = obj.normals[saveStart+i][0]; obj.normals[saveStart+i][1] = obj.normals[saveStart+i][1]; obj.normals[saveStart+i][2] = obj.normals[saveStart+i][2]; } } else if (entityCode == "c") { // Cone istr >> baseX >> baseY >> baseZ >> baseRadius >> topX >> topY >> topZ >> topRadius; #ifdef DEBUG cout << "Cone Base: " << baseX << " " << baseY << " " << baseZ << " " << baseRadius << endl; cout << "Cone Top : " << topX << " " << topY << " " << topZ << " " << topRadius << endl; #endif } else if (entityCode == "s") { // Sphere istr >> vertex[0] >> vertex[1] >> vertex[2] >> radius; #ifdef DEBUG cout << " Sphere : " << vertex[0] << " " << vertex[1] << " " << vertex[2] << " " << radius << endl; #endif } else if (entityCode == "pp") { // polygon with normals istr >> nbrVertices; #ifdef DEBUG cout << nbrVertices << endl; #endif for ( i = 0; i < nbrVertices; i++ ) { istr >> vertex[0] >> vertex[1] >> vertex[2] >> normal[0] >> normal[1] >> normal[2]; The test program #ifdef DEBUG cout << vertex[0] << " " << vertex[1] << " " << vertex[2] << " " << normal[0] << " " << normal[1] << " " << normal[2] << endl; #endif vertex[3] = 1.0; obj.addVertexAndNormal(vertex, normal); } } else { cout << "Unknown element : " << entityCode << endl; getline(istr, junk); } istr >> entityCode; } } #define GLUT_DISABLE_ATEXIT_HACK #include <string> #include #include #include #include #include #include #include #include /* * * * * * * "glut.h" <cstdlib> "indexedPoly.h" "indexedQuads.h" "Light.h" "Material.h" "triangles.h" "NFFObject.h" This program started as a group of rout...

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:

Toledo - EECS - 4530
Test Info Computer GraphicsDecember 9, 2002Monday December 16 5-7PM Here (PL 3100) Open book and notes Comprehensive but will include Discrete Techniques (Ch. 7) Particle Systems (Ch. 11.3)Some more B-Spline InfoWhy are there knots? And why more
Toledo - EECS - 4530
Computer GraphicsMore on InputlWe mentioned 3 modes last time Sample Event RequestSeptember 11, 2002Types of InputlPicks and Locations in OpenGLl lGenerally broken into 6 types locatorl l l l l lbrings back a location or
Toledo - EECS - 4530
Getting Started With OpenGLPrimitivesOpenGL supports a number of primitives that include: Points (GL_POINTS) Lines (GL_LINES), Line Strips or Polylines (GL_LINE_STRIP), and Line Loops (GL_LINELOOP) Triangles (GL_TRIANGLES), Triangle Strips (G
Toledo - EECS - 4530
What is an Attribute Primitives and AttributesSeptember 4, 2002nAn attribute changes the appearance of a primitive.n n n n nColor Line type (dotted, dashed, etc.) Line width filled or unfilled (polygon) italic, bold, or plain (text)Changing
Toledo - EECS - 052005
cone 10.0 0.0 10.0 2.0 10.0cylinder -10.0 0.0 10.0 2.0 10.0sphere -10.0 0.0 -10.0 3.0sphere 10.0 0.0 -10.0 3.0cylinder 100.0 0.0 0.0 3.0 10.0cylinder -100.0 0.0 0.0 3.0 10.0cylinder 0.0 0.0 100.0 3.0 10.0cylinder 0.0 0.0 -100.0 3.0 10.0
Toledo - EECS - 2000
Ethics Report - PrivacyTopics: Spam Free Speech or Invasion of Privacy? Is Online Speech Protected as Free Speech? RFID's and Privacy Is it Much Ado About Nothing? Satellite Photos Is Somebody Watching? GuidelinesAgain, 3-5 pages double
Toledo - EECS - 2000
Company ReportAssigned CompaniesIntel General Electric Hewlett-Packard Sun Microsystems Keithley Instruments First Energy Corporation IBM EE/CE/CS EE/CE EE/CE/CS CE/CS EE/CE EE/CE/CS EE/CE/CSReport GuidelinesShould be about 3-5 pages double spac
Toledo - EECS - 1570
Take a Grammar and Generate StringsProject 5March 31, 2005 Depending on the underlying complexity of the grammar this could generate some very convincing text. (Of course parts may be pure garbage as well)Derivations Using the grammar on the
Toledo - EECS - 1570
Some Changes Sorted Lists Array BasedEECS 1570 Spring 2005 Adds and Deletes must be done differently than in our unsorted version Searches can be done more efficiently Most of the rest is unchanged.Add An add is going to take a couple of step
Toledo - EECS - 1570
Big O notation As mentioned earlier we rate algorithms and data structures on their running time. Normally depends on the number of items in the structure. Common Operations: Adding Searching DeletingOrder of OperationsEECS 1570: Linear Data
Toledo - EECS - 1570
Merge SortAlgorithmTo do the merge we will split it into 3 cases. Two easy cases:If the first list is empty you just need to copy the second list over to the new, sorted list. If the second list is empty you just need to copy the first list
Toledo - EECS - 4980
JavaApril 7, 2003Tip of The Day Dialog Boxes Often one wants to put up a dialog box that must be completed before continuing. JOptionPane class in Swing provides this functionality Different Types of Dialogs are SupportedA Quick Sampleimpor
Toledo - EECS - 1570
&lt;sound bite&gt;&lt;sound bite&gt; &lt;catch phrase&gt; &lt;vague platitude&gt; &quot; You're no &quot; &lt;impressive person&gt; &quot;!&quot;&lt;catch phrase&gt; &quot;Read my lips: &quot;&lt;catch phrase&gt; &quot;As &quot; &lt;impressive person&gt; &quot; always said: &quot;&lt;vague platitude&gt; &quot;no taxes! &quot;&lt;vague platitude&gt; &quot;nuke &quot; &lt;some
Toledo - EECS - 1570
Test GroupThis is a test group for the fourth project to checkif the read functions workTest Message 1IshmaelWed Mar 09 15:15:59 EST 2005Hey mjan, I just got a job on a ship out of Nantucket!Cool! Ishy Bill Wed Mar 09 16:15:43 EST 2005
Toledo - EECS - 1570
The Doubly-Linked ListAdding before the current element.Double Linked ListcurrentMarch 17, 2005DoubleLinkElement newElement = new DoubleLinkElement( ); newElement.setNext(current); newElement.setPrevious(current.getPrevious( ); current.setPre
Toledo - EECS - 1570
Definitions Hash Function A function used to manipulate the key of an element in a list to identify its location in the list. This can be as simple as picking the first letter of a string, the last two digits of a year, or some such value. A good
Toledo - EECS - 1570
Project 3 Linear Data Structures Say Cheese! Due: March 3, 2005Description:In this project you are going to design and implement a program to guide the new RC4000 robotic mouse through a maze to find a hunk of virtual cheese. The mouse can move n
Toledo - EECS - 1570
EECS 1570: Linear Data Structures - Project 1 : Automated Menu Due: Thursday January 27, 2005Background This project is meant for you to brush up your programming skills and possibly use some of the Java programming techniques that are discussing in
Toledo - EECS - 1570
Links Lab Linear Data StructuresGoalIn todays lab we will try construct a set of routines for a stack and a queue using linked structures.Procedure:Two completed classes and two skeletons are available for download from the class website at htt
Toledo - EECS - 1570
Course Timetable EECS 1570: Linear Data StructuresThis timetable is only a guess as to the timing and ordering of topics and may change during the term. As projects are distributed in class and prior to the midterm we will verify the dates in class.
Toledo - EECS - 1570
Automated Text Generator Project 5 Linear Data Structures Due: April 19, 2005DescriptionIn this project you will write a program that will input a grammar that describes a system of productions (a grammar) that will generate a story, a joke, or an
Toledo - EECS - 1570
Project1 Graded out of 125 points Most common problem menu only printed at start of program. Other problems: Items on menu. We specified 200 in class with possibly 10 choices or 5 sizes. Read the file but don't use it Missing pieces (like orde
Toledo - EECS - 1570
Thursday's ClassTest 1 Example Questions &amp; ReviewLinear Data Structures Spring 2005 We will meet in the Sun lab (NE 1026) on Thursday from 2:00-3:15. The lab will go through linked structures for stacks and queues. If you need to attend the Job
Toledo - EECS - 1570
Test 1 Answers ResultsHigh Average Median 94 78 81Spring 2005 Linear Data StructuresProject 2 StatsQuestion 1public double occupancy( ) { int i, occupied; occupied = 0; for (i = 0; i &lt; values.length; i+) { if (values[i] != null) { occup
Toledo - EECS - 1570
Reading Information in Java Software EngineeringEECS 1570 Spring 2005 In Java, assume we want to read from the console. You should probably create a BufferedReader to allow you to read lines. In Java, the Buffered Reader reads lines well but doesn't
Toledo - EECS - 1570
HeapsText DefinitionThe heap is a complete binary tree where each elements value is greater than the values of each of its children.All Sorts of SortsApril 7, 2005Now, all I have to do is define children, binary tree, complete binary tree, etc
Toledo - EECS - 1570
MenuItemimport java.io.BufferedReader; import java.io.IOException; /* * @author Jerry Heuring * Created on January 7, 2005 * * This is a base class representing a simple menu item. This * version will use inheritance to handle the refinements for *
Toledo - EECS - 1570
JFrames GUI's and Java A Quick IntroEECS 1570 Spring 2005 A JFrame is the basis of almost any GUI. Can have an instance variable that is a JFrame or you can extend the JFrame class. There are times when each is of value.JFrame Basics JFrames a
Toledo - EECS - 1570
Project 1 DiscussionQuestions? Sizes? I told you that you could use arrays but I didn't give you any maximum numbers of items they needed to hold. Menu items : 200 maximum Options (no cost) : 10 maximum Sizes (different costs) : 5 maximumProject 1
Toledo - EECS - 1570
Lab Hours Dynamic ArraysEECS 1570 Linear Data Structures Fall 2005 Friday 1/21/2005 Monday 1/24/2005 Tuesday 1/25/2005 Wednesday 1/26/20052:00-4:00 PM 1:00-3:00 PM 3:30-5:30 PM 9:00-10:00 AM 1:00- 3:00 PMLab: NI 1072Normal Steps in Maki
Toledo - EECS - 1570
We Can Use Recursion to Do BacktrackingRecursion - ContinuedMarch 29, 2005 Our backtracking in the maze earlier, we can use recursion to do the same thing without an (explicit) stack. The actual layout of the program may not change much.Some
Toledo - CSET - 3150
Algorithm sC ET 3150 SAlgorithm sTopics De finition of an Algorithm AlgorithmExam s ple S yntax ve S m rsus e antics Re ading C ourseWe page b sProble S m olvingProble solving is theproce of transform the m ss ing de scription of a proble int
Toledo - MATH - 1330
Each quiz is worth 9 points. Quiz 30 Dec 10 Find the exact value of: 1. tan -1 ( - 1 ) 2. Arc tan 3 3. tan -1 0 Scores: 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0 Quiz 29 Dec 8 Find the exact value of: 2 3 -1 1. c
Toledo - MATH - 1850
MATH-1850 Exam 2 Summer 2001Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers are to be exa
Toledo - MATH - 1850
Quizzes Given Fall 2006 Quiz 41 December 5 From a point on the ground, which is 100 feet from the base of a building, the angle of elevation to the top of the building is measured to be 60 with a possible error of 1. a. Find the approximate error in
Toledo - MATH - 1850
MATH-1850 Quiz Scores as of October 23 Grade Summary Sheet: These scores are the result of Quiz 1 through Quiz 15. Each quiz is worth 9 points. After dropping the four lowest quiz scores, there is a maximum of 99 points. As of October 16, the class h
Toledo - MATH - 1850
Quizzes Given Spring 2007 Quiz 42 April 23 2 Evaluate (cos + 5 csc ) d Quiz 41 April 20 Evaluate 2 5 u3 (3u5-+ 6) duQuiz 40 April 19 From a point on the ground, which is 40 yards from the base of a building, the angle of elevation to t
Toledo - MATH - 1850
MATH-1850 Quiz Scores as of November 25 Grade Summary Sheet:These scores are the result of Quiz 1 through Quiz 27. Each quiz is worth 9 points. After dropping the four lowest quiz scores, there is a maximum of 207 points. As of November 20, the clas
Toledo - MATH - 1850
MATH-1850 Final Quiz Scores: These scores are the result of Quiz 1 through Quiz 33. Each quiz is worth 9 points. After dropping the four lowest quiz scores, there is a maximum of 261 points. As of the last day of class, the class met 29 days for a to
Toledo - MATH - 1850
MATH-1850 Exam 3 Fall 2005Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers are to be exact
Toledo - MATH - 1850
MATH-1850 Exam 3 Spring 2005Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers are to be exa
Toledo - MATH - 1850
MATH-1850 Exam 3 Fall 2004Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers are to be exact
Toledo - MATH - 1850
MATH-1850 Exam 3 Summer 2001Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers are to be exa
Toledo - MATH - 1850
MATH-1850 Exam 3 Form A Fall 2001Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers are to b
Toledo - MATH - 1850
MATH-1850 Exam 3 Spring 2004Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers are to be exa
Toledo - MATH - 1850
MATH-1850 Exam 1 Fall 2000Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers must be exact.
Toledo - MATH - 1850
10.A rectangle is inscribed in an isosceles triangle whose base is 48 feet and sides are 30 feet. If two of the vertices of the rectangle lie on the base of the triangle, then express the area of the rectangle as a function of one variable.3030
Toledo - MATH - 1850
MATH-1850 Exam 1 Fall 2005Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers must be exact.
Toledo - MATH - 1850
MATH-1850 Exam 2 Fall 2005Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. The point value for each pr
Toledo - MATH - 1850
MATH-1850 Exam 2 Spring 2005Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers are to be exa
Toledo - MATH - 1850
MATH-1850 Exam 2 Fall 2006Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers must be exact.
Toledo - MATH - 1850
MATH-1850 Exam 2 Spring 2004Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. The point value for each
Toledo - MATH - 1850
MATH-1850 Exam 4 Summer 2003Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers are to be exa
Toledo - MATH - 1850
MATH-1850 Exam 1 Summer 2003Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers must be exact
Toledo - MATH - 1850
MATH-1850 Exam 2 Summer 2003Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers are to be exa
Toledo - MATH - 1850
MATH-1850 Exam 4 Summer 2001Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers are to be exa
Toledo - MATH - 1850
MATH-1850 Exam 1 Summer 2001Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers must be exact
Toledo - MATH - 1850
MATH-1850 Exam 3 Fall 2000Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. All answers are to be exact
Toledo - MATH - 1750
MATH-1750 Quiz 1 Spring 2001Name _SOLUTIONS_ S.I.D.# _INSTRUCTIONS: You must show enough work to justify your answer on ALL problems. Correct answers with no work (or inconsistent work) shown will not receive any credit. The point value for each
University of Alaska Fairbanks - WLF - 625
MLEs That Cannot Be Put In Closed FormThe notion of equations that do not have an analytical &quot;solution&quot; often seems odd when a person first encounters the issue. To motivate this matter we will consider a model useful in estimating the size (N) of a
University of Alaska Fairbanks - WLF - 625
Monte Carlo SimulationMonte Carlo simulation is useful for understanding the properties of a model, either under the assumptions of the model, or under other assumptions (i.e., under a different model). In addition, such simulation can be useful in