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.
2 Pages
106 Lab 08 - Hotdogs
Course: CS 106, Fall 2009School: Wheaton College
Rating:
Word Count: 195
Document Preview
to ------------------------------------------------------------------------ Go Main Menu <../DataArchive.html> Go to Power Search </cgi-bin/iform?DASL> Go to Datafile Subjects <../allsubjects.html> ------------------------------------------------------------------------ *Datafile Name: * Hot dogs *Datafile Subjects: * Food...
Unformatted Document Excerpt
CourseheroCourse 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.
to ------------------------------------------------------------------------
Go Main Menu <../DataArchive.html>
Go to Power Search </cgi-bin/iform?DASL>
Go to Datafile Subjects <../allsubjects.html>
------------------------------------------------------------------------
*Datafile Name:
* Hot dogs *Datafile Subjects:
* Food
</cgi-bin/isearchb?DATABASE=DASL&SEARCH_TYPE=boolean&ELEMENT_SET=title&MAXHITS=50&FIELD_1=DSUBJECTS&TERM_1=Food>
*Story Names:
* Hot dogs <../Stories/Hotdogs.html> *Reference:
* Moore, David S., and George P. McCabe (1989). /Introduction to the
Practice of Statistics/. Original source: /Consumer Reports/, June 1986,
pp. 366-367. *Authorization:
* *Description:
* Results of a laboratory analysis of calories and sodium content of
major hot dog brands. Researchers for /Consumer Reports/ analyzed three
types of hot dog: beef, poultry, and (mostly meat pork and beef, but up
to 15% poultry meat). *Number of cases:
* 54 *Variable Names:
*
1. Type: Type of hotdog (beef, meat, or poultry)
2. Calories: Calories per hot dog
3. Sodium: Milligrams of sodium per hot dog
*The Data:
*
TypeCaloriesSodium
Meat136393
Beef186495
Poultry135426
Beef139322
Meat107144
Beef175479
Poultry94387
Beef111300
Beef141386
Meat175507
Poultry143581
Poultry152588
Beef153401
Beef131317
Beef149319
Poultry113513
Beef132253
Meat173458
Meat191506
Meat182473
Poultry99357
Meat172496
Meat147360
Meat146387
Beef190587
Meat179405
Meat195511
Beef149322
Meat135405
Beef135298
Meat140428
Meat138339
Poultry129430
Poultry132375
Beef158370
Poultry102396
Poultry106383
Beef152330
Poultry102542
Beef181477
Poultry87359
Beef148375
Meat190545
Beef184482
Poultry107528
Beef176425
Poultry142513
Poultry86358
Beef190645
Beef157440
Poultry146522
Meat139386
Poultry144545
Meat153372
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:
Below is a small sample set of documents:
Wheaton College - CS - 106
Lisa MichaudProject #2Page 1 out of 3Chart 1 : Composition of Data Set by Type31% 100% 90% 80% 70% 60% 50% 40% 30% 20% 10% 0%Chart 2 : Percentage of Hot Dogs Which are High-Calorie37% Beef Meat Poultry31%BeefMeatPoultryChart 3 : Calories by Typ
Wheaton College - CS - 106
The BASICS of COMPUT I NGExample SubmissionsProposalPROJECT #2The file I have chosen to do my analysis on is the Hot Dogs file. This file contains information about the composition type, calories, and sodium level of 54 different brands of hot dogs. T
Wheaton College - CS - 106
The BASICS of COMPUT I NGProposal Due: Friday, November 16, 2007 Final Due Date: Wednesday, November 28, 2007SummaryPROJECT #2Data Analysis and Presentation Using SpreadsheetsNow that you have some experience using a spreadsheet to do both data proje
Wheaton College - CS - 106
The BASICS of COMPUT I NGDale & Lewis Chapter 2: Number Systems Final Exam ReviewNumbers in different bases: binary, decimal, hexadecimal Conversion: from other bases to decimal, from decimal to binary Math in different bases: addition in binary Key c
Wheaton College - CS - 106
The BASICS of COMPUT I NGSQL SyntaxSQL (Structured Query Language) is a powerful language for designing databases, modifying them, and, and drawing information out of them. It provides a standardized interface between applications and the underlying inf
Wheaton College - CS - 106
The BASICS of COMPUT I NGReview of Set Notation A = cfw_1,2,3,4 xA B = cfw_3,4,5,6 xASet TheoryU = cfw_1,2,3,4,5,6,7,8,9,10 1A 1B x is a member / is not a member of set A the intersection of sets A and B A B = cfw_x : x A and x B the union of sets A
Wheaton College - CS - 106
The BASICS of COMPUT I NGPages and FramesThe idea of paging is two-fold: Demand PagingAll programs currently running and all of their data must be in the main memory, from where the Control Unit can fetch the next instruction in order to execute it. H
Wheaton College - CS - 106
The BASICS OF COMPUT I NGRecording Your Alice ProgramsIf you are using Windows, there is a freeware screen recording software called CamStudio that will allow you to make movies of your Alice programs in action to share with your friends and family who
Wheaton College - CS - 215
AlgorithmsBig O: The Upper BoundBig O and its Cousinscg(n)f(n)n n0f(n) is O(g(n) ifthere is some real constant c > 0 and some integer constant n0 0 such that f(n) cg(n) for all n n0 Big Omega: The Lower Bound f(n) cg(n)n0nf(n) is (g(n) ifthere
Wheaton College - CS - 215
AlgorithmsAssignment #1 Homework: Big "Oh" Analysis Due Friday 2/3/061. (1 point) Bill has an algorithm, find2D, to find an element x in an n n array A. The algorithm find2D iterates over the rows of A, and calls the algorithms arrayFind, of Code Fragme
Wheaton College - CS - 215
AlgorithmsAN INTRODUCTION TO STL VECTORSLab #2 STL Vectors Tuesday 2/6/06As introduced in lecture, a vector can be seen mostly as a dynamic array. It is an ordered sequence, it can be randomly accessed (using the same kind of subscripts you are used to
Wheaton College - CS - 215
AlgorithmsOBJECTIVEAssignment #2 Program: Big O Due Thursday 2/9/05Write an program to prime numbers from 2 to n, where n is entered by the user at runtime. In addition to finding (and printing) the primes, you are going to analyze the amount of work y
Wheaton College - CS - 215
AlgorithmsLab #3 STL Lists and Recursion Tuesday 2/14/06AN INTRODUCTION TO STL LISTS URL for more information: http:/www.sgi.com/tech/stl/List.html The list class in the STL is an implementation of a doubly-linked list. Unlike with a vector, you cannot
Wheaton College - CS - 215
AlgorithmsRECURSIVE FUNCTIONS FOR EXPRESSING RUNNING TIMERecurrence RelationsThe idea behind a recurrence relation is to find a way to express the running time of an algorithm in terms of n, the size of its input: TA(n) = the time it takes algorithm A
Wheaton College - CS - 215
AlgorithmsThe recurrence relation was: T(1) = 0 T(n) = 2 T(n/2) + n Expand:Solution to Practice ProblemT(n) = 2 T(n/2) + n = 2 [ 2 T(n/4) + n/2 ] + n = 2 2 T(n/4) + n + n = 2 2 T(n/4) + 2n = 2 2 [ 2 T(n/8) + n/4 ] + 2n = 2 2 2 T(n/8) + 3n Guess: k expa
Wheaton College - CS - 215
AlgorithmsWork on this problem as practice for the first midterm.Practice ProblemThe recurrence relation that expresses the running time of most efficient sort algorithms is: T(1) = 0 T(n) = 2 T(n/2) + n For example, in merge sort, you first sort each
Wheaton College - CS - 215
AlgorithmsOBJECTIVEAssignment #3 Program: Recursion Due Friday 2/24/05Write a program to find all Inverted Repeats (IRs) of a given length L in an input file of nucleotides (DNA!) in the FASTA format. The length L is determined by the user at run-time;
Wheaton College - CS - 215
AlgorithmsLab #5 STL Stacks and Depth-First Search Tuesday 3/7/06AN INTRODUCTION TO STL STACKS URL for more information: http:/www.sgi.com/tech/stl/stack.html #include <stack> By this point, you know that most of the STL types work the same way as the o
Wheaton College - CS - 215
AlgorithmsDESCRIPTION Today you are going to implement a binary search tree. TO DO TODAY: 1. Download the starter files for this lab from the course website: node.h node.cpp tree.h 215 Lab 06 Starter.cppLab #6 Binary Search Trees Tuesday 3/21/062. Crea
Wheaton College - CS - 215
AlgorithmsAN INTRODUCTION TO STL SORTING ALGORITHMSLab #8 Sorting in the STL Tuesday 4/04/06One of the really cool things about the Standard Template Library is the series of generic algorithms that can be used on just about any one of the STL types. E
Wheaton College - CS - 215
AlgorithmsTHE RECURRENCE RELATION T(1) = 1 T(n) = 1 + 2 T(n/2) + n EXPAND T(n) T(n) T(n) = 1 + 2 [1 + 2 T(n/22) + n/2] + n = 3 + 22 T(n/22) + 2nThe Merge-Sort Running Time Proof2 expansions= 1 + 2 + 22 [1 + 2 T(n/23) + n/4] + 2n = 7 + 23 T(n/23) + 3n
Wheaton College - CS - 215
Algorithms: SupplementProving a Lower Bound for Comparison Algorithmsn1 2 4 8 16 32 64 128log n! log(n/2)^n/2)0 1 4.58 15.30 44.25 117.66 296.00 716.16 -0.5 0 2 8 24 64 160 384log(n^n) log(n/x)^n/x)0.00 2.00 8.00 24.00 64.00 160.00 384.00 896.00 -0
Wheaton College - CS - 215
AlgorithmsAssignment #5 Program: Game Trees Phase I Due Wednesday 3/29/06 Phase II Due Friday 4/7/06OBJECTIVE In this project, you will be designing a variant of the Checkers game in which the user plays against the computer. This is a very large and in
Wheaton College - CS - 215
AlgorithmsCOMPARING THE ALGORITHMSLab #9 Pattern Matching with Different Algorithms Tuesday 4/18/06In class we have studied the algorithms and implementation of three different pattern-matching algorithms: 1. Brute Force 2. Boyer-Moore 3. Knuth-Morris-
Wheaton College - CS - 215
AlgorithmsLab #10 Standard Tries Tuesday 4/25/06In this lab, you will implement a standard trie (with a couple of small modifications) in order to store all of the words of Moby Dick and determine the list of words (each with the count of how many times
Wheaton College - CS - 325
COMP 325: Database SystemsSQL Queries due Wed. Oct 4thHomework #3Please submit this homework in electronic format in an email. It is still due at the beginning of class on the due date. PART ONE: SQL AND THE CLASS DATABASE Connect to my MySQL server th
Wheaton College - CS - 325
COMP 325: Database SystemsHandout: Locking and BlockingLOCKINGStrict Two-Phase Locking (Strict 2PL) 1. if transaction T wants to read an object, first requests a shared lock on the object; if T wants to write an object, first requests an exclusive lock
Wheaton College - CS - 325
COMP 325: Database SystemsHandout: TransactionsACID ATOMICITY either all actions in the transaction are done, or none get done nothing is left halfdone CONSISTENCY the databases consistency must be preserved by the transaction if it is runningby itse
Wheaton College - CS - 325
COMP 325:DatabaseSystemsHandout:StaticHashingIndexesStatic HashingPros: Search: 1 disk I/O (after applying hash function, fetch the bucket) Insert: 2 disk I/Os (fetch the bucket, add record, write it back out) Delete: 2 disk I/Os (fetch the bucket, del
Wheaton College - CS - 325
COMP 325: Database Systems Handout: Comparing IndexesCost of OperationsScan Heap Files Sorted Files Clustered Files Heap File, Unclustered Tree Index Heap File, Unclustered Hash IndexEquality SearchRange SearchInsert RecordDeleteComparing Files an
Wheaton College - CS - 325
COMP 325: Database SystemsHandout: Memory and DisksThe Memory HierarchyCPU CACHE MAIN MEMORY MAGNETIC DISK TAPE primary storage secondary storage tertiary storageFASTERCHEAPERWhat a Disk Looks LikeMemory and Disks Handout Page 1 of 1
Wheaton College - CS - 325
COMP 325:DatabaseSystemsHandout:IntroductiontoConnector/JIntroduction to Connector/J The idea of Connector/J is to provide the programmer with some classes and objects that support making connections to a MySQL database. You can send queries, get result
Wheaton College - CS - 325
COMP 325: Database SystemsHandout: Java's Layout ManagersThis handout briefly overviews some of the Swing Layout Managers and how they can be used to arrange the components within a container in your GUI. It is a modified version of the text and images
Wheaton College - CS - 325
COMP 325: Database SystemsHandout: Javas Event ListenersThe idea behind event listeners is that certain objects can listen for the occurrence of an event in a GUI specifically, an action taken by the user in order to react to that event. In many cases,
Wheaton College - CS - 325
COMP 325: Database SystemsHandout: Standard Query LanguageThese are the queries we worked out together in class, with the robots schema: Find the brand and color of all robots. SELECT R.brand, R.color FROM Robots R; Find the brands of all blue robots. S
Wheaton College - CS - 325
COMP 325:DatabaseSystemsHandout:RelationalAlgebraandRelationalCalculusThe Simpsons Database ER Diagram:cicnameeidtitlenumbercharactersappear edepisodesagecgender voice_actorssynposisairdatevgendervivnamThe schema: characters( cid: intege
Wheaton College - CS - 215
Algorithms Sorting Insertion sort algorithm Selection sort algorithm Heap sort algorithm Merge sort algorithm Quick sort algorithm Stable sortsFINAL EXAM REVIEW SHEETPattern Matching Brute-force algorithm Boyer-Moor algorithm; how to compute last() Kn
Wheaton College - CS - 115
Programming FundamentalsThe final exam can be expected to include the following topics:Final Exam TopicsBasic Control Structures: know their syntax, how to follow the flow of control if, if/else switch while loops do/while loops for loops Data Types: k
Wheaton College - CS - 115
Programming Fundamentals(Got Game?)Have you ever played one of these games?PROJECT #7Dead end You are at a dead end of a dirt road. The road goes to the east. In the distance you can see that it will eventually fork off. The trees here are very tall r
Wheaton College - CS - 106
The BASICS of COMPUT I NGdue Friday, 12/7/07HW #13: Artificial Intelligence1. (2 pts) Which can do each of the following tasks more easily, a human or a computer? Justify your answer. a. Identify a dog in a picture b. Add a column of 100 four-digit num
Wheaton College - CS - 255
Computer Science 255: Artificial IntelligenceFinal Exam Study GuidePre-requisite knowledge from the first half of the semester includes: Logical expressions using First-Order Logic Reasoning in forward and backward directions State space search o Basic
East Los Angeles College - CS - 236603
A Dynamic Multithreading ProcessorHaitham Akkary Microcomputer Research Labs Intel Corporation haitham.akkary@intel.comMichael A. Driscoll Department of Electrical and Computer Engineering Portland State University driscoll@ee.pdx.eduIdeally, we need a
East Los Angeles College - CS - 236603
East Los Angeles College - CS - 236603
Cache Coherence Protocols: Evaluation Using a Multiprocessor Simulation ModelJAMES ARCHIBALD and JEAN-LOUP University of Washington BAERUsing simulation, we examine the efficiency of several distributed, hardware-based solutions to the cache coherence p
East Los Angeles College - CS - 236603
Memory Dependence Prediction using Store SetsGeorge Z. Chrysos and Joel S. Emer Digital Equipment Corporation Hudson, MA 01749 cfw_chrysos,emer@vssad.hlo.dec.com AbstractFor maximum performance, an out-of-order processor must issue load instructions as
University of Toronto - CSC - 120
East Los Angeles College - CS - 236603
M R LA User's and Hacker's Guide to the SimpleScalar Architectural Research Tool Set(for tool set release 2.0)Todd M. Austin taustin@ichips.intel.com Intel MicroComputer Research Labs January, 1997Todd M. AustinPage 1Tutorial Overview Computer Arch
East Los Angeles College - CS - 236603
%!PS-Adobe-3.0 %Title: PowerPoint -hack_guide.ppt %Creator: Windows NT 3.5 %CreationDate: 16:24 2/12/1997 %Pages: (atend) %BoundingBox: 25 15 777 598 %EndComments %BeginProcSet: NTPSOct94 % Copyright (c) 1991 - 1994 Microsoft Corporation /NTPSOct94 100 di
University of Toronto - CSC - 120
St.John'sAtlanticCharlottetown AtlanticHalifax AtlanticFredericton AtlanticQuebecCentralMontrealCentralOttawa CentralTorontoCentralWinnipegPrairieRegina PrairieEdmontonPrairieCalgary PrairieVancouver PacificVictoria PacificWhit
UMass (Amherst) - CHEM - 112
Turn on Camptasia Recording!No Class Monday Feb 18th PRESIDENT's DAYClass will be held Tuesday Feb 19th No Class Wednesday Feb 20th EXAM WED Feb 20th 131 Markus at 7 pmdue to EXAM.1SI SessionsSunday Feb 17th, NONE Due to Holiday Wednesday Feb 20t
University of Toronto - CSC - 120
St.John's 8.6 0.8 February -1.4 -8.7 July 20.2 10.5Charlottetown 9.5 0.8 January -3.4 -12.2 July 23.1 13.6Halifax 10.7 1.4 February -1.5 -10.6 July 23.4 13.2Fredericton 11.0 -0.6 January -4 -15.4 July 25.6 12.9Quebec 9
U. Houston - POLS - 1337
Spring 2007, Political Science 1337, Section 07550Professor: John W. Sloan Office Hours: 11:30-2:00, Tuesday, Thursday And by Appointment Course Requirements All Students will take three (3) exams. NO exams will be dropped; each grade will count equally.
Lake County - LIS - 35301
Graduate School of Library and Information Science Spring 2001Using Networked Information Systems(LIS 353 )Section B Thursday, 35:50 PM Room 106, LincolnThis document is Copyright c 2001 by David Dubin and the Trustees of the University of Illinois. I
Purdue - CS - 354
Chapter 16 Distributed-File Systemss Background s Naming and Transparency s Remote File Access s Stateful versus Stateless Service s File Replication s Example SystemsOperating System Concepts16.1Silberschatz, Galvin and Gagne 2002Backgrounds Distri
Purdue - CS - 354
Module 21: Windows 2000s History s Design Principles s System Components s Environmental Subsystems s File system s Networking s Programmer InterfaceOperating System Concepts21.1Silberschatz, Galvin and Gagne 2002Windows 2000s 32-bit preemptive mult
Purdue - CS - 354
Chapter 9: Memory Managements Background s Swapping s Contiguous Allocation s Paging s Segmentation s Segmentation with PagingOperating System Concepts9.1Silberschatz, Galvin and Gagne 2002Backgrounds Program must be brought into memory and placed w
Lake County - IB - 202
Announcements Labs meet this week! Please (purchase and) register your iclicker in lab this week. Next week, responses will be worth points toward your grade. Internet tutorial: link is on the LAB 1 syllabus page. It reviews material covered in lectures
Georgia Tech - LCC - 3710
IntroductionTwo personal storiesHere are two stories of personal experiences that led me to start working toward a new design discipline, eventually called "interaction design." The first, about buying a digital watch for my son, made me see that I need
Lake County - ECE - 431
ECE 333Final Exam Spring 2001 2 sheets allowed, 3 hours. Work problems in exam book. _Problem #1 (35 points)A balanced 3-phase, 208 Volt (line-line) source serves a balanced, 3-phase load. A variable 3-phase capacitor bank is connected across the load
IUPUI - M - 118
Math M118 Practice Final Exam Answers 1.[( p q ) p ] q Not a valid logical argument since the truth table shows that it is not a tautology.2. last columnF F T T3. last columnF T T T4a. 4b. 4c. 4d. 5a. 5b. 6a. 6b. 6c. 6d. 7. 8. 9. 10. 11a. 11b. 12. 1
Lake County - MCB - 240
MCB/Physiology 240 Lecture. Fall 06. Review Questions for Exam 4 (Tu Dec 12, 7-10 p.m.) [conflict exam Wed Dec 13, 7-10 pm)Please note that in this fourth exam of the semester, there will be 50 multiple-choice questions (worth 150 points) and 10 fill-ins