Documents Found!
As seen in
Less Work, Better Grades
Join
Course Hero
Access
best resources
Ace
your classes
Ace your courses with Course Hero!
|
|
|
Limited, unformatted preview (showing 83 of 1060 words):
...460 CSc Database Design Fall 2008 (McCann) http://www.cs.arizona.edu/classes/cs460/fall08 Program #1: Text to Binary File Conversion Due Date: September 9 th , 2008, at the beginning of class Overview: In the not to distant future, you will be writing a program to create an index on a binary le. I could just give you the binary le, or merge the two assignments, but after a long summer, creating the binary le from a generically formatted text le makes for a nice shake o ...
Study Smarter, Score Higher
Here are the top 5 related documents
...Implementing Remote Procedure Calls
ANDREW D. BIRRELL and BRUCE JAY NELSON Xerox Palo Alto Research Center
Remote procedure calls (RPC) appear to be a useful paradig m for providing communication across a network between programs written in a high-l...
...BAR Fault Tolerance for Cooperative Services
Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement Mike Dahlin, Jean-Philippe Martin, Carl Porth
University of Texas at Austin - Dept. of Computer Science 1 University Station C0500 Austin, Texas
{anand,lor...
...Purposes of Replication
Practical Replication
l
Improve Availability
l
Replicated databases can be accessed even if several replicas are unavailable Replicas can be geographically diverse, with closest replica serving each client
l
Improve Perf...
...IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. XX, NO. Y, MONTH 2002
100
Scribe: A large-scale and decentralized application-level multicast infrastructure
Miguel Castro, Peter Druschel, Anne-Marie Kermarrec and Antony Rowstron
Abstract Thi...
Document Content (unformatted)
Course Hero has millions of student submitted documents similar to the one
below including study guides, homework solutions, papers, exam answer keys and textbook solutions.
460 CSc Database Design Fall 2008 (McCann) http://www.cs.arizona.edu/classes/cs460/fall08 Program #1: Text to Binary File Conversion Due Date: September 9 th , 2008, at the beginning of class Overview: In the not to distant future, you will be writing a program to create an index on a binary le. I could just give you the binary le, or merge the two assignments, but after a long summer, creating the binary le from a generically formatted text le makes for a nice shake o the rust assignment, plus it provides a gentle (?) introduction to binary le processing. A binary le is just a le that contains information in the same format in which the information is held in memory. (In a standard text le, all information is stored as ASCII or UNICODE characters.) As a result, binary les are faster and easier for a program to read and write than are text les. As long as the le doesn t need to be read by people or ported to a di erent type of system, binary les are often the best way to store program information. For this program, we have lines of data items that we need to store, and each line s items need to be stored as a group (in a database, such a group is called a record ). Making this happen in Java requires a bit of e ort; Java wasn t originally designed for this sort of task. By comparison, systems languages like C and C++ can interact more directly with the operating system and provide more convenient le I/O. On the class web page you ll nd a sample Java binary le I/O program, which should help you gure out what needs to be done. Assignment: Linked to the class web page is a le named 2008_FE_guide.csv. This is a le consisting of over 1200 lines of data on automobile fuel economy for the 2008 model year, courtesy of the U.S. Department of Energy and the U.S. Environmental Protection Agency. Using Java, write a program that: 1. 2. 3. 4. Creates a binary version of the text le Closes that binary le Re opens the same binary le (for read access) Reads and prints to the screen the content of the rst ve records of data and the last ve records of data in the binary le, along with some statistics (see the details in the Output section, below). Data: The data le name and location are given in the Assignment section, above. Your program can read the le directly out of that directory; just use the complete path name of the le when you open the le. There s no reason to waste disk space by making a copy of the le in your account. Each of the 1200+ lines in the le contain 31 elds (pieces) of information, separated by commas (thus the .csv le extension: Comma Separated Values). Here is a sample line: TWO SEATERS,ASTON MARTIN,V8 VANTAGE,4.3,8,Auto(S6),R,12,13,20,15,16.1945,27.4018,19.8474,P,G,,,,,,,,,3002, ,4MODE ,4,1,6-Aug-07,DERIVED The rst line of the le has abbreviated eld descriptions. Additional explanation of these elds is available from the le 2008_FE_guide.txt, also available from class the web page. I ve provided the URLs of the sources of this information below, and linked them to the class web page. Note that the line of descriptions is not to be stored in the binary le; we only want data stored in that le, not descriptions of the data (a.k.a. metadata). (Continued...) Output: Your program needs to create the binary le, of course. The required on screen output is the (ASCII) content of the rst ve and last ve lines of processed data, along with the total number of data records processed (don t count that rst description line of the .csv le), and the Manufacturer and Car Line of both the car with the highest COMB MPG (GUIDE) and the car with the lowest COMB MPG (GUIDE). You are welcome and encouraged to add additional output if you have extra time and ambition (e.g., time required for the processing, mean eet MPGs, etc.). The format of the output is up to you, but the output should be easy to read Hand In: You are required to submit your completed program le(s) using the turnin facility on lectura. The submission folder is cs460p1. Instructions are available from the document of turnin instructions linked to the class web page. Name your main program source le Prog1.java so that we don t have to guess which les to compile, but feel free to split up your code over additional les if you feel that doing so is appropriate. Want to Learn More? http://www.fueleconomy.gov/feg/download.shtml The page with links to the fuel economy data. http://www.fueleconomy.gov/feg/epadata/Readme.txt The incomplete and sloppily formatted descriptions of the data elds. Other Requirements and Hints: Don t hard code values in your program if you can avoid it. For example, don t assume a certain number of records in the input le or the binary le. Your program should automatically adapt to simple changes, such as more or fewer lines in a le or changes to the le names or locations. For example, we may test your program with a le of just 3 lines. We expect that your program will handle this situation gracefully. Once in a while, a student will think that create a binary le means convert all the data into the characters 0 and 1 . The binary I/O functions in Java will read/write the data in binary format automatically. Wondering how to e ciently get the last ve records from a binary le? Remember: The Java API is your friend! Comment your code according to the style guidelines as you write the code (not an hour before class!). The requirements and some examples are available from: http://www.cs.arizona.edu/~mccann/style.html You can make debugging easier by using only a line or two of data from the .csv le for your initial testing. Try running the program on the complete le only when you can process that reduced data le successfully. Finally: Start early! File processing is often tricky. Also, after the long, relaxing summer, your programming skills are probably a little stale.
Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more.
Course Hero has millions of course related materials that will enable you to learn better,
faster and get an A in all your courses.
Below is a small sample set of documents:
Below is a small sample set of documents:
Arizona >> CS >> 460 (Fall, 2009)
CSc 460 Database Design Fall 2008 (McCann) http:/www.cs.arizona.edu/classes/cs460/fall08/ Homework #3: SQL Queries Due Date: October 30 st , 2008, at the beginning of class System Requirement: You MUST use our local Oracle DBMS installation for thi...
Arizona >> CS >> 460 (Fall, 2009)
t11o01: Lifetime of a Query DBMS Catalog Information Optimizer SQL Query Scanner/ Parser Query In Intermediate Form Candidate Plan Generator Cost Estimator Logical Query Plan Code Generator Query Execution Code Query Processor Query Result t1...
Arizona >> CS >> 460 (Fall, 2009)
CSc 460 Database Design Fall 2008 (McCann) http:/www.cs.arizona.edu/classes/cs460/fall08/ Program #3: Embedded SQL and JDBC Due Date: December 9 th , 2008, at the beginning of class Overview: Embedded SQL is nice for applications that require more ...
Arizona >> CS >> 460 (Fall, 2009)
CSc 460 Database Design Fall 2008 (McCann) http:/www.cs.arizona.edu/classes/cs460/fall08/ Homework #1 (110 points) Due Date: September 30 th , 2008, at the beginning of class Remember: All homeworks in this class must be electronically submitted (v...
Arizona >> CS >> 460 (Fall, 2009)
Errata for Fundamentals of Database Systems, 5th Edition, First Printing Compiled by Ramez Elmasri 1. Page 117: In Figure 4.8, there is a double line between the BANK box and the U circle. This should be changed to a single line (as it was in Figure ...
Arizona >> CS >> 460 (Fall, 2009)
t05o01 (1/1) t05o01: Tuple Relational Calculus (TRC) Relevant Schemas: DEPARTMENT DeptNum DeptName ManagerID ManagerStartDate EMPLOYEE Surname GivenName EmpNum DeptID Salary S S# Sname Status City P P# Pname Color Weight City SP S# P# Qty 1. What ...
Arizona >> CS >> 460 (Fall, 2009)
CSc 460 - Database Design Fall 2008 (McCann) http:/www.cs.arizona.edu/classes/cs460/fall08/ Homework #4 (115 points) Due Date: Monday, November 10 th , 2008, at 3:30 p.m. Remember: All homeworks in this class must be electronically submitted (via `t...
Arizona >> CS >> 460 (Fall, 2009)
Solutions for Functional Dependencies Assessment Wayne Sun December 11, 2003 1. Armstrongs Axioms (Use chart in back) Use Armstrongs Axioms to prove the Armstrong Rules: a. If XY and YWZ then XWZ Solution: (Note: Solutions refer to chart) a. XY b. XW...
Arizona >> CS >> 460 (Fall, 2009)
CSc460 (Database Systems) Assignment 5 Solutions Fall 2007:14 Question 1 Express the following queries in relational algebra, domain relational calculus, and tuple relational calculus, using the relations handed out in homework 4 solution. Attempt...
Arizona >> CS >> 460 (Fall, 2009)
CSc460 (Database Systems) Assignment 8 Fall 2007:16 Handed out: Thursday November 1, 2007 Due: Thursday November 15, 2007 (turnin on lectura by 11:59pm) 1 Overview For this assignment you are asked to develop a UA CATS application using Oracle ...
Arizona >> CS >> 460 (Fall, 2009)
CSc 460 (Database Systems) Webreg Conceptual Schema FaI1 2007:8 \\ Deg\\ G , . s t\\ ,\") Lsr.c.-) 1.s-s(.) - !:*-) ( c\\- c<t\\-r 9- (- \ -.( \\ /\' (> / t r-,f ) I!\". (or { ...
Arizona >> CS >> 460 (Fall, 2009)
t03o01 (1/1) t03o01: The SuppliersPartsProjects Database (from C.J. Dates An Introduction to Database Systems) Schema: S P J SPJ S# P# J# S# Sname Pname Jname P# J# Status Color City Qty City Weight City Values: S S# S1 S2 S3 S4 S5 P# P1 P2 P3 P4 ...
Arizona >> CS >> 460 (Fall, 2009)
Assignment Class Prepared by Homework #1 CSc 460, Database Systems Amit Shrestha 1. Exercise 1.12. Cite some examples of integrity constraints that you think should hold on the database shown in Figure 1.2. There are numerous : Every record in GRA...
Arizona >> CS >> 460 (Fall, 2009)
t08n01 (1/1) t08n01: PostgreSQL API #1: ecpg (Embedded SQL) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 #include <stdio.h> #include <string.h> EXEC SQL include sql...
Arizona >> CS >> 460 (Fall, 2009)
t02o01: Sparse and Dense Primary Indices University Eau Claire Green Bay La Crosse Madison Milwaukee Oshkosh Parkside Platteville River Falls Stevens Point Stout Superior Whitewater RID University Eau Claire Green Bay La Crosse Madison Milwaukee O...
Arizona >> CS >> 460 (Fall, 2009)
CSc 460 (Database Design) Visitor_Name (1,n) CREATES (1,m) UA CATS: EER Schema Style Title Artifact_ID# Fall 2007: 8 ARTIFACT Dimensions Image VISITOR Width Height Length (0,m) (0,1) (0,n) COMMISSIONS (0,p) O Comm. Price Gender DoB IS_OWNED _BY ...
Arizona >> CS >> 460 (Fall, 2009)
CSc460 (Database Systems) Assignment 9 Fall 2007:18 Handed out: Thursday November 15, 2007 Due: Thursday December 6, 2007 (turnin on lectura by 11:59pm) 1 Overview Your assignment is to create a subset of the UA CATS web application. You are to...
Arizona >> CS >> 460 (Fall, 2009)
Functional Dependencies Assessment Wayne Sun December 11, 2003 1. Armstrongs Axioms (Use chart in back) Use Armstrongs Axioms to prove the Armstrong Rules: a. If XY and YWZ then XWZ b. If XY and XZ then XZ c. If XYZ then XY and XZ 2. Consider the re...
Arizona >> CS >> 460 (Fall, 2009)
CSc 460 (Database Design) INFORMATION Fall 2007:1 COURSE Section 1 (3:30-4:45pm T TH) The course will be held in Gould-Simpson 906. DESCRIPTION 460. Database Design (3). This is a broad coverage course whose primary purpo...
Arizona >> CS >> 460 (Fall, 2009)
CSc 460 (Database Systems) Assignment 2 Solutions Fall 2007:5 5. Name four relationships each between *two* tables of the database shown in Figure 1.2 (p.8) in the text book (Database Systems Fifth Edition). The database in Fig...
Arizona >> CS >> 460 (Fall, 2009)
CSc 460 (Database Systems) Assignment #1 Fall 2007:3 Handed out: Tuesday, August 21, 2007 Due: Tuesday, August 28, 2007 Write a two-page (single- or double-spaced) essay on some behind-the-scenes use of database techn...
Arizona >> CS >> 460 (Fall, 2009)
1. Enter an artifact 2. Enter an institution 3. Print artifact with specific ID 4. Print institutions and what artifacts they own Q. Quit the program Enter 1-4 or Q to Quit: 1. Enter an artifact 2. Enter an institution 3. Print artifact with specific...
Arizona >> CS >> 460 (Fall, 2009)
CSc 460 (Database Systems) Assignment 4 Solutions Fall 2007:11 1. Map the EER schema of the UA CATS system into tables, and indicate the primary key and foreign keys. Use the following format to write your tables: Relation(Attr...
Arizona >> CS >> 460 (Fall, 2009)
1. Enter an artifact 2. Enter an institution 3. Print artifact with specific ID 4. Print institutions and what artifacts they own Q. Quit the program Enter 1-4 or Q to Quit: Enter artifact ID: Enter title: Enter image: Enter width: Enter height: ...
Arizona >> CS >> 460 (Fall, 2009)
1 12345 Raft of the Medusa ./medusa.jpg 8 193.3 282.3 3 12345 Q...
Arizona >> CS >> 352 (Fall, 2008)
Final Version August 26, 2008 CSc 352 Systems Programming and UNIX Final Version Fall 2008, Tuesday-Thursday, 5:00 - 6:15 p.m. Description: Programming in C, including single and multi-dimensional arrays, lists, stacks, queues, trees, and bit ma...
Arizona >> CS >> 352 (Fall, 2008)
Pointer Review Starting address Base type Pointer Arithmetic and Arrays Stanley Yao Computer Science Department University of Arizona void * * operator Size of the value Size of the pointer Size of the value Csc352-Summer03, Stanley Yao 2 Pointer...
Arizona >> CS >> 352 (Fall, 2008)
Cs352 Homework #9 C-shell scripts, awk and a bit signales April 25, 2004 Due Time: 29/4/04 (9:00PM). Submission in pairs is NOT allowed. Turnin ID: cs352 assg9 Turnin Files: indent.awk lines summation check hw 1. Create an awk le, called indent.awk...
Arizona >> CS >> 352 (Fall, 2008)
Numbers in Computers Analog .vs. digital Digital numbers break-downs Bit Operations Stanley Yao Computer Science Department University of Arizona Number Byte Bit Word: length is decided by the register size On lectura (32-bit Machine): 1 word= 4 b...
Arizona >> CS >> 352 (Fall, 2008)
Why we need structure? Each student: ID, name, major, year Data structure for each student is compound Structure char *name; int major; int year; BAD IDEAR 4 pieces of ...
Arizona >> CS >> 352 (Fall, 2008)
Outline OS Basics Shell Basics Process I/O, Redirection & Pipe Unix Basics Stanley Yao Computer Science Department University of Arizona Csc352-Summer03, Stanley Yao 2 What is Operating System? People Word processor Web browser etc. Compilers She...
Arizona >> CS >> 352 (Fall, 2008)
Process Memory Layout malloc(): Dynamic Memory Management Stanley Yao Computer Science Department University of Arizona Heap meets stack? Access the unused space? low Code Data BSS Heap unused Write protected Stack high Csc352-Summer03, Stanley...
Arizona >> CS >> 352 (Fall, 2008)
Stream A logical model to simplify and unify the complicated I/O behaviors Analogy: unify various device and resource with the same interface files Stream Stream is a sequence of lines A line is a sequence of characters ending with newline C I/O St...
Arizona >> CS >> 352 (Fall, 2008)
{ u t P P y T R R T h h wR u X Q @hQ\'hD\'E@h@Dd1Uuvt16y yhfxQvRhvSTxhDQHwqSBxuyxPYhDhs6d@q hhq 1h)\'1De1\'4\'f\'Difq4w3\'zfxfSq)zueQ@xSPh evzTwQcHlrlvuvt16yfUSTchDqH)3SuUhSTy\'g T u h h P w u P u u t R R y P q q pq `G Go rro ...
Arizona >> CS >> 352 (Fall, 2008)
Problems There is a very complicated computation that takes a very very long time, in order to let the user know the program is working hard on the computation instead of hanging, we want to print a . on the screen every second while doing the comput...
Arizona >> CS >> 352 (Fall, 2008)
! \"# $ % ! * ) # \' \' ( ) # + ,- ./ :; ; 4 ! \"# $ % > -0 A ? 2) @ F ) 2 -) D # B 0C F F ) ) 2 2 EEE E E E EE E EEEE E E E E E F ) F ) 2 F 2 )...
Arizona >> CS >> 352 (Fall, 2008)
y h 75) 7)\' 75) B B wo1bu j6(b23dwq g 0(82fDb \' 1 1 A \' 1 ) u \' 1 h) \' 1 p \' 1 A \' (o0q\'8% XC5(3eC5R(C5iA2 qh8(wl3XC5oA(bFi\'8ijq%b23Xqd&F3r`3t1R3\'ChXlD`(d(bFi5!2C\'j(30bD2) \' B%5 \' 1 1 hn ...
Arizona >> CS >> 352 (Fall, 2008)
! \" # \" # % ! % ( , , ./ ( \" 1 31 * 02 4 + 5 *6 5 8 , 7 6 6 65 5 9 * + + * + ) : 1 31 * ( + 02 4 ; \" 1 31 * 02 4 # ( + ; \" 1 31 * + 02 4 ; \" 1 31 * ( 02 4 + ; \" 1 31 * # + 02 4 ; \" 1 31 * # 02 4 # + ; \" 1 3 1 * #+ 02 4 ; \" 1 31 ...
Arizona >> CS >> 352 (Fall, 2008)
s tiHmjh(hxUVXHVfVrtg8rdyf}V9rxirz8iHmjh(hxe ` ` ep cm` e zm cl m} Xk w ` ` ` m u l pXk h h sm e e } } pm ` u c pmw pXk h e l `w ijk(rfcDPfsViVjwxtu2 VDX(uj`Vr9xik(fkfpr9eVwxfurUPfsViVjwHmrikDVda k q ` u e sm e e } ` u u m 6jsi2Vwrk5Drg...
Arizona >> CS >> 352 (Fall, 2008)
Difficulty A large C project 30 source directories 50 files in each directory on average Make / Makefile Stanley Yao Computer Science Department University of Arizona Difficulty 1: Please compile all the files in all the directory and then link all...
Arizona >> CS >> 352 (Fall, 2008)
First problem Point location and Persistent Data structures Alon Efrat Computer Science Department University of Arizona Given a subdivision of the plane into triangles, create a data structure, such that given a query point, we can find in which tr...
Arizona >> CS >> 352 (Fall, 2008)
Alias alias name commands Give another name to a command or command sequence Why? Make your commonly used command sequences short and convenient to use alias disk du -sk /net/sal/home/yao/ Advanced C Shell Stanley Yao Computer Science Department Uni...
Arizona >> CS >> 352 (Fall, 2008)
Command Line Arguments Functions have arguments Caller specify arguments when calling the function main() function also have arguments Who specifies arguments for main()? Examples: Most UNIX tools take command line arguments cp r dir1 dir2 Csc352-Sum...
Arizona >> CS >> 352 (Fall, 2008)
! \" ! \" % ! ! $ \' $ ! #$ ! #$ ! $ $ 9 $ \'! ) ! ! ; ) : : ; ; ) ! )\' 7 ; \" : > \" ?> = > 9 ?> > > > > 8...
Arizona >> CS >> 352 (Fall, 2008)
\" $ # $ # # * % *. % / ) / 0# \" 1 % . % # 2 3 0 4 5 7# 6 #8 1 4 9 6 5 ) \' ( ! \" # # ; 4 4 # , ; # # # , # ; # 4 4 \' ( # * 5 6 1 ) , , 4 1 # %) < # %) % = < 3 # % ) % # % ) % # %) % # % 3 ...
Arizona >> CS >> 352 (Fall, 2008)
Cs352 Homework #11 Optional tries visualization May 21, 2004 Due Time: 6/21 (9:00PM). Name your le tt ptrie.c. Submission in pairs is allowed and encouraged. The problem is to show how a trie is changing, while it changes. The output, i.e. command...
Arizona >> CS >> 352 (Fall, 2008)
A E GyRBT(TG7Eu(w(ttDyuEEuGBRDBBDRR t D(DTB QvBtR{BBuEv E bk(BT(7BTE7 t EtEtu 3 \' x(b%0(bh n \' yd \' h h `r la a a \' h y h h WA \' yd \' h 1 H 72pR4%7G(b4cy7vux97(4%G7&Rxxhxbn`7s3 \'a \'l 1 \'g 3%...
Arizona >> CS >> 352 (Fall, 2008)
CSc 352 Assignment 0 Version 1.1 January 15th, 2008 Assignment 0: emacs vs. vi, csh vs. ksh Complete assignment due: Tuesday January 29th, 1:59 p.m. Problem 1 (20 points): Java and command-line arguments. For this problem, you are to parse the UN...
Arizona >> CS >> 352 (Fall, 2008)
The object of this assignment is to familiarize yourself with recursion, executing UNIX commands from another program, system calls, using the file manipulation facilites of C, Makefiles, HashTables, dynamic memory allocation, more modules, makefil...
Arizona >> CS >> 352 (Fall, 2008)
The object of this assignment is to familiarize yourself with HashTables, dynamic memory allocation, more modules, makefiles and valgrind. (Son of \"There are still no donuts to be counted for this assignment\") The assignment is due April 1st at 11:...
Arizona >> CS >> 352 (Fall, 2008)
The object of this assignment is to familiarize yourself with some of the basics of C: scanf, printf, for loops, case statements, if statements and counting donuts. The assignment is due February 7th at 1:59 pm. The assignment will be turned in ...
Arizona >> CS >> 433 (Fall, 2009)
aowx7ax7H) rvoVw)gqacSUYrVgiqUvaUbQxwpFwaUVUfacVRivg ` g Qs v TV p d T Sds b Q S pl e db d ` vcvCUeufHTfH`f`v%afHdcVfUdSwoqTUIdHfUvfabdqHc`Cu v Q d m v ` u V d QT m `s d S e l` v T d Q ` v` S Qb d 6 866 uI9uwG T SsdsV H...
Arizona >> CS >> 433 (Fall, 2009)
Syllabus and directions for the nal exam The material includes almost all the subjects discussed in class, since the discussion about z-bu er algorithm for nding occlusions between objects. 1. Accumulation bu er. 2. lighting a Ambient re ection b Di ...
Arizona >> CS >> 433 (Fall, 2009)
4Q rb yr w qa\"tr d i f htwU1UP\"6 DU38i1 $ r w V n 4 G b 0 Y 4 b G 7 % G V V FcYaatFE3Tya18HUi 3Q i4 g 1UIhI`| 7 CY GG i 7 C2b2 7 CE% 4 ( SY 7% Y A 74 (4 h 2 Y CE b b 8...
Arizona >> CS >> 433 (Fall, 2009)
Ue@f e g \"!h ! g e $f!e e 7 008 ` 06 7A 7 06 5 2A69( ` 5 2 2 2 P P 5 1$(FUb233!(Uy3BAU2@0F@U8y318s@U83$0FF6 5$8Dd1U$2FU`2yAFVy30FVUPF@8FSWFDAy1U(1W1c(FFFC3FyAd8@U4@FcQ1F$5U27 2A6 7 7 E P( 7 C0 P 5 6 X 5 2 ( b P 5 8 0 E C 29 76 ( C ( (...
Arizona >> CS >> 433 (Fall, 2009)
HOMEWORK #4 This assignment may be done in teams of two. Due Thu 11/13, 2008 by 11:59PM. mobile like the one The turnin name is cs433_hw4. The objective of this assignment is to articulate a hierarchical model using a scenegraph and to explore a si...
Arizona >> CS >> 433 (Fall, 2009)
HOMEWORK #1 Abstract. This exercise explores a fundamental process in computer graphics: how we construct 2D images, consisting of discrete pixels, from a 3D scene. For this assignment, you\'ll to write a program that animates a plate rotating around ...
Arizona >> CS >> 433 (Fall, 2009)
COMPUTER GRAPHICS: HOMEWORK #6 DUE 10/12/08 1. An Introduction to the Programmable GPU. The programmable GPU is a very powerful and versatile tool for creating realistic graphical environments in realtime. In this assignment, you will be upgrading t...
Arizona >> CS >> 433 (Fall, 2009)
HOMEWORK #3 This assignment may be done in teams of two. Due October 25, 2008 by 11:59PM. This assignment is a continuation of hw1 and hw2, but with more reliance on the 3D rendering capabilities of OpenGL, including the Z-buer, transformations with ...
Arizona >> CS >> 433 (Fall, 2009)
The Rendering Equation Photorealistic Rendering We\'ll investigate some theoretic that\'s important to the study of photorealistic rendering techniques. Today\'s topics: The Rendering Equation Radiance, Irradiance The Bi-directional Reflectance D...
Arizona >> CS >> 433 (Fall, 2009)
HOMEWORK #2 This assignment may be done in teams of two. Due October 7, 2008 by 11:59PM. The turnin name is cs433_hw2. This homework is a continuation of hw1, with a few major changes. (1) Use perceptive projection, rather than orthographic. Choose ...
Arizona >> CS >> 433 (Fall, 2009)
Computer Graphics Illumination Models & Shading Shading The Physics 2 Local vs. Global Illumination Models Local model direct and local interaction of each object with the light. Global model: interactions and exchange of light energy between dif...
Arizona >> CS >> 433 (Fall, 2009)
Computer Graphics COMPUTER GRAPHICS Winter 2008 Introduction Teaching Staff Lecturer: Alon Efrat Slides courtesy of Kobus Barnard Chraig Gotsman Mon 12:30-14:30 Contact info: Gould-Simpson, Tel: 626-8047, Mon 14:30-15:30 alon@cs.technion.ac.i...
Arizona >> CS >> 433 (Fall, 2009)
Ray Casting p For multiple light sources: I = I a k a + I p k d ( N L p ) + k s ( R p V ) n p ( ) Image precision algorithm For each pixel cast a ray r into the world Find intersection point p of r with with closest surface. Find color of...
Arizona >> CS >> 433 (Fall, 2009)
Hierarchical modeling Consider constructing a complex 2d drawing: e.g. an animation showing the plan view of a building, where the doors swing open and shut. Options: Floor Hierarchical modeling Floor Hierarchical modeling Floor Corridoor Adjoin...
Arizona >> CS >> 433 (Fall, 2009)
Quadtrees Alon Efrat Computer Science Department University of Arizona QuadTrees 11 0 1 1. A hierarchical representation of an image. 2. Consider a black/white picture stored on an 2h 2h grid. 3. Each node v corresponds to a region R(v) of the ima...
Arizona >> CS >> 433 (Fall, 2009)
Cs445/Cs545 Materials for the midterm The slides, which you can find on the course webpage, contain most of the material. 1. Transformations (translations, rotations etc) in 2D and 3D, homogenous coordinates. Approximations to rotations. Arbitrary r...
Arizona >> CS >> 433 (Fall, 2009)
v a s ppn !(yyyo y!1# pp x d qs h ~! h %! ~) Y hx) e 3kdpr 2 c W w v m n q P v s m l r 1dji e c a ` v c e r mY Y r v s n e iW w v c e v e l q dbW jp(kddIbdj11pr e W r q r e a W w r q i ...
Arizona >> CS >> 436 (Spring, 2006)
Assignment 0: Worth 5% of the Project Grade Due: Monday, January 28th at 3:59 pm (just before class) To turnin your digital pictures from lectura, type % turnin 436assignment0 takeapart.jpg setup.jpg play.jpg Exactly one person from each gr...
Arizona >> CS >> 345 (Fall, 2008)
Following is the main-method to our test-driver, along with descriptions of what each of the tests performs. If you have any questions, please email mlehew@cs.arizona.edu. Good luck! :) public static void main(String[] args) { / Empty and S...
What are you waiting for?