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.
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:
Pittsburgh - CS - 1541
Name _CS/COE 1541Computer Architecture Fall 2005 EXAM #1Directions: This exam is closed bookput all books and notes under your desk on the floor. There are five questions with several subquestions. All questions are marked with their point value.
Pittsburgh - CS - 0447
When N = 32If we use the twos complement method 0000 0000 0000 0000 0000 0000 0111 1111 0111 1111 1000 0000 1000 0000 1000 0000 1111 1111 1111 1111 1111 11110000 0000 0000 0000 0000 0000 = 0 0000 0000 0000 0000 0000 0001 = +1 0000
Pittsburgh - CS - 1541
Instructions: Language of the Machine More primitive than higher level languages e.g., no sophisticated control flow Very restrictive e.g., MIPS Arithmetic Instructions We are using the MIPS instruction set architecture similar to other architect
Pittsburgh - CS - 1541
Name _CS 1541 Computer Architecture - Spring 2002 Exam #1Directions: This exam is closed bookput all books and notes under your desk on the floor. There are five questions with several subquestions. All questions are marked with their point value
Pittsburgh - CS - 2410
9/9/2008SoftwarePipeliningCS2410Fall2008SoftwarePipelining Compilertransformationtoextract instructionlevelparallelism(ILP)byexecuting i t ti l l ll li (ILP) b ti codesimultaneouslywithlonglatency operations Extracted from loops Extractedfroml
Pittsburgh - CS - 3230
=Paper Number:Paper Title:Authors:Reviewer:=For the next several queries, please rate the paper on a scale of 1-4, where the quality increases as the number increases. A rating of 1 is the lowest (worst) and a rating of 4 is the highest
Pittsburgh - CS - 0447
CS/COE0447: Computer Organization and Assembly LanguageChapter 2modified by Bruce Childers original slides by Sangyeun ChoDept. of Computer Science University of PittsburghFive classic componentsI am like a control tower I am like a pack of fil
Pittsburgh - CS - 1541
Lecture: Chp 6.4Data Hazards and ForwardingData Hazards Obstacles to pipelined execution add $2,$3,$4 add $5,$2,$61Data Hazards Obstacles to pipelined execution add $2,$3,$4 add $5,$2,$6Second instruction is dependent on the first - it need
Pittsburgh - CS - 2410
Name _CS 2410 Computer Architecture Fall 20042410 Final Exam and Ph.D. Preliminary Exam Directions: This exam is closed bookput all books and notes under your desk on the floor. There are seven questions (including preliminary exam questions) with
Pittsburgh - CS - 2210
Redundant Computation Elimination OptimizationsCS2210Lecture 20CS2210 Compiler Design 2004/5Redundancy EliminationSeveral categories:Value Numberinglocal & global local & globalCommon subexpression elimination (CSE) Loop-invar
Pittsburgh - CS - 2210
Alias Analysis & Redundant Computation Elimination OptimizationsCS2210Lecture 19CS2210 Compiler Design 2004/5Alias AnalysisDetermine whether a storage location may be accessed in more than one way Example in C: p = & x; x and *p are alia
Pittsburgh - CS - 2210
Parameter Passing, Calls, Symbol Tables & IRsCS2210Lecture 10CS2210 Compiler Design 2004/5Parameter PassingThree semantic classes (semantic models) of parameters IN: pass value to subprogram OUT: pass value back to caller INOUT: pass va
Pittsburgh - CS - 1530
Software EngineeringCS / COE 1530CodingCS 1530 Software Engineering Fall 2004Organizational Reading: Chapter 7 Reminder: project due on Monday 10/25 (noon) Agenda on web has been updated Midterm will be returned next week (graded on curve
Pittsburgh - CS - 2210
Static Single Assignment FormCS2210Lecture 15CS2210 Compiler Design 2004/5Reading Rest of chapter 8 Chapter 9CS2210 Compiler Design 2004/51Static Single Assignment Form THE standard IR in optimizing compilers PropertiesMechanis
Pittsburgh - CS - 1530
Software EngineeringCS / COE 1530Lecture 4 Project ManagementCS 1530 Software Engineering Fall 2004Dilbert on Project PlanningCS 1530 Software Engineering Fall 2004Overview Reading: chapter 3 in textbook Requirements documents due 9/20
Pittsburgh - CS - 2410
Distributed shared memory architecturesApproaches to maintain coherence Do not cache shared data- mark shared data uncacheable - rely on compiler to replicate and manage data - compiler must be pessimisticCache Cache CacheProcessorProcessor
Pittsburgh - CS - 0445
CS 0445 Recitation 4: Test 1 Discussion1. MemoizationMemoizing a function makes it faster by trading space for time. It does this by caching the return values of the function in a table. If you call the function again with the same arguments, memoi
Pittsburgh - CS - 0445
CS0445 Data Structures Exam2: Selected QuestionsProblem 1A. In the worst case, A[] is sorted in increasing order. Outer loop: n times; Inner loop: check A[j] < A[j-1] once, twice, n-1 times. 1+2+. + (n-1) = O(n2) B. In the best case, A[] is sorted
Pittsburgh - CS - 449
CISC vs. RISC x86 or Oh No! Not Another AssemblerJonathanMisurda jmisurda@cs.pitt.edu x86istheepitomeofaComplexInstruction SetComputer Hundredsofinstructions F2XM1 Compute2x1 Computestheexponentialvalueof2tothepowerofthesourceoperand minus1.The
Pittsburgh - CS - 1590
A An Example of L TEX Jonathan Misurda June 6, 2006AbstractA This le will serve as an introduction to L TEX and a template for your papers inthis course1IntroductionA L TEX is a popular typsetting environment based upon the TEX language. T
Pittsburgh - CS - 449
Abstraction via the OS Device DriversJonathanMisurda jmisurda@cs.pitt.eduSoftware LayersUserlevelI/Osoftware&libraries DeviceindependentOSsoftware Devicedrivers Interrupthandlers Hardware User Operating system (kernel)Device DriversUser space
Pittsburgh - CS - 449
Network Network CommunicationComputerJonathanMisurda jmisurda@cs.pitt.eduEthernetInternet Layer ModelApplication (DHCP,DNS,FTP,HTTP,IRC,POP3,TELNET.) Transport (TCP,UDP,RTP.) Internet (IP) DataLink (ATM,Ethernet,FDDI,FrameRelay,PPP.) Physical
Pittsburgh - CS - 1550
8/28/2007CS 1550: Chapter 1JonathanMisurda jmisurda@cs.pitt.edu http:/www.cs.pitt.edu/~jmisurda/CS 1550 - 2077OPERATING SYSTEMSCS 1550 - 2077MANAGE RESOURCESABSTRACT DETAILSCS 1550 - 2077CS 1550 - 2077Ye Olde ComputerYe Olde Progr
Pittsburgh - CS - 449
#include Practical C Issues:Preprocessor Directives, Typedefs, Multi-file Development, and Makefiles Copiesthecontentsofthespecifiedfileinto thecurrentfile <>indicatetolookinaknownlocationfor includes indicatetolookinthecurrentdirectoryor speci
Pittsburgh - CS - 449
MultiprogrammingSingle$PC (CPUspointofview) A Multiple$PCs (processpointofview)CS 449 - ThreadsJonathanMisurda jmisurda@cs.pitt.eduB C B D OnestreamofinstructionsABCDIsolatedaddressspacesthat arenotinterruptedD C B A TimeLife Cycl
Pittsburgh - CS - 449
SystemCallsandSignals: CommunicationwiththeOSJonathanMisurda jmisurda@cs.pitt.eduSystemCallAnoperation(function)thatanOS providesforrunningapplicationstouseCS1550 2077strace ./hellofstat(1,{st_mode=S_IFCHR|0600, st_rdev=makedev(136,7),.})=0
Pittsburgh - CS - 449
Processes, Address Spaces, and Memory Management y gJonathanMisurda jmisurda@cs.pitt.eduProcessArunningprogramanditsassociated dataCS1550 2077Processs Address Space0x7fffffff StackOperating Systems ManageResources AbstractDetailsData (
Pittsburgh - CS - 449
Abstraction via the OSDEVICE DRIVERSSoftware LayersUserlevelI/Osoftware&libraries DeviceindependentOSsoftware Devicedrivers Interrupthandlers Hardware User Operating system (kernel)Device DriversUser space Kernel spaceRestoftheOS User progra
Pittsburgh - CS - 1550
ThreatsGoal ThreatExposureofdata Tamperingwithdata DenialofserviceCS 1550 Chapter 9 SecurityJonathanMisurda jmisurda@cs.pitt.eduDataconfidentiality Dataintegrity SystemavailabilityIntruders Casualpryingbynontechnicalusers Snoopingbyinsi
Pittsburgh - CS - 1550
Race ConditionSharedData:5 6 4 1 8 5 6 20 9 ?InterProcess CommunicationtailA[]Enqueue(): A[tail]=20; tail+; processswitchA[tail]=9; tail+; Process1Process0Critical RegionsP0enters criticalregion P0leaves criticalregion P1enters crit
Pittsburgh - CS - 1550
MultiprogrammingSingle$PC (CPUspointofview) Multiple$PCs (processpointofview)CS 1550: Chapter 2JonathanMisurda jmisurda@cs.pitt.edu http:/www.cs.pitt.edu/~jmisurda/CS1550 2077A B C B D A B C DD C B ACS1550 Time 2077Life Cycle of a Process
Pittsburgh - CS - 449
pthreads pthreads and the Dangers of ThreadingJonathanMisurda jmisurda@cs.pitt.edu pthreads (POSIXthreads)isalibraryfordoing threading CantransparentlybeusedunderUseror KernelthreadsPOSIX PortableOperatingSystemInterface Standardtounifytheprog
Pittsburgh - CS - 449
CS 0449: Introduction toS y s t e m s S o f t wa r eJonathan MisurdaComputer Science Department University of Pittsburgh jmisurda@cs.pitt.edu http:/www.cs.pitt.edu/jmisurdaSe c o n d Ed i t i o n, revision 3Last modied: December 19, 2008 at 1
Pittsburgh - CS - 449
Function Call, 1 param#include<stdio.h> f: pushl movl movl leave ret main: pushl %ebp movl %esp,%ebp subl $8,%esp andl $16,%esp subl $16,%esp movl $3,(%esp) callf movl %eax,4(%ebp) movl $0,%eax leave ret %ebp %esp,%ebp 8(%ebp),%eaxFunction Calls a
Pittsburgh - CS - 2094
Sample Project 2 Write-upJonathan Misurda jrmst106@pitt.edu11.1Lab ProgramProcedureSince the programs are all written in C, they will have a main function, so I initially placed a breakpoint at main and did a disassembly. I noticed there wer
Pittsburgh - CS - 449
pthreads pthreadsJonathan Misurda jmisurda@cs.pitt.edu pthreads (POSIX threads) is a library for doing threading Can transparently be used under User or Kernel threadsPOSIX Portable Operating System Interface Standard to unify the programs a
Pittsburgh - CS - 1550
Viruses Machinelanguage Macrolanguage Insertedintoanotherprogram Mayalsoinfectsystemcode(bootblock,etc.)Searching for ExecutablesVirus Insertion PointsVirus Virus Executable program Executable program Starting address Header Virus Header Hea
Pittsburgh - CS - 1590
Writing Assignment 3: Social Implications of Computing TechnologyJonathan Misurda Due: August 1, 2006 by the start of class1IntroductionIn this course we have discussed a wide variety of issues that relate traditional frameworks of ethics to m
Pittsburgh - CS - 449
Errors MostfunctionsinCreturnanindicationofan error Forinstance,printf Uponsuccessfulreturn,thesefunctionsreturnthenumberof charactersprinted Ifanoutputerrorisencountered,anegativevalueisreturned.Therecv()functionshallfailif:man recvEAGAINorE
Pittsburgh - CS - 449
Race ConditionSharedData:5 6 4 1 8 5 6 20 9 ?Synchronization and Deadlocks(or The Dangers of Threading) JonathanMisurda jmisurda@cs.pitt.edutailA[]Enqueue(): A[tail]=20; tail+; threadswitchA[tail]=9; tail+; Thread1Thread0Critical Re
Pittsburgh - CS - 449
typedeftypedef typedeclaration synonym;Typedefs, Multi-file Development, and MakefilesJonathan Misurda jmisurda@cs.pitt.eduExamples: typedef int * int_pointer; typedef int * int_array;Type Clarityvoid takes_int(int_pointer x) { *x = 3; } vo
Pittsburgh - CS - 449
This is a compilation of the blog posts on linking from http:/www.airs.com/blog/archives/category/programming/page/1/ This pdf is only provided for reading ease. The author of these posts is Ian Lance TaylorLinkers part 1August 22, 2007 at 11:30 p
Pittsburgh - CS - 110
Microsoft Access 2007cs110MS Access What is a relational database? Tables Fields Value Type Forms Queries ReportsMS Access What is a relational database? Tables Fields Value Type Forms Queries ReportsAccess isrelational dat
Pittsburgh - CS - 2210
--Yacc: Yet Another Compiler-CompilerStephen C. JohnsonABSTRACT Computer program input generally has some structure; in fact, every computer program that does input can be thought of as defining an `input language' which it accepts. An input l
Pittsburgh - CS - 110
Lab 7 (Slide Presentations with PowerPoint)Total (for the 4parts)= 40 Points Score _Part 1 Create and edit a simple Presentation with PowerPoint [ In Lab-Manual: (II.D PowerPoint 1) Page 285 ]Activity Sheet for Part 1(Reference Page 299)
BU - ADA - 05
Spatial indexingPAMsPAMsPoint Access MethodsMultidimensional Hashing: Grid FileExponential growth of the directoryHierarchical methods: kd-tree basedStoring in external memory is trickySpace Filling Curves: Z-orderingMap points from 2-dim
BU - ADA - 04
Cluster AnalysisCluster Analysisp p p p p p p p p pWhat is Cluster Analysis? Types of Data in Cluster Analysis A Categorization of Major Clustering Methods Partitioning Methods Hierarchical Methods Density-Based Methods Grid -Based Methods Mode
BU - ADA - 04
Cl sfcaton and Pr cton as ii i edi iCl sfcaton and as ii i Pr cton edi ip p p p pp p p pWhat is classification? What is prediction? Issues regarding classification and prediction Classification by decision tree induction Bayesian Classificati
BU - ADA - 04
Cluster Analysis Cluster Analysis What is Cluster Analysis? Types of Data in Cluster Analysis A Categorization of Major Clustering Methods Partitioning Methods Hierarchical Methods DensityBased Methods GridBased Methods ModelBased
Pittsburgh - CHE - 2101
Lecture #17 Lecture #171Objectives1. Be able to derive the van der Waals partition function. 2. Be able to identify the salient features of the phase behavior of pure uids. 1. van der Waals EOS. Recall the semi-classical partition function: Q= Z
Pittsburgh - CHE - 2101
Lecture #14 Lecture #141Objectives1. Notation of chemical reactions 2. General equilibrium 3. Be able to derive the chemical equilibrium constants from statistical mechanics. 4. Identify how nonideal behavior can be accounted for in chemical rea
Pittsburgh - CHE - 2101
Lecture #16 Lecture #161Objectives1. Be able to list the assumptions and methods associated with the Virial Equation of state. 2. Be able to compute the second virial coecient from any given pair potential. 3. Identify the origins of cubic equat
Pittsburgh - CHE - 1008
Exam # 2 ChE 1008 DUE: Wednesday, March 31, 2004 1:00 pm in class, INSTRUCTIONS You must work completely independently on the solutions to this exam. You may not talk to anyone about the exam except the instructor. You may use lecture notes from the
Pittsburgh - CHE - 2101
Lecture #21 Lecture #211Objectives1. Be able to use two dierent methods to compute partial molar properties. 2. Be able to derive the generalized Gibbs-Duhem Equation from partial molar properties. 3. Be able to dene fugacity and fugacity coeci
Pittsburgh - CHE - 2101
Problem Set # 7 Due 22 October 2008Problems from the text Statistical Mechanics for Thermophysical Property Calculations. 1. Problem 2.14. Note that the rst equation should be Q(N, M, T ) = AeN Hint: The constant A has to do with the number of ways
Pittsburgh - CS - 1765
CS1765 Database - Practice Design Project The Athletic Department administration at Big Time University (BTU) are frustrated with the difficulty they are having in pulling together information to support various activities, including reviewing budget
Pittsburgh - CS - 1765
CS1765 Exercise 7: Advanced SQL Queries Use the Premier Parts database for this exercise. Go to http:/www.pitt.edu/~dpf7 ,click course link for Database Systems, click link for Sample Databases Right-click and save the Premier Parts database. Submitt
BU - PAPERFALL - 06
Temporary Investment Tax Incentives: Theory with Evidence from Bonus DepreciationChristopher L. House University of Michigan and NBER and Matthew D. Shapiro University of Michigan and NBERFirst draft: September 28, 2004 Revised: January 13, 2005
Pittsburgh - ICCM - 2004
In Proceedings of the Sixth International Conference on Cognitive Modeling, 344-345. Mahwah, NJ: Lawrence Earlbaum.Should successful agents have Emotions? The role of emotions in problem solvingDietrich Drner (dietrich.doerner@ppp.uni-bamberg.de)