Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
|
|
- Samuel Horton
- 5 years ago
- Views:
Transcription
1
2 Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
3 Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C Testig ad Debuggig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
4 1.1 Computer Systems Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
5 Computer Systems A computer program is A set of istructios for a computer to follow Computer software is The collectio of programs used by a computer Icludes: Editors Traslators System Maagers Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
6 Hardware Three mai classes of computers PCs (Persoal Computer) Relatively small used by oe perso at a time Workstatio Larger ad more powerful tha a PC Maiframe Still larger Requires support staff Shared by multiple users Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
7 Networks A umber of computers coected to share resources Share priters ad other devices Share iformatio Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
8 Computer Orgaizatio Five mai compoets Iput devices Allows commuicatio to the computer Output devices Allows commuicatio to the user Processor (CPU) Mai memory Memory locatios cotaiig the ruig program Secodary memory Permaet record of data ofte o a disk Display 1.1 Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
9 Computer Memory Mai Memory Log list of memory locatios Each cotais zeros ad oes Ca chage durig program executio Biary Digit or Bit A digit that ca oly be zero or oe Byte Each memory locatio has eight bits Address Number that idetifies a memory locatio Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
10 Larger Data Items Some data is too large for a sigle byte Most itegers ad real umbers are too large Address refers to the first byte Next few cosecutive bytes ca store the additioal bits for larger data Display 1.2 Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
11 Data or Code? A may look like may look like A istructio may look like How does the computer kow the meaig of ? Iterpretatio depeds o the curret istructio Programmers rarely eed to be cocered with this problem. Reaso as if memory locatios cotai letters ad umbers rather tha zeroes ad oes Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
12 Secodary Memory Mai memory stores istructios ad data while a program is ruig. Secodary memory Stores istructios ad data betwee sessios A file stores data or istructios i secodary memory Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
13 Secodary Memory Media A computer might have ay of these types of secodary memory Hard disk Fast Fixed i the computer ad ot ormally removed Floppy disk Slow Easily shared with other computers Compact disk Slower tha hard disks Easily shared with other computers Ca be read oly or re-writable Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
14 Memory Access Radom Access Usually called RAM Computer ca directly access ay memory locatio Sequetial Access Data is geerally foud by searchig through other items first More commo i secodary memory Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
15 The Processor Typically called the CPU Cetral Processig Uit Follows program istructios Typical capabilities of CPU iclude: add subtract multiply divide move data from locatio to locatio Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
16 Computer Software The operatig system Allows us to commuicate with the computer Is a program Allocates the computer s resources Respods to user requests to ru other programs Commo operatig systems iclude UNIX Liux DOS Widows Macitosh VMS Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
17 Computer Iput Computer iput cosists of A program Some data Display 1.3 Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
18 High-level Laguages Commo programmig laguages iclude C C++ Java Pascal Visual Basic FORTRAN Perl PHP Lisp Scheme Ada C# Pytho These high level laguages Resemble huma laguages Are desiged to be easy to read ad write Use more complicated istructios tha the CPU ca follow Must be traslated to zeros ad oes for the CPU to execute a program Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
19 Low-level Laguages A assembly laguage commad such as ADD X Y Z might mea add the values foud at x ad y i memory, ad store the result i locatio z. Assembly laguage must be traslated to machie laguage (zeros ad oes) The CPU ca follow machie laguage Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
20 Compilers Traslate high-level laguage to machie laguage Source code The origial program i a high level laguage Object code The traslated versio i machie laguage Display 1.4 Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
21 Likers Some programs we use are already compiled Their object code is available for us to use For example: Iput ad output routies A Liker combies The object code for the programs we write ad The object code for the pre-compiled routies ito The machie laguage program the CPU ca ru Display 1.5 Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
22 History Note First programmable computer Desiged by Charles Babbage Bega work i 1822 Not completed i Babbage s life time First programmer Ada Augusta, Coutess of Lovelace Colleague of Babbage Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
23 Sectio 1.1 Coclusio Ca you List the five mai compoets of a computer? List the data for a program that adds two umbers? Describe the work of a compiler? Defie source code? Defie object code? Describe the purpose of the operatig system? Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
24 1.2 Programmig ad Problem- Solvig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
25 Algorithms Algorithm A sequece of precise istructios that leads to a solutio Program A algorithm expressed i a laguage the computer ca uderstad Display 1.6 Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
26 Program Desig Programmig is a creative process No complete set of rules for creatig a program Program Desig Process Problem Solvig Phase Result is a algorithm that solves the problem Implemetatio Phase Result is the algorithm traslated ito a programmig laguage Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
27 Problem Solvig Phase Be certai the task is completely specified What is the iput? What iformatio is i the output? How is the output orgaized? Develop the algorithm before implemetatio Experiece shows this saves time i gettig your program to ru. Test the algorithm for correctess Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
28 Implemetatio Phase Traslate the algorithm ito a programmig laguage Easier as you gai experiece with the laguage Compile the source code Locates errors i usig the programmig laguage Ru the program o sample data Verify correctess of results Results may require modificatio of the algorithm ad program Display 1.7 Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
29 Object Orieted Programmig Abbreviated OOP Used for may moder programs Program is viewed as iteractig objects Each object cotais algorithms to describe its behavior Program desig phase ivolves desigig objects ad their algorithms Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
30 OOP Characteristics Ecapsulatio Iformatio hidig Objects cotai their ow data ad algorithms Iheritace Writig reusable code Objects ca iherit characteristics from other objects Polymorphism A sigle ame ca have multiple meaigs depedig o its cotext Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
31 Software Life Cycle Aalysis ad specificatio of the task (problem defiitio) Desig of the software (object ad algorithm desig) Implemetatio (codig) Maiteace ad evolutio of the system Obsolescece Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
32 Sectio 1.2 Coclusio Ca you Describe the first step to take whe creatig a program? List the two mai phases of the program desig process? Explai the importace of the problem-solvig phase? List the steps i the software life cycle? Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
33 1.3 Itroductio to C++ Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
34 Itroductio to C++ Where did C++ come from? Derived from the C laguage C was derived from the B laguage B was derived from the BCPL laguage Why the ++? ++ is a operator i C++ ad results i a cute pu Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
35 C++ History C developed by Deis Ritchie at AT&T Bell Labs i the 1970s. Used to maitai UNIX systems May commercial applicatios writte i c C++ developed by Bjare Stroustrup at AT&T Bell Labs i the 1980s. Overcame several shortcomigs of C Icorporated object orieted programmig C remais a subset of C++ Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
36 A Sample C++ Program A simple C++ program begis this way #iclude <iostream> usig amespace std; it mai() { Ad eds this way } retur 0; Display 1.8 Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
37 Explaatio of code (1/5) Variable declaratio lie it umber_of_pods, peas_per_pod, total_peas; Idetifies ames of three variables to ame umbers it meas that the variables represet itegers Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
38 Explaatio of code (2/5) Program statemet cout << Press retur after eterig a umber.\ ; cout (see-out) used for output to the moitor << iserts Press a umber.\ i the data boud for the moitor Thik of cout as a ame for the moitor << poits to where the data is to ed up \ causes a ew lie to be started o the moitor Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
39 Explaatio of code (3/5) Program statemet ci >> umber_of_pods; ci (see-i) used for iput from the keyboard >> extracts data from the keyboard Thik of ci as a ame for the keyboard >> poits from the keyboard to a variable where the data is stored Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
40 Explaatio of code (4/5) Program statemet total_peas = umber_of_pods * peas_per_pod; Performs a computatio * is used for multiplicatio = causes total_peas to get a ew value based o the calculatio show o the right of the equal sig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
41 Explaatio of code (5/5) Program statemet cout << umber_of_pods; Seds the value of variable umber_of_pods to the moitor Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
42 Program Layout (1/3) Compiler accepts almost ay patter of lie breaks ad idetatio Programmers format programs so they are easy to read Place opeig brace { ad closig brace } o a lie by themselves Idet statemets Use oly oe statemet per lie Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
43 Program Layout (2/3) Variables are declared before they are used Typically variables are declared at the begiig of the program Statemets (ot always lies) ed with a semi-colo Iclude Directives #iclude <iostream> Tells compiler where to fid iformatio about items used i the program iostream is a library cotaiig defiitios of ci ad cout Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
44 Program Layout (3/3) usig amespace std; Tells the compiler to use ames i iostream i a stadard way To begi the mai fuctio of the program it mai() { To ed the mai fuctio retur 0; } Mai fuctio eds with a retur statemet Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
45 Ruig a C++ Program C++ source code is writte with a text editor The compiler o your system coverts source code to object code. The liker combies all the object code ito a executable program. Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
46 C++11 C++11 (formerly kow as C++0x) is the most recet versio of the stadard of the C++ programmig laguage. Approved o August 12, 2011 by the Iteratioal Orgaizatio for Stadardizatio. C++11 laguage features are ot supported by older compilers Check the documetatio with your compiler to determie if special steps are eeded to compile C++11 programs e.g. with g++, use extra flags of std=c++11 Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
47 Ru a Program Obtai code i Display 1.10 Compile the code Fix ay errors the compiler idicates ad re-compile the code Ru the program Display 1.10 Now you kow how to ru a program o your system Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
48 Sectio 1.3 Coclusio Ca you Describe the output of this lie? cout << C++ is easy to uderstad. ; Explai what this lie does? ci >> peas_per_pod; Explai this? #iclude <iostream> Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
49 1.4 Testig ad Debuggig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
50 Testig ad Debuggig Bug A mistake i a program Debuggig Elimiatig mistakes i programs Term used whe a moth caused a failed relay o the Harvard Mark 1 computer. Grace Hopper ad other programmers taped the moth i logbook statig: First actual case of a bug beig foud. Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
51 Program Errors Sytax errors Violatio of the grammar rules of the laguage Discovered by the compiler Error messages may ot always show correct locatio of errors Ru-time errors Error coditios detected by the computer at ru-time Logic errors Errors i the program s algorithm Most difficult to diagose Computer does ot recogize a error Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
52 Sectio 1-4 Coclusio Ca you Describe the three kids of program errors? Tell what kid of errors the compiler catches? What kid of error is produced if you forget a puctuatio symbol such as a semi-colo? Tell what type of error is produced whe a program rus but produces icorrect results? Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
53 Chapter 1 -- Ed Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
54 Display 1.1 Back Next Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
55 Display 1.2 Back Next Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
56 Display 1.3 Back Next Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
57 Display 1.4 Back Next Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
58 Display 1.5 Back Next Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
59 Display 1.6 Back Next Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
60 Display 1.7 Back Next Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
61 Display 1.8 Back Next Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
62 Display 1.9 Back Next Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
63 Display 1.10 Back Next Copyright 2015 Pearso Educatio, Ltd.. All rights reserved.
Python Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationChapter 4. Procedural Abstraction and Functions That Return a Value. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 4 Procedural Abstractio ad Fuctios That Retur a Value Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 4.1 Top-Dow Desig 4.2 Predefied Fuctios 4.3 Programmer-Defied Fuctios 4.4
More informationChapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig
More informationChapter 10. Defining Classes. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 10 Defiig Classes Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 10.1 Structures 10.2 Classes 10.3 Abstract Data Types 10.4 Itroductio to Iheritace Copyright 2015 Pearso Educatio,
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationn Some thoughts on software development n The idea of a calculator n Using a grammar n Expression evaluation n Program organization n Analysis
Overview Chapter 6 Writig a Program Bjare Stroustrup Some thoughts o software developmet The idea of a calculator Usig a grammar Expressio evaluatio Program orgaizatio www.stroustrup.com/programmig 3 Buildig
More informationAbstract. Chapter 4 Computation. Overview 8/13/18. Bjarne Stroustrup Note:
Chapter 4 Computatio Bjare Stroustrup www.stroustrup.com/programmig Abstract Today, I ll preset the basics of computatio. I particular, we ll discuss expressios, how to iterate over a series of values
More informationCOP4020 Programming Languages. Compilers and Interpreters Prof. Robert van Engelen
COP4020 mig Laguages Compilers ad Iterpreters Prof. Robert va Egele Overview Commo compiler ad iterpreter cofiguratios Virtual machies Itegrated developmet eviromets Compiler phases Lexical aalysis Sytax
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationChapter 2. C++ Basics. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 2 C++ Basics Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 2.1 Variables ad Assigmets 2.2 Iput ad Output 2.3 Data Types ad Expressios 2.4 Simple Flow of Cotrol 2.5 Program
More informationCS 11 C track: lecture 1
CS 11 C track: lecture 1 Prelimiaries Need a CMS cluster accout http://acctreq.cms.caltech.edu/cgi-bi/request.cgi Need to kow UNIX IMSS tutorial liked from track home page Track home page: http://courses.cms.caltech.edu/courses/cs11/material
More informationGE FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III
GE2112 - FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III PROBLEM SOLVING AND OFFICE APPLICATION SOFTWARE Plaig the Computer Program Purpose Algorithm Flow Charts Pseudocode -Applicatio Software Packages-
More informationBaan Tools User Management
Baa Tools User Maagemet Module Procedure UP008A US Documetiformatio Documet Documet code : UP008A US Documet group : User Documetatio Documet title : User Maagemet Applicatio/Package : Baa Tools Editio
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationChapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4
More informationCS 111 Green: Program Design I Lecture 27: Speed (cont.); parting thoughts
CS 111 Gree: Program Desig I Lecture 27: Speed (cot.); partig thoughts By Nascarkig - Ow work, CC BY-SA 4.0, https://commos.wikimedia.org/w/idex.php?curid=38671041 Robert H. Sloa (CS) & Rachel Poretsky
More informationBasic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.
5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator
More informationFundamentals of. Chapter 1. Microprocessor and Microcontroller. Dr. Farid Farahmand. Updated: Tuesday, January 16, 2018
Fudametals of Chapter 1 Microprocessor ad Microcotroller Dr. Farid Farahmad Updated: Tuesday, Jauary 16, 2018 Evolutio First came trasistors Itegrated circuits SSI (Small-Scale Itegratio) to ULSI Very
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationn Maurice Wilkes, 1949 n Organize software to minimize errors. n Eliminate most of the errors we made anyway.
Bjare Stroustrup www.stroustrup.com/programmig Chapter 5 Errors Abstract Whe we program, we have to deal with errors. Our most basic aim is correctess, but we must deal with icomplete problem specificatios,
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationOne advantage that SONAR has over any other music-sequencing product I ve worked
*gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig
More informationChapter 8. Strings and Vectors. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 8 Strigs ad Vectors Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 8.1 A Array Type for Strigs 8.2 The Stadard strig Class 8.3 Vectors Copyright 2015 Pearso Educatio, Ltd..
More informationCS 111: Program Design I Lecture # 7: Web Crawler, Functions; Open Access
CS 111: Program Desig I Lecture # 7: Web Crawler, Fuctios; Ope Access Robert H. Sloa & Richard Warer Uiversity of Illiois at Chicago September 13, 2016 Lab Hit/Remider word = "hi" word.upper() à "HI" Questio
More informationToday s objectives. CSE401: Introduction to Compiler Construction. What is a compiler? Administrative Details. Why study compilers?
CSE401: Itroductio to Compiler Costructio Larry Ruzzo Sprig 2004 Today s objectives Admiistrative details Defie compilers ad why we study them Defie the high-level structure of compilers Associate specific
More informationCOMP Parallel Computing. PRAM (1): The PRAM model and complexity measures
COMP 633 - Parallel Computig Lecture 2 August 24, 2017 : The PRAM model ad complexity measures 1 First class summary This course is about parallel computig to achieve high-er performace o idividual problems
More informationOverview Chapter 12 A display model
Overview Chapter 12 A display model Why graphics? A graphics model Examples Bjare Stroustrup www.stroustrup.com/programmig 3 Why bother with graphics ad GUI? Why bother with graphics ad GUI? It s very
More informationAlgorithm. Counting Sort Analysis of Algorithms
Algorithm Coutig Sort Aalysis of Algorithms Assumptios: records Coutig sort Each record cotais keys ad data All keys are i the rage of 1 to k Space The usorted list is stored i A, the sorted list will
More informationCS : Programming for Non-Majors, Summer 2007 Programming Project #3: Two Little Calculations Due by 12:00pm (noon) Wednesday June
CS 1313 010: Programmig for No-Majors, Summer 2007 Programmig Project #3: Two Little Calculatios Due by 12:00pm (oo) Wedesday Jue 27 2007 This third assigmet will give you experiece writig programs that
More informationGetting Started. Getting Started - 1
Gettig Started Gettig Started - 1 Issue 1 Overview of Gettig Started Overview of Gettig Started This sectio explais the basic operatios of the AUDIX system. It describes how to: Log i ad log out of the
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad
More informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More informationChapter 6. I/O Streams as an Introduction to Objects and Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 6 I/O Streams as a Itroductio to Objects ad Classes Overview 6.1 Streams ad Basic File I/O 6.2 Tools for Stream I/O 6.3 Character I/O Slide 6-3 6.1 Streams ad Basic File I/O I/O Streams I/O refers
More informationEE University of Minnesota. Midterm Exam #1. Prof. Matthew O'Keefe TA: Eric Seppanen. Department of Electrical and Computer Engineering
EE 4363 1 Uiversity of Miesota Midterm Exam #1 Prof. Matthew O'Keefe TA: Eric Seppae Departmet of Electrical ad Computer Egieerig Uiversity of Miesota Twi Cities Campus EE 4363 Itroductio to Microprocessors
More informationArchitectural styles for software systems The client-server style
Architectural styles for software systems The cliet-server style Prof. Paolo Ciacarii Software Architecture CdL M Iformatica Uiversità di Bologa Ageda Cliet server style CS two tiers CS three tiers CS
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More informationthe beginning of the program in order for it to work correctly. Similarly, a Confirm
I our sytax, a Assume statemet will be used to record what must be true at the begiig of the program i order for it to work correctly. Similarly, a Cofirm statemet is used to record what should be true
More informationCOSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1
COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,
More informationChapter 8. Strings and Vectors. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 8 Strigs ad Vectors Overview 8.1 A Array Type for Strigs 8.2 The Stadard strig Class 8.3 Vectors Slide 8-3 8.1 A Array Type for Strigs A Array Type for Strigs C-strigs ca be used to represet strigs
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationChapter 3. More Flow of Control. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 3 More Flow of Cotrol Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 3.1 Usig Boolea Expressios 3.2 Multiway Braches 3.3 More about C++ Loop Statemets 3.4 Desigig Loops Copyright
More informationCOP4020 Programming Languages. Functional Programming Prof. Robert van Engelen
COP4020 Programmig Laguages Fuctioal Programmig Prof. Robert va Egele Overview What is fuctioal programmig? Historical origis of fuctioal programmig Fuctioal programmig today Cocepts of fuctioal programmig
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationCS 111: Program Design I Lecture # 7: First Loop, Web Crawler, Functions
CS 111: Program Desig I Lecture # 7: First Loop, Web Crawler, Fuctios Robert H. Sloa & Richard Warer Uiversity of Illiois at Chicago September 18, 2018 What will this prit? x = 5 if x == 3: prit("hi!")
More informationCode Review Defects. Authors: Mika V. Mäntylä and Casper Lassenius Original version: 4 Sep, 2007 Made available online: 24 April, 2013
Code Review s Authors: Mika V. Mätylä ad Casper Lasseius Origial versio: 4 Sep, 2007 Made available olie: 24 April, 2013 This documet cotais further details of the code review defects preseted i [1]. of
More informationimplement language system
Outlie Priciples of programmig laguages Lecture 3 http://few.vu.l/~silvis/ppl/2007 Part I. Laguage systems Part II. Fuctioal programmig. First look at ML. Natalia Silvis-Cividjia e-mail: silvis@few.vu.l
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies
More informationBAAN IVc/BaanERP. Conversion Guide Oracle7 to Oracle8
BAAN IVc/BaaERP A publicatio of: Baa Developmet B.V. P.O.Box 143 3770 AC Bareveld The Netherlads Prited i the Netherlads Baa Developmet B.V. 1999. All rights reserved. The iformatio i this documet is subject
More informationtop() Applications of Stacks
CS22 Algorithms ad Data Structures MW :00 am - 2: pm, MSEC 0 Istructor: Xiao Qi Lecture 6: Stacks ad Queues Aoucemets Quiz results Homework 2 is available Due o September 29 th, 2004 www.cs.mt.edu~xqicoursescs22
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationK-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns
K-NET bus The K-Net bus is based o the SPI bus but it allows to addressig may differet turrets like the I 2 C bus. The K-Net is 6 a wires bus (4 for SPI wires ad 2 additioal wires for request ad ackowledge
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationChapter 4 The Datapath
The Ageda Chapter 4 The Datapath Based o slides McGraw-Hill Additioal material 24/25/26 Lewis/Marti Additioal material 28 Roth Additioal material 2 Taylor Additioal material 2 Farmer Tae the elemets that
More informationCMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationAvid Interplay Bundle
Avid Iterplay Budle Versio 2.5 Cofigurator ReadMe Overview This documet provides a overview of Iterplay Budle v2.5 ad describes how to ru the Iterplay Budle cofiguratio tool. Iterplay Budle v2.5 refers
More informationn We have discussed classes in previous lectures n Here, we discuss design of classes n Library design considerations
Chapter 14 Graph class desig Bjare Stroustrup Abstract We have discussed classes i previous lectures Here, we discuss desig of classes Library desig cosideratios Class hierarchies (object-orieted programmig)
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More informationThreads and Concurrency in Java: Part 1
Cocurrecy Threads ad Cocurrecy i Java: Part 1 What every computer egieer eeds to kow about cocurrecy: Cocurrecy is to utraied programmers as matches are to small childre. It is all too easy to get bured.
More informationThreads and Concurrency in Java: Part 1
Threads ad Cocurrecy i Java: Part 1 1 Cocurrecy What every computer egieer eeds to kow about cocurrecy: Cocurrecy is to utraied programmers as matches are to small childre. It is all too easy to get bured.
More informationIntroduction CHAPTER Computers
Iside a Computer CHAPTER Itroductio. Computers A computer is a electroic device that accepts iput, stores data, processes data accordig to a set of istructios (called program), ad produces output i desired
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 20 Itroductio to Trasactio Processig Cocepts ad Theory Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Trasactio Describes local
More informationOutline. CSCI 4730 Operating Systems. Questions. What is an Operating System? Computer System Layers. Computer System Layers
Outlie CSCI 4730 s! What is a s?!! System Compoet Architecture s Overview Questios What is a?! What are the major operatig system compoets?! What are basic computer system orgaizatios?! How do you commuicate
More informationCSE 111 Bio: Program Design I Class 11: loops
SE 111 Bio: Program Desig I lass 11: loops Radall Muroe, xkcd.com/1411/ Robert H. Sloa (S) & Rachel Poretsky (Bio) Uiversity of Illiois, hicago October 2, 2016 Pytho ets Loopy! he Pytho, Busch ardes Florida
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5.
Morga Kaufma Publishers 26 February, 208 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Virtual Memory Review: The Memory Hierarchy Take advatage of the priciple
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 22 Database Recovery Techiques Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Recovery algorithms Recovery cocepts Write-ahead
More informationThe VSS CCD photometry spreadsheet
The VSS CCD photometry spreadsheet Itroductio This Excel spreadsheet has bee developed ad tested by the BAA VSS for aalysig results files produced by the multi-image CCD photometry procedure i AIP4Wi v2.
More informationLast class. n Scheme. n Equality testing. n eq? vs. equal? n Higher-order functions. n map, foldr, foldl. n Tail recursion
Aoucemets HW6 due today HW7 is out A team assigmet Submitty page will be up toight Fuctioal correctess: 75%, Commets : 25% Last class Equality testig eq? vs. equal? Higher-order fuctios map, foldr, foldl
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:
More informationCSE 111 Bio: Program Design I Lecture 17: software development, list methods
CSE 111 Bio: Program Desig I Lecture 17: software developmet, list methods Robert H. Sloa(CS) & Rachel Poretsky(Bio) Uiversity of Illiois, Chicago October 19, 2017 NESTED LOOPS: REVIEW Geerate times table
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationDefinitions. Error. A wrong decision made during software development
Debuggig Defiitios Error A wrog decisio made durig software developmet Defiitios 2 Error A wrog decisio made durig software developmet Defect bug sometimes meas this The term Fault is also used Property
More informationTargetLink. Installation Notes. MATLAB R14SP3 Compatibility Update for TargetLink 2.1
TargetLik Istallatio Notes MATLAB R14SP3 Compatibility Update for TargetLik 2.1 TargetLik 2.1.5 November 2005 ds How to Cotact dspace Mail: Tel.: Fax: E-mail: Web: Geeral Techical Support: TargetLik Support:
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationRecursion. Computer Science S-111 Harvard University David G. Sullivan, Ph.D. Review: Method Frames
Uit 4, Part 3 Recursio Computer Sciece S-111 Harvard Uiversity David G. Sulliva, Ph.D. Review: Method Frames Whe you make a method call, the Java rutime sets aside a block of memory kow as the frame of
More informationIn this chapter, you learn the concepts and terminology of databases and
A Itroductio to Database Developmet I this chapter, you lear the cocepts ad termiology of databases ad how to desig the tables that your forms ad reports will use. Fially, you build the actual tables used
More informationExercise 6 (Week 42) For the foreign students only.
These are the last exercises of the course. Please, remember that to pass exercises, the sum of the poits gathered by solvig the questios ad attedig the exercise groups must be at least 4% ( poits) of
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationComputer Systems - HS
What have we leared so far? Computer Systems High Level ENGG1203 2d Semester, 2017-18 Applicatios Sigals Systems & Cotrol Systems Computer & Embedded Systems Digital Logic Combiatioal Logic Sequetial Logic
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5
Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:
More information3.1 Overview of MySQL Programs. These programs are discussed further in Chapter 4, Database Administration. Client programs that access the server:
3 Usig MySQL Programs This chapter provides a brief overview of the programs provided by MySQL AB ad discusses how to specify optios whe you ru these programs. Most programs have optios that are specific
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationFrom last week. Lecture 5. Outline. Principles of programming languages
Priciples of programmig laguages From last week Lecture 5 http://few.vu.l/~silvis/ppl/2007 Natalia Silvis-Cividjia e-mail: silvis@few.vu.l ML has o assigmet. Explai how to access a old bidig? Is & for
More informationChapter 4 Threads. Operating Systems: Internals and Design Principles. Ninth Edition By William Stallings
Operatig Systems: Iterals ad Desig Priciples Chapter 4 Threads Nith Editio By William Stalligs Processes ad Threads Resource Owership Process icludes a virtual address space to hold the process image The
More informationCS 111: Program Design I Lecture 15: Objects, Pandas, Modules. Robert H. Sloan & Richard Warner University of Illinois at Chicago October 13, 2016
CS 111: Program Desig I Lecture 15: Objects, Padas, Modules Robert H. Sloa & Richard Warer Uiversity of Illiois at Chicago October 13, 2016 OBJECTS AND DOT NOTATION Objects (Implicit i Chapter 2, Variables,
More information