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.

38 Pages

lec34a

Course: COP 3530, Fall 2008
School: University of Florida
Rating:

Word Count: 1210

Document Preview

34 Divide Lecture and conquer 19.1-19.2.1 Reminders/Announcements Assignment 3 due Thursday night Hardcopy due Monday &lt;&lt;&lt;&lt;&lt; NOTE Friday is Harris Day NO CLASS Lectures at 10:40, 12:50 in JWRU Grand Ballrooms D and H Student Reception at 1:45, A and E Divide And Conquer Distinguish between small and large instances. Small instances solved differently from large ones....

Register Now

Unformatted Document Excerpt

Coursehero >> Florida >> University of Florida >> COP 3530

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.
34 Divide Lecture and conquer 19.1-19.2.1 Reminders/Announcements Assignment 3 due Thursday night Hardcopy due Monday <<<<< NOTE Friday is Harris Day NO CLASS Lectures at 10:40, 12:50 in JWRU Grand Ballrooms D and H Student Reception at 1:45, A and E Divide And Conquer Distinguish between small and large instances. Small instances solved differently from large ones. Small And Large Instance Small instance. Sort a list that has n <= 10 elements. Find the minimum of n <= 2 elements. Large instance. Sort a list that has n > 10 elements. Find the minimum of n > 2 elements. Solving A Small Instance A small instance is solved using some direct/simple strategy. Sort a list that has n <= 10 elements. Use count, insertion, bubble, or selection sort. Find the minimum of n <= 2 elements. When n = 0, there is no minimum element. When n = 1, the single element is the minimum. When n = 2, compare the two elements and determine which is smaller. Solving A Large Instance A large instance is solved as follows: Divide the large instance into k >= 2 smaller instances. Solve the smaller instances somehow. Combine the results of the smaller instances to obtain the result for the original large instance. Sort A Large List Sort a list that has n > 10 elements. Sort 15 elements by dividing them into 2 smaller lists. One list has 7 elements and the other has 8. Sort these two lists using the method for small lists. Merge the two sorted lists into a single sorted list. Find The Min Of A Large List Find the minimum of 20 elements. Divide into two groups of 10 elements each. Find the minimum element in each group somehow. Compare the minimums of each group to determine the overall minimum. Recursion In Divide And Conquer Often the smaller instances that result from the divide step are instances of the original problem (true for our sort and min problems). In this case, If the new instance is a small instance, it is solved using the method for small instances. If the new instance is a large instance, it is solved using the divide-and-conquer method recursively. Generally, performance is best when the smaller instances that result from the divide step are of approximately the same size. Recursive Find Min Find the minimum of 20 elements. Divide into two groups of 10 elements each. Find the minimum element in each group recursively. The recursion terminates when the number of elements is <= 2. At this time the minimum is found using the method for small instances. Compare the minimums of the two groups to determine the overall minimum. Tiling A Defective Chessboard Our Definition Of A Chessboard A chessboard is an n x n grid, where n is a power of 2. 1x1 2x2 4x4 8x8 A defective chessboard is a chessboard that has one unavailable (defective) position. 1x1 2x2 4x4 8x8 A Triomino A triomino is an L shaped object that can cover three squares of a chessboard. A triomino has four orientations. Tiling A Defective Chessboard Place (n2 - 1)/3 triominoes on an n x n defective chessboard so that all n2 - 1 nondefective positions are covered. 1x1 2x2 4x4 8x8 Tiling A Defective Chessboard Divide into four smaller chessboards. 4 x 4 One of these is a defective 4 x 4 chessboard. Tiling A Defective Chessboard Make the other three 4 x 4 chessboards defective by placing a triomino at their common corner. Recursively tile the four defective 4 x 4 chessboards. Tiling A Defective Chessboard Complexity Let n = 2k. Let t(k) be the time taken to tile a 2k x 2k defective chessboard. t(0) = d, where d is a constant. t(k) = 4t(k-1) + c, when k > 0. Here c is a constant. Recurrence equation for t(). Substitution Method t(k) = 4t(k-1) + c = 4[4t(k-2) + c] + c = 42 t(k-2) + 4c + c = 42[4t(k-3) + c] + 4c + c = 43 t(k-3) + 42c + 4c + c =... = 4k t(0) + 4k-1c + 4k-2c + ... + 42c + 4c + c = 4k d + 4k-1c + 4k-2c + ... + 42c + 4c + c = (4k) = (number of triominoes placed) Min And Max Find the lightest and of heaviest n elements using a balance that allows you to compare the weight of 2 elements. Minimize the number of comparisons. Max Element Find element with max weight from w[0:n-1]. maxElement = 0; for (int i = 1; i < n; i++) if (w[maxElement] < w[i]) maxElement = i; Number of comparisons of w values is n-1. Min And Max Find the max of n elements making n-1 comparisons. Find the min of the remaining n-1 elements making n-2 comparisons. Total number of comparisons is 2n-3. Divide And Conquer Small instance. n <= 2. Find the min and max element making at most one comparison. Large Instance Min And Max n > 2. Divide the n elements into 2 groups A and B with floor(n/2) and ceil(n/2) elements, respectively. Find the min and max of each group recursively. Overall min is min{min(A), min(B)}. Overall max is max{max(A), max(B)}. Min And Max Example Find the min and max of {3,5,6,2,4,9,3,1}. Large instance. A = {3,5,6,2} and B = {4,9,3,1}. min(A) = 2, min(B) = 1. max(A) = 6, max(B) = 9. min{min(A),min(B)} = 1. max{max(A), max(B)} = 9. Dividing Into Smaller Instances {8,2,6,3,9,1,7,5,4,2,8} {8,2,6,3,9} {8,2} {6} {6,3,9} {1,7,5} {7,5} {4} {1,7,5,4,2,8} {4,2,8} {2,8} {3,9} {1} Solve Small Instances And Combine {1,9} {2,9} {8,2} {2,8} {6} {6,6} {3,9} {1,7} {7,5} {5,7} {4} {4,4} {1,8} {2,8} {2,8} {2,8} {3,9} {1} {3,9} {1,1} Time Complexity Let c(n) be the number of comparisons made when finding the min and max of n elements. c(0) = c(1) = 0. c(2) = 1. When n > 2, c(n) = c(floor(n/2)) + c(ceil(n/2)) + 2 To solve the recurrence, assume n is a power of 2 and use repeated substitution. c(n) = ceil(3n/2) - 2. Interpretation Of Recursive Version The working of a recursive divide-and-conquer algorithm can be described by a tree -- recursion tree. The algorithm moves down the recursion tree dividing large instances into smaller ones. Leaves represent small instances. The recursive algorithm moves back up the tree combining the results from the subtrees. The combining finds the min of the mins computed at leaves and the max of the leaf maxs. Downward Pass Divides Into Smaller Instances {8,2,6,3,9,1,7,5,4,2,8} {8,2,6,3,9} {8,2} {6} {6,3,9} {1,7,5} {7,5} {4} {1,7,5,4,2,8} {4,2,8} {2,8} {3,9} {1} Upward Pass Combines Results From Subtrees {1,9} {2,9} {8,2} {2,8} {6,6} {6,6} {3,9} {1,7} {7,5} {5,7} {4,4} {4,4} {1,8} {2,8} {2,8} {2,8} {3,9} {1,1} {3,9} {1,1} Iterative Version Start with n/2 groups with 2 elements each and possibly 1 group that has just 1element. Find the min and max in each group. Find the min of the mins. Find the max of the maxs. Iterative Version Example {2,8,3,6,9,1,7,5,4,2,8 } {2,8}, {3,6}, {9,1}, {7,5}, {4,2}, {8} mins = {2,3,1,5,2,8} maxs = {8,6,9,7,4,8} minOfMins = 1 maxOfMaxs = 9 Comparison Count Start with n/2 groups with 2 elements each and possibly 1 group that has just 1element. No compares. Find the min and max in each group. floor(n/2) compares. Find the min of the mins. ceil(n/2) - 1 compares. Find the max of the maxs. ceil(n/2) - 1 compares. Total is ceil(3n/2) - 2 compares. Initialize A Heap n > 1: Initialize left subtree and right subtree recursively. Then do a trickle down operation at the root. t(n) = c, n <= 1. t(n) = 2t(n/2) + d * height, n > 1. c and d are constants. Solve to get t(n) = O(n). Implemented iteratively in Chapter 13. Initialize A Loser Tree n > 1: Initialize left subtree. Initialize right subtree. Compare winners from left and right subtrees. Loser is saved in root and winner is returned. t(n) = c, n <= 1. t(n) = 2t(n/2) + d, n > 1. c and d are constants. Solve to get t(n) = O(n). Implemented iteratively in Chapter 14. Next: Harris Day, Lecture 35 Friday NO CLASS: Harris Day Lectures JWRU Grand Ballroom D and H Dr. Boakye 10:40 - Future of Telecom CEO Lance 12:50 President's Lecture Student reception 12:45-1:45, Ballrooms A&E Monday Hardcopy assignment 3 due Merge Sort, Quicksort 19.2.2-19.2.3
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:

