DOC PREVIEW
GSU CSC 2311 - Savitch_ch_01

This preview shows page 1-2-3-4-29-30-31-32-59-60-61-62 out of 62 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Slide 1Chapter 1Overview1.1Computer SystemsHardwareNetworksComputer OrganizationComputer MemoryLarger Data ItemsData or Code?Secondary MemorySecondary Memory MediaMemory AccessThe ProcessorComputer SoftwareComputer InputHigh-level LanguagesLow-level LanguagesCompilersLinkersHistory NoteSection 1.1 Conclusion1.2AlgorithmsProgram DesignProblem Solving PhaseImplementation PhaseObject Oriented ProgrammingOOP CharacteristicsSoftware Life CycleSection 1.2 Conclusion1.3Introduction to C++C++ HistoryA Sample C++ ProgramExplanation of code (1/5)Explanation of code (2/5)Explanation of code (3/5)Explanation of code (4/5)Explanation of code (5/5)Program Layout (1/3)Program Layout (2/3)Program Layout (3/3)Running a C++ ProgramRun a ProgramSection 1.3 Conclusion1.4Testing and DebuggingProgram ErrorsSection 1-4 ConclusionChapter 1 -- EndDisplay 1.1Display 1.2Display 1.3Display 1.4Display 1.5Display 1.6Display 1.7Display 1.8Display 1.9Display 1.10Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-WesleyChapter 1Introduction to Computers and C++ ProgrammingSlide 1- 3Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-WesleyOverview1.1 Computer Systems 1.2 Programming and Problem Solving1.3 Introduction to C++1.4 Testing and DebuggingCopyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley1.1Computer SystemsSlide 1- 5Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-WesleyComputer SystemsA computer program is…A set of instructions for a computer to followComputer software is …The collection of programs used by a computerIncludes:EditorsTranslatorsSystem ManagersSlide 1- 6Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-WesleyHardwareThree main classes of computersPCs (Personal Computer)Relatively small used by one person at a timeWorkstationLarger and more powerful than a PCMainframeStill largerRequires support staffShared by multiple usersSlide 1- 7Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-WesleyNetworksA number of computers connected to share resourcesShare printers and other devicesShare informationSlide 1- 8Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-WesleyDisplay 1.1Computer OrganizationFive main componentsInput devicesAllows communication to the computerOutput devicesAllows communication to the userProcessor (CPU)Main memoryMemory locations containing the running programSecondary memoryPermanent record of data often on a diskSlide 1- 9Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-WesleyComputer MemoryMain MemoryLong list of memory locationsEach contains zeros and onesCan change during program executionBinary Digit or BitA digit that can only be zero or oneByteEach memory location has eight bitsAddress Number that identifies a memory locationSlide 1- 10Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-WesleyDisplay 1.2 Larger Data ItemsSome data is too large for a single byteMost integers and real numbers are too largeAddress refers to the first byte Next few consecutive bytes can store the additionalbits for larger dataSlide 1- 11Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-WesleyData or Code?‘A’ may look like 01000001 65 may look like 01000001An instruction may look like 01000001How does the computer know the meaningof 01000001?Interpretation depends on the current instructionProgrammers rarely need to be concerned with this problem.Reason as if memory locations contain letters and numbers rather than zeroes and onesSlide 1- 12Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-WesleySecondary MemoryMain memory stores instructions and data while a program is running.Secondary memoryStores instructions and data between sessionsA file stores data or instructions in secondary memorySlide 1- 13Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-WesleySecondary Memory MediaA computer might have any of thesetypes of secondary memoryHard diskFastFixed in the computer and not normally removedFloppy diskSlowEasily shared with other computersCompact diskSlower than hard disksEasily shared with other computersCan be read only or re-writableSlide 1- 14Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-WesleyMemory AccessRandom Access Usually called RAMComputer can directly access any memory locationSequential AccessData is generally found by searching throughother items firstMore common in secondary memorySlide 1- 15Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-WesleyThe ProcessorTypically called the CPUCentral Processing UnitFollows program instructions Typical capabilities of CPU include: addsubtractmultiplydividemove data from location to locationSlide 1- 16Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-WesleyComputer SoftwareThe operating system Allows us to communicate with the computerIs a program Allocates the computer’s resourcesResponds to user requests to run other programsCommon operating systems include…UNIX Linux DOSWindows Macintosh VMSSlide 1- 17Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-WesleyDisplay 1.3Computer InputComputer input consists of A programSome dataSlide 1- 18Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-WesleyHigh-level LanguagesCommon programming languages include … C C++ Java Pascal Visual Basic FORTRAN COBOL Lisp Scheme AdaThese high – level languages Resemble human languagesAre designed to be easy to read and writeUse more complicated instructions than the CPU can followMust be translated to zeros and ones for the CPU to execute a programSlide 1- 19Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Low-level LanguagesAn assembly language command such as ADD X Y Zmight mean add the values found at x and y in memory, and store the result in location z.Assembly language must be translated to machine language (zeros and ones) 0110 1001 1010 1011The CPU can follow machine languageSlide 1-


View Full Document

GSU CSC 2311 - Savitch_ch_01

Documents in this Course
ch14

ch14

65 pages

ch13

ch13

68 pages

ch06

ch06

110 pages

ch10

ch10

80 pages

Load more
Download Savitch_ch_01
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Savitch_ch_01 and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Savitch_ch_01 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?