Pretest/Posttest Questions Match the following terms with their definitions listed in Questions 1 thru 5. a. Algorithm , b. Encapsulation c.

Inheritance d. Interface e. Pol morphism 1. !!! "he abilit of newl created class to recei#e the ob$ects, properties, methods and other attributes of another class. %. !!! "he problem sol#ing series of steps or method ta&en for con#erting inputs of a specific problem into meaningful outputs. '. !!! A common phase used b software engineers describing the boundar where the software application interacts with the user or e(changes messages with other ob$ects. ). !!! "he combining of an ob$ect*s attributes and beha#iors into one pac&age called a class often referred to as information hiding. 5. !!! Multiple forms ha#ing the same procedure name but performing different tas&s. Multiple +hoice ,ection.. !!! A computer language composed of /*s and 1*s 0binar digits1 and used directl b a computer without translation. "he binar digits represented computer instructions and information. a. Machine language b. 2igh34e#el language c. Assembl language d. 5A,I+ 6. !!! 7eneral purpose programming language de#eloped b 8artmouth +ollege in the 19./s to teach students how to use computers. a. Machine language b. 2igh34e#el language c. Assembl language d. 5A,I+ :. !! A computer language designed for a specific machine and specific microprocessor. Mnemonics are used in place of /*s and 1*s to aid in the programming process. "he mnemonic corresponds to a machine operation 0load, sum1 and assigns addresses and storage locations. a. Machine language b. 2igh34e#el language c. Assembl language d. 5A,I+ 9. !!! A programming language using sentence3li&e statements that will generate multiple statements when it is translated into a machine language. a. Machine language

b. 2igh34e#el language c. Assembl language d. 5A,I+ 1/. !!! ;sed /*s and 1*s meaning either an on or off state or positi#e charge of negati#e charge understood b the computer. "he language was computer dependent and called machine language. a. <irst3generation computer language b. ,econd3generation computer language c. "hird3generation computer language 0'741 d. <ourth3generation computer language 0)741 11. !!! ;sed a low3le#el language consisting of mnemonic, which are abbre#iations for program instructions. "he language used is called assembl language and is machine3 dependent. a. <irst3generation computer language b. ,econd3generation computer language c. "hird3generation computer language 0'741 d. <ourth3generation computer language 0)741 1%. !!! ;sed procedure languages with English li&e statements 0Print, 8ispla 1 to create programs without ha#ing to understand specific details on how the computer processed the data. a. <irst3generation computer language b. ,econd3generation computer language c. "hird3generation computer language 0'741 d. <ourth3generation computer language 0)741 1'. !! ;sed nonprocedural language to de#elop software applications with little or no technical assistance. =onprocedural languages specif what has to be accomplished rather than to do it. a. <irst3generation computer language b. ,econd3generation computer language c. "hird3generation computer language 0'741 d. <ourth3generation computer language 0)741 "rue/<alse ,ection 1). !!Modular Programming is a programming methodolog that di#ided the steps that needed to be ta&en into separate modules addressing a specific function of the program. a. "rue b. <alse

15. !!!! +omputer circuits onl &now % states, either on or off. a. "rue

b. <alse 1.. !!!! Programs for computers can be written in onl two different languages. a. "rue b. <alse 16. !!!!Programming languages are used to pro#ide instructions to perform specific tas&s. a. "rue b. <alse 1:. !!! A complier is used to translate the entire program into machine code. a. "rue b. <alse 19. !!! Quer 4anguage uses English li&e phrases to represent the re>uired steps to be ta&en in program code referred to as an algorithm. a. "rue b. <alse %/. !!! +ompilers are used to translate source code into machine code called ob$ect code. a. "rue b. <alse %1. !!!! Interpreter con#erts the high3le#el program instructions into machine code line b line as the program is running. a. "rue b. <alse %%. !!! Procedure languages are a classification of computer languages that pro#ide instructions on what to do and how to do it and are generall referred to as high3le#el languages. a. "rue b. <alse %'. !!! ,torage refers to the place a where the program and data resides. It can be on a flopp dis&, hard dri#e, tape, or memor chips. a. "rue b. <alse %). !!!Programs written in a high3le#el language need to be con#erted into 5A,I+. a. "rue b. <alse

%5. !!!+omputers need people to pro#ide directions on how to manipulate data that will transform data into information. a. "rue b. <alse 333333333333333333333333333333333333 %.. !!! , nta( is following rules for a specific computer language including the e(act spelling, order and spacing of &e words in program statements. a. "rue b. <alse %6. !!!! ?isual 5asic .=et is an ob$ect3oriented programming language used for writing e#en3dri#en @indows applications. a. "rue b. <alse %:. !!!! Ab$ect3oriented languages include ?isual +BB, +C, .=E", Da#a, ,malltal& and ?isual 5asic .=et. a. "rue b. <alse %9. !!!!In procedure oriented languages, it is not important for the program to follow the order of the instructions. a. "rue b. <alse '/. !!!! Procedure3oriented high3le#el languages include 5A,I+ and +A5A4. a. "rue b. <alse '1. !!! "he directions gi#en to a computer is called a program. a. "rue b. <alse '%. !!! Programming languages are used to pro#ide instructions to computers to e(ecute and perform specific tas&s. a. "rue b. <alse ''. !!! EA8 stands for Eandom Application 8e#elopment a. "rue b. <alse