Michigan State University - STT - 315
STT 315 Homework due Thursday, September 7, 2006 in your recitation. These exercises cover the rules of probability, Venn, tree, Bayes' Formula, expectation of a random variable, variance and standard deviation of a random variable, rules for expecta
Texas A&M - CPSC - 315
XMLCPSC 315 Programming Studio Spring 2008 Project 3, Lecture 1Markup Languages Idea is to &quot;tag&quot; information to give a sense of its meaning/semantics How that is handled is up to reader Usually separates presentation from structure Examples:
Texas A&M - STAT - 651
HOMEWORK #8, 2002, due Lecture #11PROBLEM #1: Consider the armspan data, where the variable is the difference between height and armspan. I am interested in comparing the population means for males and females. For purposes of notation, let (f) be
Texas A&M - X - 075
ON COURAGE&quot;They were doing a full back shot of me in a swimsuit and I thought, Oh myGod, I have to be so brave. See, every woman hates herselffrom behind.&quot; - Cindy CrawfordON SELF-KNOWLEDGE&quot;Everywhere I went, my cleavage followed. But I learned
Texas A&M - X - 075
MONEY WOE\$ \$=\$I embrace poverty. To annoy me \$end money.Money talk\$, but all mine ever \$ay\$ i\$ goodbye.Bird\$ have bill\$ too, but they keep on \$inging.All I a\$k for i\$ the opportunity to prove that money doe\$
Texas A&M - CPSC - 203
Basic I/O Concepts Basic I/O Concepts 5.1 FORMATs and Formatted WRITE Statements FORMAT statement specifies output form EXACTLY Write (*,100) Value,ICount Format( ` `,'The value of x is ',E15.8,` on iteration number `,I3,'.') Compo
Southern Oregon - IE - 5970
NEURAL AND RADIAL BASIS FUNCTION NETWORKSLecture 12School of Industrial Engineering University of Oklahoma Norman, Oklahoma Spring 20001Presentation Outline 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. History of Artificial Neural Networks
Colorado State - ECE - 514
4.40, 4.45, 4.55, 4.57, 5.17, 5.35, 5.52, 5.53
Colorado State - ECE - 514
10.1, 10.4, 10.16, 10.40, 10.54, 10.56, 10.59
Colorado State - CS - 457
CS 457 Multimedia ApplicationsFall 2008Topics Digital audio and video Sampling, quantizing, and compressing Multimedia applications Streaming audio and video for playback Live, interactive audio and video Multimedia transfers over a best-
Colorado State - CS - 122
Sets &amp; Functions Ch. 2 RosenDefinitions, operations Venn diagrams, power sets Mappingssets cs160 2006Hello WorldWhat is a set? An unordered collection of objects Objects are called elements or members of the set, notation e Infinite vs. fi
Colorado State - CS - 630
7.0 PREDICTIONReliability prediction is useful in a number of ways. A prediction methodology provides a uniform, reproducible basis for evaluating potential reliability during the early stages of a project. Predictions assist in evaluating the feasi
Colorado State - CS - 270
Colorado State - AT - 351
AT 351 Introduction to Weather and Climate - LabCourse InformationInstructors: Molly Woloszyn ATS 403, Foothills Campus (970) 491-8792 mragsdale@atmos.colostate.edu *E-mail is the best way to contact us* Office Hours: Molly: Thursday; 4:30-5:30 PM
Colorado State - AT - 741
Radar Wind Profiler Data Quality IssuesAT741Presented by Eric James6 May 2008OverviewBACKGROUND - 404 MHz Wind Profilers - NOAA Profiler Network (NPN) DATA QUALITY ISSUES - Effects of Precipitation - Contamination by Ground Clutter - Contami
Texas A&M - ENGR - 221
Determine the axial forces transmitted by transverse cross sections at points A, B, and C of the bar. Draw an axial force diagram for the bar.Draw the free-body diagram of the shaft.Fy= 0 = -10 kN + 16 kN - 24 kN + Fbottom Fbottom = 18 kNL
Texas A&M - CE - 202
7.86 Draw the shear and bending moment diagram for the beam.Draw the free body diagram The compute the reactions Fx = 0 = RAx 1 ( 5 k/ft ) ( 6 ft ) 2 1 - ( 5 k/ft ) ( 10 ft ) - ( 5 k/ft ) ( 6 ft ) + RBy 2 1 M A = 0 = 15 k-ft + ( 5 k/ft ) ( 6 ft ) (
Texas A&M - O - 151
Log into Vista (alias WebCT, alias elearning) and into our course. In a column at the left of the screen you should see tabs for Chat Discussions Web Links My Gradesand some other things we aren't using.Yesterday I gave a party and nobo
Colorado State - CS - 440
UNDERSTANDING PROLOG (A LITTLE BETTER) by Jean-Luc Romano- INTRODUCTION You've tackled Java, taken on Lisp, and now you're learningProlog. You've certainly proven that you can learn new programminglanguages, but Prolog doesn'
Colorado State - CS - 440
HELP FOR ASSIGNMENT 4 PROBLEM 2 Problem 2 can be a little overwhelming if you don't know how toapproach it. Therefore, this file was made so you can understandhow to go about implementing it. First, read the understanding.prolog.txt f
Colorado State - PH - 142
Colorado State - CO - 150
Student Sample 1 Audience Description Jack Avens is my Food from Farm to Table teacher and will be teaching me Food Safety next semester. He is well knowledgeable in food safety and production as his degree is in food science. I learned a majority of
Colorado State - CO - 150
Writing the Zero DraftLet's face, too often our first draft, with some cosmetic changes, is our last. There can be many reasons for this, but typically time in short supply is cited. Unfortunately, our first thoughts about complex matters tend to be
Colorado State - CO - 150
Context Analysis Proposal Arguments written in an academic context require that the writer fully understand the ramifications of and other arguments surrounding the issue she/he takes on. In other words, rather than only picking a side of an issue an
Texas A&M - STAT - 616
9374379478359680351018439102853810381371048339106833910782381128940113884011486401169043117904111791411199341120894012093441219542125934512796451289546131954613510647
Texas A&M - CPSC - 411
Disjoint SetsAndreas Klappenecker [Based on slides by Prof. Welch]1Dynamic SetsIn mathematics, a set is understood as a collection of clearly distinguishable entities (called elements). Once defined, the set does not change. In computer scien
UNC - ECON - 400
Economics 70 Answer key to Book Problem 3 Exercise Title: Book Problem 3 Name (Last, First): ANSWER KEY Section No. of Course: Sections 1 &amp; 2 Sign the Honor Pledge: Date: 5/1/2009 PID:3.17 The probability that a person is a college graduate, P(A),
UNC - ECON - 423
Federal Reserve System: Structure1. The Federal Reserve Act of 1913 required: (a) the Fed to rely primarily on open market operations as a way to regulate the money supply. (b) all national banks to establish branches in cities where Federal Reserve
UNC - ECON - 423
6B: Classical and Neoclassical Theories of MoneyBusiness cycles tend to be relatively minor and are quickly and automatically cured so that the economy will return to its original full employment equilibrium according to: (a) the population dynamics
UNC - ECON - 423
Topic 27: Insurance Companies and Pension Funds1. Major parts of the current health insurance system in the United States most closely parallel: (a) a compulsory national savings plan. (b) a benefit tax to pay for national defense. (c) an automobile
UNC - ECON - 434
Austrian MarginalistsAustrians Austrian economic thought came from aristocratic class and the thinkers were marked as having a dislike of government. Austrians swung economic thought away from supply microeconomics to demand microeconomics. Used de
UNC - BIOL - 691
EXAMPLE #1 notes Biologists have long examined the evolutionary mechanisms responsible for the diversity of organisms. Presumably, divergent selection over evolutionary time maintains diversity (Darwin 1859; Mayr 1970; Vermeij 1987). Because populati
UNC - BIOL - 691
GRADE FOR COMMENDATION RESEARCH POSTER Student Advisor/Sponsor _ Grader Poster session timeThe student above will present a poster on the day of the honors symposium as part of requirements for a Commendation for Undergraduate Research in Biology.
UNC - BIOL - 205
NAME _ BIOLOGY 052, SECTION 006 EXAM 1 SPRING 2008+ PRINT YOUR NAME AT THE TOP OF EVERY PAGE. + USE A PEN, NOT PENCIL. + SIGN THE HONOR PLEDGE AT THE END OF THE EXAM. + USE ONLY THE SPACE PROVIDED FOR YOUR ANSWER. + QUESTIONS WILL BE GRADED ON BOTH
UNC - BIOL - 255
Disturbance: Introduction, with a terrestrial bias Peter White, Biology/Ecology 255, September 9, 2005 OutlineA personal history of the growing interest in disturbance in the 1970s The inside story of the &quot;Death of the Climax&quot; (1978) and White (1979
UNC - BIOL - 669
J. Bastow Wilson's Chapter 1Round 2: Comments, Niches, &amp; CommunitiesSummary of Comments Many big statements made and issues raised without sufficient backing or explanation. &quot;Theories have failed&quot; &quot;Concept of `individual' doesn't exist for plan
UNC - BIOL - 255
When Large, Infrequent Disturbances InteractDahl Winters October 28, 2005OutlineWhat are LIDs? Single LIDs and Their Consequences Examples of Interacting LIDs and Their Consequences- Compounded Perturbations Yield Ecological Surprises (Paine et
UNC - BIOL - 669
The nature of the plant community: a reductionist viewNitin Sekar Ryan BaileyIntroduction &quot;In this chapter we follow our reductionist approach by considering the plant-plant interactions that lead to those restrictions.&quot; These plant-plant inter
UNC - BIOL - 522
Sequence AnalysisHemant Kelkar Center for Bioinformatics University of North Carolina Chapel Hill, NC 27599Scope of SeriesTalk I Overview and BLAST Talk II Protein analysis/Sequence Alignment Talk III Evolution Genomics and challenges Bio
UNC - COMP - 290
Minkowski SumGokul VaradhanNUS CS 5247 David HsuLast LectureConfiguration spaceconfiguration spaceworkspace2Problem Configuration Space of a Translating RobotInput: Polygonal moving object translating in 2-D workspace Polygonal
UNC - COMP - 290
DoS Protection with MultiChannel MACDorian Miller Chris VanderKnyffObjectives Reduce channel overloading Increase eavesdropping difficulty Increase throughput Support QoSS B DAdvantagesTo reduce channel overloading, we can communicate on l
UNC - COMP - 290
The inspiration of ubiquitous computing applicationsDorian MillerThe UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Ubiquitous Computing&quot;The most profound technologies are those that disappear. They weave themselves into the fabric of everyday li
UNC - COMP - 110
51California3387164812.04Texas208518207.41New_York189764576.74Florida159823785.68Illinois124192934.41Pennsylvania122810544.36Ohio113531404.03Michigan99384443.53New_Jersey84143502.99Georgia81864532.91North_Carolina80493
UNC - COMP - 290
Talking to you PDADorian MillerSpeech Recognition Talking to your PDAPerforming speech recognition Local processing resource intensive Remote processing1. Discover domain 2. Connect to speech recognition service 3. Receive equivalent textS
UNC - COMP - 290
Conserving power and securing ad hoc wireless networks by enhancing the 802.11 wireless protocol.Chris VanderKnyff and Dorian Miller Progress report for Comp 290-86, Mobile Computing Abstract: We are designing enhancements to the 802.11 protocol in
UNC - COMP - 290
Performance testing:Measuring a system's scalabilityDorian MillerComp 290, Software quality and testingSoftware process Specification Development Functional testing Performance testing Beyond functional (1k-million users) Large scalable s
UNC - COMP - 291
Design issues in designing the optical distributed sensor Office Tracker.1) Introduction a) Motivated to build an unobtrusive tracker. b) Believe using simpler sensors will benefit a tracking sysem by being able to process data faster and therefore
PASQUOTANK COUNTY JOB DESCRIPTION JOB TITLE: SOLID WASTE RECYCLING COORDINATOR SOLID WASTE DEPARTMENT GENERAL STATEMENT OF JOB Under limited supervision, performs administrative and public relations work for the County convenience sites and programs.
- On Thu, 1/8/09, marjorie cox &lt;mecox1942@yahoo.com&gt; wrote:From: marjorie cox &lt;mecox1942@yahoo.com&gt;Subject: FW: RULES FROM GOD FOR 2009To: &quot;Bonnie Wise&quot; &lt;bonnie2706@bellsouth.net&gt;, &quot;Elaine Baldasare&quot; &lt;ebtarheel@nc.rr.com&gt;, &quot;jeannette arbogast&quot;
UNC - SOCI - 245
Organizational Ecology Joel A.C. Baum and Terry L. Amburgey Rotman School of Management University of Toronto 105 St. George Street Toronto, Ontario M5S 3E6 Phone: (416) 978-4914 (416) 978-4063 Fax: (416) 978-4629 E-Mail: baum@mgmt.utoronto.ca amburg
UNC - SOCI - 380
Sociology 380 April 18th, 2000 Test on grading Answer all questions in your blue book. I. True/False (5 points each) 1. According to Milton, Pollio, and Eison (&quot;Making Sense of College Grades&quot;), the University of North Carolina was not only the first
UNC - ENVR - 416
Predicting secondary aerosol formation from: the amount of gas phase reaction of a given compound called ROG (reactive organic gas) ROG -&gt; Ci ROG concentration Product Ci iproductProduct Ci = Cgas i +Cpart itimeJay Odum, ES&amp;T, vol 30, p
UNC - ENVR - 230
http:/www.warrencountync.com/Montmorenci Staircase, WinterthurMagnolia Manor Plantation B&amp;BPCBs and the Ward Transformer Company http:/www.wardtransformer.com/company.htm http:/bulk.resource.org/courts.gov/c/F2/676/676.F2d.9 Commission for
UNC - ENVR - 430
Zero-Order Processes Follow straight-line time course Rate is independent of concentration v = [A]/t = k Units of k are mass/time, e.g mg/h Saturated carrier-mediated processes Saturated enzyme-mediated processes
UNC - ENVR - 430
Reactive Oxygen and Nitrogen SpeciesThe Earth was originally anoxic Metabolism was anaerobic O2 started appearing ~2.5 x 109 years agoAnaerobic metabolism-glycolysis Glucose + 2ADP + 2Pi Lactate + 2ATP + 2H2OO2 an electron acceptor in aerobic me
UNC - ENVR - 430
Suspected Causes of Human Birth DefectsSuspected Cause Genetic Autosomal genetic disease Cytogenetic Environmental Maternal conditions Maternal infections Mechanical Problems Chemicals/drugs/radiation/hyperthermia Unknown % of Total 15-20 5 4 3 1-2
UNC - COMP - 290
Streaming ProcessorsAnselmo LastraThe UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Presentations10:0012:00 Will schedule noon exam takers early IssuesReports emailed by Monday 8AMOne page each person, pleaseSetting up demos Transitioning fr
UNC - COMP - 238
Radiosity Part II Form FactorsCOMP2381Anselmo Lastra, October 2000Goal Learn ways of computing form factors.2Anselmo Lastra, October 2000Recall. 1 - 1 F1,1 - F 1 - 2 F2, 2 2 2 ,1 . . . . - n -1 Fn -1,1 . . - n Fn ,1 . . . . .
UNC - COMP - 238
Quick Reference (adapted from Rayshade)I'm afraid it doesn't cover everything.Viewing: eyep Xpos Ypos Zpos /* Eye position (0 -10 0) */ lookp Xpos Ypos Zpos /* Look position (0 0 0) */ up Xup
UNC - COMP - 114
A Theme Park SimulationCOMP 114 Tuesday April 16Lastra, 2001Slide 1Discrete Event Simulators Grocery store example we did in class Treat time as discrete Move in small increments Why? Much easier to program Simulate what's happening over
UNC - COMP - 190
Memories, Part IIAnselmo LastraThe UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Topics RandomAccess Memory Dynamic2The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Dynamic RAMCapacitor can hold charge Transistor acts as gate No charge is