Computer Science 184 - Fall 1997 - Barsky - Midterm 1

Computer Science 184 - Fall 1997 - Barsky - Midterm 1 -...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: <!--course, exam #, semester/year--> CS 184, Midterm #1, Fall 1997)CS184, Fall 1997 Midterm #1 Professor Brian A. Barksy Fall 1997Foundations of Computer GraphicsProfessor Brian A. Barsky and Adrian SfartiOctober 9, 1997CS184T.A.'s: Lilian Chu, Dan Garcia and Aaron IsaksenMIDTERM EXAMNAME (LAST, FIRST): CS184-: Relax. You have 80 minutes. Remember to pace yourself. Feel free to use the back of each page for additional answer space. Note that not all questions have equal value. Do not panic. GOOD SKILL!(write any comments about the exam here)How well do you believe you did? (Circle the appropriate picture which represents your perceived midterm rank) ;):);}:|:{:(X#QuestionPossibleYour Scorefile:///C|/Documents%20and%20Settings/Jason%20Raft...-%20Fall%201997%20-%20Barsky%20-%20Midterm%201.htm (1 of 8)1/27/2007 5:24:06 PM<!--course, exam #, semester/year--> CS 184, Midterm #1, Fall 1997)115225325435Total100Question 1: Hardware and Scan Conversion (15 points) The diagram shown above shows a colormap system with a N bit deep W wide and H high framebuffer, digital-to-analog converters (DAC) for red, green 1.1) ...the # of pixels on the screen. [1 pt]file:///C|/Documents%20and%20Settings/Jason%20Raft...-%20Fall%201997%20-%20Barsky%20-%20Midterm%201.htm (2 of 8)1/27/2007 5:24:06 PM<!--course, exam #, semester/year--> CS 184, Midterm #1, Fall 1997)and blue which are A, B and C bits wide respectively, and a screen with S triads wide and T triads high. Using the variables above (and assuming nothing about N, W, H, A, B, C, S or T - the diagram above is not to scale), derive an expression for:1.2) ...the # of colors that could ever land on pixel p over time. [2 pts]1.3) ...the # of possible colors on the screen at once. [2 pts]1.4) Up to now, you have always been given a sample point (and two tie-breaking directions) and asked to render polygon primitives. Here we give you the polygon primitives and rendered pixels and ask you to figure out the sample point and two tie-breaking directions. The sample point lies on the edge of the polygon.Hint: The tie-breaking driections do not necessarily have to be horizontal or vertical.do not necessarily have to be horizontal or vertical....
View Full Document

Page1 / 8

Computer Science 184 - Fall 1997 - Barsky - Midterm 1 -...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online