Computer Science Concepts and Terminology, Exams of Socialization and the Life Course

Download Computer Science Concepts and Terminology and more Exams Socialization and the Life Course in PDF only on Docsity! CSI 104 – Full Course with 264 Exam Questions & Verified Answers. 1. The _______ model is the basis for today's computers. a. Leibnitz b. von Neumann c. Pascal d. Charles Babbage - ANS B 2. In a computer, the _______ subsystem stores data and programs. a. ALU b. input/output c. memory d. control unit - ANS C 3. In a computer, the _______ subsystem performs calculations and logical opera-tons. a. ALU b. input/output c. memory d. control unit - ANS A 4. In a computer, the _______ subsystem accepts data and programs and sends pro- cussing results to output devices. a. ALU b. input/output c. memory d. control unit - ANS B 5. In a computer, the _______ subsystem serves as a manager of the other subsystems. a. ALU b. input/output c. memory d. control unit - ANS D 6. According to the von Neumann model, _______ are stored in memory. a. only data b. only programs c. data and programs d. neither data nor programs - ANS C 7. A step-by-step solution to a problem is called _______. a. hardware b. an operating system c. a computer language d. an algorithm - ANS D 8. FORTRAN and COBOL are examples of _______. a. hardware b. operating systems c. computer languages d. algorithms - ANS C P a g e 1 | 31 9. A 17th-century computing machine that could perform addition and subtraction was the _______. a. Pascale b. Jacquard loom c. Analytical Engine d. Babbage machine - ANS A 10. _______ is a set of instructions in a computer language that tells the computer what to do with data. a. An operating system b. An algorithm c. A data processor d. A program - ANS D 11. _______ is the design and writing of a program in structured form. a. Software engineering b. Hardware engineering c. Algorithm development d. Instructional architecture - ANS A 12. The first electronic special-purpose computer was called _______. a. Pascal b. Pascale c. ABC d. ENIAC - ANS C 13. One of the first computers based on the von Neumann model was called _______. a. Pascal b. Pascale c. ABC d. EDVAC - ANS D 14. The first computing machine to use the idea of storage and programming was called _______. a. the Madeline b. EDVAC c. the Babbage machine d. the Jacquard loom - ANS D 15. _______ separated the programming task from computer operation tasks. a. Algorithms b. Data processors c. High-level programming languages d. Operating systems - ANS C 1. The base of the decimal number system is ____. a) 2 b) 8 c) 10 d) 16 - ANS C 2. The base of the binary number system is ____. a) 2 b) 8 c) 10 P a g e 2 | 31 21. An image can be represented in a computer using the _______ method. a. bitmap graphic b. vector graphic c. only d. either bitmap or vector graphic - ANS d 22. In the _______ graphic method of representing an image in a computer, each pixel is assigned a bit patterns. a. bitmap b. vector c. quantized d. binary - ANS a 23. In the _______ graphic method of representing an image in a computer, the image is decomposed into a combination of geometrical figures. a. bitmap b. vector c. quantized d. binary - ANS b 24. In the _______ graphic method of representing an image in a computer, re-scaling of the image creates a ragged or grainy image. a. bitmap b. vector c. quantized d. binary - ANS a 25. Assume a new Excess system uses 17 bits to represent the exponent section. What is his bias value in this system? a. 17 b. 16 c. 65535 d. 65536 - ANS c 26. Which number representation method is often used to store the exponential value of a fractional part? a. unsigned integers b. two's complement c. Excess d. ten's complement - ANS c 27. In an Excess conversion, we _______ the number to be converted. a. add the bias number to b. the bias number from c. multiply the bias number by d. divide - ANS a 28. When a fractional part is normalized, the computer stores the _______. a. only the sign b. only the exponent c. only the mantissa d. the sign, exponent, and mantissa - ANS d P a g e 5 | 31 29. The precision of the fractional part of a number stored in a computer is defined by the _______. a. sign b. exponent c. mantissa d. last digit - ANS c 30. The combination of sign and mantissa of a real number in IEEE standard float-in point format is stored as an integer in the ____________ representation. a. unsigned b. sign-and-magnitude c. two's complement d. one's complement - ANS b 1. _______ is an arithmetic operation. a. The exclusive OR b. The unary NOT c. Subtraction d. The binary AND - ANS c 2. _______ is a logical bit operator. a. The exclusive OR b. The unary NOT c. The binary AND d. exclusive OR, unary NOT, or binary AND - ANS d 3. The _______ method of integer representation is the most common method for storing integers in computer memory. a. sign-and-magnitude b. one's complement c. two's complement d. unsigned integers - ANS c 4. In two's complement addition, if there is a final carry after the left most column addition, _______. a. add it to the right most column b. add it to the left most column c. discard it d. increase the bit length - ANS c 5. For an 8-bit allocation, the smallest decimal number that can be represented in two's complement form is _______. a. -8 b. -127 c. -128 d. -256 - ANS c 6. For an 8-bit allocation, the largest decimal number that can be represented in two's complement form is _______. a. 8 b. 127 c. 128 d. 256 - ANS b P a g e 6 | 31 7. In two's complement representation with a 4-bit allocation, we get _______ when we add 1 to 7. a. 8 b. 1 c. -7 d. -8 - ANS d 8. In two's complement representation with a 4-bit allocation, we get _______ when we add 5 to 5. a. -5 b. -6 c. -7 d. 10 - ANS b 9. If the exponent in Excess_127 is binary 10000101, the exponent in decimal is _______. a. 6 b. 7 c. 8 d. 9 - ANS a 10. If we are adding two numbers, one of which has an exponent value of 7 and the other an exponent value of 9, we need to shift the decimal point of the smaller number _______. a. one place to the left b. one place to the right c. two places to the left d. two places to the right - ANS c 11. _______ Operator (s) takes two inputs to produce one output. a. Only AND b. Only OR c. Only XOR d. AND, OR, or XOR - ANS d 12. The unary _______ operator inverts its single input. a. AND b. OR c. NOT d. XOR - ANS c 13. _______ Operator (s), if the input is two 0s, the output is 0. a. In only AND b. In only OR c. In only XOR d. In AND, OR, or XOR - ANS d 14. _______ Operator (s), if the input is two 1s, the output is 0. a. In only AND b. In only OR c. In only XOR d. In AND, OR, or XOR - ANS c 15. For the binary AND operation, only an input of _______ gives an output of 1. a. two 0s P a g e 7 | 31 d. HTTP - ANS d 13. Every computer looking to access the Internet would be known as this a. client b. desktop c. hub d. server - ANS a 14. Identifies company or commercial sites a. .org b. .com c. .go d. .eddo - ANS b 15. what is indicated when the domain name has only two letters like .us, .us, .au, .mx, or .can a. invalid domain b. private domain c. secure domain d. country domain - ANS d 1. _______ is a program that facilitates the execution of other programs. a. An operating system b. Hardware c. A queue d. An application program - ANS a 2. _______ supervises the activity of each component in a computer system. a. An operating system b. Hardware c. A queue d. An application program - ANS a 3. Multi-programming requires a _______ operating-system. a. batch b. time-sharing c. parallel d. distributed - ANS b 4. _______ is multi-programming with swapping. a. Partitioning b. Paging c. Demand paging d. Queuing - ANS c 5. _______ is multi-programming without swapping. a. Partitioning b. Virtual memory c. Demand paging d. Queuing - ANS a 6. In _______, only one program can reside in memory for execution. a. mono-programming b. multi-programming c. partitioning P a g e 10 | 31 d. paging - ANS a 7. _______ is a multi-programming method in which multiple programs are entirely in memory with each program occupying a contiguous space. a. Partitioning b. Paging c. Demand paging d. Demand segmentation - ANS a 8. In paging, a program is divided into equally sized sections called _______. a. pages b. frames c. segments d. partitions - ANS a 9. In _______, the program can be divided into differently sized sections. a. partitioning b. paging c. demand paging d. demand segmentation - ANS d 10. In _______, the program can be divided into equally sized sections called pages, but the pages need not be in memory at the same time for execution. a. partitioning b. paging c. demand paging d. demand segmentation - ANS c 11. A process in the _______ state can go to either the ready, terminated, or waiting states. a. hold b. virtual c. running d. hold or running - ANS c 12. A process in the ready state goes to the running state when _______. a. it enters memory b. it requests I/O c. it gets access to the CPU d. it finishes running - ANS c 13. A program becomes a _______ when it is selected by the operating system and brought to the hold state. a. job b. process c. deadlock d. partition - ANS a 14. Every process is _______. a. only a job b. only a program c. only a partition d. a job and a program - ANS d P a g e 11 | 31 15. The _______ scheduler creates a process from a job and changes a process back to a job. a. job b. process c. virtual d. queue - ANS a 16. The _______ scheduler moves a process from one process state to another. a. job b. process c. virtual d. queue - ANS b 17. To prevent _______, an operating system can put resource restrictions on pro-cases. a. starvation b. synchronization c. paging d. deadlock - ANS d 18. _______ can occur if a process has too many resource restrictions. a. Starvation b. Synchronization c. Paging d. Deadlock - ANS a 19. The _______ manager is responsible for archiving and backup. a. memory b. process c. device d. file - ANS d 20. The _______ manager is responsible for access to I/O devices. a. memory b. process c. device d. file - ANS c 1. _______ is a step-by-step method for solving a problem or doing a task. a. A construct b. A recursion c. An iteration d. An algorithm - ANS d 2. There are ______ basic constructs in computer -science. a. one b. two c. three d. four - ANS c 3. The _______construct tests a condition. a. sequence b. decision c. repetition d. flow - ANS b P a g e 12 | 31 1. The only language understood by computer hardware is a _______ language. a. machine b. symbolic c. high-level d. natural - ANS a 2. C, C++, and Java can be classified as _______ languages. a. machine b. symbolic c. high-level d. natural - ANS c 3. FORTRAN is a (n) _______ language. a. procedural b. functional c. declarative d. object-oriented - ANS a 4. Pascal is a (n) _______ language. a. procedural b. functional c. declarative d. object-oriented - ANS a 5. Java is a (n) _______ language. a. procedural b. functional c. declarative d. object-oriented - ANS d 6. LISP is a (n) _______ language. a. procedural b. functional c. declarative d. object-oriented - ANS b 7. _______ is a common language in the business -environment. a. FORTRAN b. C++ c. C d. COBOL - ANS d 8. _______ is a popular object-oriented language. a. FORTRAN b. COBOL c. Java d. LISP - ANS c 9. A _______ program can be either an application or an applet. a. FORTRAN b. C++ c. C d. Java - ANS d 10. LISP and Scheme are both _______ languages. P a g e 15 | 31 a. procedural b. functional c. declarative d. object-oriented - ANS b 1. One phase in system development is _______. a. analysis b. application c. designing d. collecting - ANS a 2. Defining the users, requirements, and methods is part of the _______ phase. a. analysis b. design c. implementation d. testing - ANS a 3. In the system development process, writing the program is part of the _______ phase. a. analysis b. design c. implementation d. testing - ANS c 4. In the system development process, structure charts are tools used in the _______ phase. a. analysis b. design c. implementation d. testing - ANS b 5. Testing a software system can involve _______ testing. a. black-box b. glass-box c. neither black-box nor glass-box d. both black-box and glass-box - ANS d 6. _______ is the breaking up of a large project into smaller parts. a. Coupling b. Incrementing c. Obsolescence d. Modularization - ANS d 7. _______ is a measure of how tightly two modules are bound to each other. a. Modularity b. Coupling c. Interoperability d. Cohesion - ANS b 8. _________between modules in a software system must be minimized. a. Coupling b. Cohesion c. Neither coupling nor cohesion d. Both coupling and cohesion - ANS a P a g e 16 | 31 9. _________between modules in a software system must be maximized. a. Coupling b. Cohesion c. Neither coupling nor cohesion d. Both coupling and cohesion - ANS b 10. What is the waterfall model? a. A phase cannot be started until the previous phase is completed b. A phase can be started until the previous phase is completed c. The development phase begins simultaneously d. The development process starts at the design phase - ANS a 1. A data structure can be _______. a. only an array b. only a record c. only a linked list d. an array, a record, or a linked list - ANS d 2. An array that consists of just rows and columns is a _______ array. a. one-dimensional b. two-dimensional c. three-dimensional d. multidimensional - ANS b 3. Each element in a record is called _______. a. a variable b. an index c. a field d. a node - ANS c 4. All the members of a record must be _______. a. the same type b. related types c. integer type d. character type - ANS b 5. _______ is an ordered collection of data in which each element contains the location of the next element. a. An array b. A record c. A linked list d. A file - ANS c 6. In a linked list, each element contains _______. a. only data b. only a link c. neither data nor a link d. data and a link - ANS d 7. The _______ is a pointer that identifies the next element in the linked list. a. link b. node c. array d. data - ANS a P a g e 17 | 31 3. When a sequential file is updated, the ______ file gets the actual update. a. new master b. old master c. transaction d. error report - ANS a 4. When a sequential file is updated, the ______ file contains a list of all errors occurring during the update process. a. new master b. old master c. transaction d. error report - ANS d 5. When a sequential file is updated, the ______ file contains the changes to be applied. a. new master b. old master c. transaction d. error report - ANS c 6. After a sequential file is updated, the _______ file contains the most current data. a. new master b. old master c. transaction d. error report - ANS a 7. If the transaction file key is 20 and the first master file key is 25, then we _______. a. add the new record to the new master file b. revise the contents of the old master file c. delete the data d. write the old master file record to the new master file - ANS a 8. If the transaction file key is 20 with a delete code and the master file key is 20, then we _______. a. add the transaction to the new master file b. revise the contents of the old master file c. delete the data d. write the old master file record to the new master file - ANS c 9. An indexed file consists of _______. a. only a sequential data file b. only an index c. only a random data file d. an index e. and random data file - ANS d 10. The index of an indexed file has _______ fields. a. two b. three c. four d. any number of - ANS a 11. In the _______ hashing method, selected digits are extracted from the key and used as the address. P a g e 20 | 31 a. direct b. division remainder c. modulo division d. digit extraction - ANS d 12. In the _______ hashing method, the key is divided by the file size, and the address is the remainder plus 1. a. direct b. modulo division c. division remainder d. digit extraction - ANS b 13. In the _______ hashing method, there are no synonyms or collisions. a. direct b. modulo division c. division remainder d. digit extraction - ANS a 14. _______ are keys that hash to the same location in the data file. a. Collisions b. Buckets c. Synonyms d. Linked lists - ANS c 15. When a hashing algorithm produces an address for an insertion key and that address is already occupied, it is called a _______. a. collision b. probe c. synonym d. linked list - ANS a 16. The address produced by a hashing algorithm is the _______ address. a. probe b. synonym c. collision d. home - ANS d 17. The _______ area is the file area that contains all the home addresses. a. probe b. linked c. hash d. prime - ANS d 18. In the ______ collision resolution method, we try to put data that cannot be placed in location 123 into location 124. a. open addressing b. linked list c. bucket hashing d. random hashing - ANS a 19. Which one of the following explains the sequential file access method? a. random access according to the given byte number b. read bytes one at a time, in order c. read/write sequentially by record d. read/write randomly by record - ANS b P a g e 21 | 31 20. The data structure used for file directory is called ____________ a. mount table b. hash table c. file table d. process table - ANS b 1. In a three-level DBMS architecture, the layer that interacts directly with the hardware is the _______ level. a. external b. conceptual c. internal d. physical - ANS c 2. In a three-level DBMS architecture, the _______ level determines where data is actually stored on the storage devices. a. external b. conceptual c. internal d. physical - ANS c 3. The _______ level of a three-level DBMS architecture defines the logical view of the data. a. external b. conceptual c. internal d. physical - ANS b 4. The data model and the schema of a DBMS are often defined at the _______ level. a. external b. conceptual c. internal d. physical - ANS b 5. In a three-level DBMS architecture, the _______ level interacts directly with the users. a. external b. conceptual c. internal d. physical - ANS a 6. Of the various database models, the _______ model is the most prevalent today. a. hierarchical b. network c. relational d. linked list - ANS c 7. Each column in a relation is called _______. a. an attribute b. a tuple c. a union d. an attitude - ANS a 8. Each row in a relation is called _______. a. an attribute P a g e 22 | 31 9. LZ encoding requires ___. a. only a dictionary b. only a buffer c. only an algorithm d. a dictionary, a buffer, and an algorithm - ANS d 10. JPEG encoding involves ___, a process that reveals the redundancies in a block. a. blocking b. the discrete cosine transform c. quantization d. factorization - ANS b 11. In JPEG encoding, the ___ process breaks the original picture into smaller blocks and assigns a value to each pixel in a block. a. blocking b. DCT c. quantization d. factorization - ANS a 12. The last step in JPEG, ___, removes redundancies. a. blocking b. quantization c. compression d. factorization - ANS c 13. ___ is a loss compression method for pictures and graphics, whereas ___ is a loss compression method for video. a. DCT, MPEG b. MPEG, JPEG c. JPEG, MPEG d. JPEG, DCT - ANS c 14. What is compression? a. To convert one file to another b. To reduce the size of data to save space c. To minimize the time taken for a file to be downloaded d. To compress something by pressing it very hard - ANS b 15. Which of these terms is a type of data compression? a. resolution b. zipping c. inputting d. caching - ANS b 1. Three security goals are _____. a. confidentiality, cryptography, and nonrepudiation b. confidentiality, encryption, and decryption c. confidentiality, integrity, and availability d. confidentiality, denial of service, and masquerading - ANS c 2. Which of the following attacks is threatening integrity? a. Masquerading b. Traffic Analysis c. Denial of service d. Encoding - ANS a P a g e 25 | 31 3. Which of the following attacks is threatening availability? a. Replaying b. Modification c. Denial of service d. Decoding - ANS c 4. _____________ means concealing the contents of a message by enciphering. a. Steganography b. Cryptography c. Compressing d. Authentication - ANS b 5. ______________means concealing the message by covering it with something else. a. Cryptography b. Steganography c. Compressing d. Authentication - ANS b 6. In __________cryptography, the same key is used by the sender and the receiver. a. symmetric-key b. asymmetric-key c. public-key d. open-key - ANS a 7. In _________ cryptography, the same key is used in both directions. a. symmetric-key b. asymmetric-key c. public-key d. open-key - ANS a 8. _________ Cryptography is often used for long messages. a. Symmetric-key b. Asymmetric-key c. Public-key d. Open-key - ANS a 9. ___________ Cryptography is often used for short messages. a. Symmetric-key b. Asymmetric-key c. Secret-key d. Open-key - ANS b 10. __________means that the sender and the receiver expect confidentiality. a. Nonrepudiation b. Integrity c. Authentication d. encryption and decryption - ANS d 11. ___________ means that the data must arrive at the receiver exactly as they were sent. a. Nonrepudiation b. Message integrity c. Authentication d. Secrecy - ANS b P a g e 26 | 31 12. ______________ can provide authentication, integrity, and nonrepudiation for a message. a. Encryption/decryption b. Digital signature c. Compression d. Key-exchange - ANS b 13. In ___________, the identity of a party is verified once for the entire duration of system access. a. entity authentication b. message integrity c. message authentication d. message encryption - ANS a 14. In __________ cryptography, everyone has access to everyone's public key. a. symmetric-key b. asymmetric-key c. secret-key d. private-key - ANS b 15. In the asymmetric-key method used for confidentiality, which key(s) is (are) publicly known? a. encryption key only b. decryption key only c. both encryption and decryption keys d. neither encryption key nor decryption key - ANS b 1. The _______ statement adds 1 to the variable. a. increment b. decrement c. loop d. complement - ANS a 2. The _______ statement repeats one or more actions. a. increment b. decrement c. loop d. complement - ANS c 3. The _______ statement subtracts 1 from the variable. a. increment b. decrement c. loop d. complement - ANS b 4. To clear a variable, we use the _______ statement(s). a. increment b. decrement c. loop d. decrement and loop - ANS d 5. To assign a number to a variable, we use the _______ statement(s). a. increment b. decrement P a g e 27 | 31 8. To find the orientation of an object, we use: a. stereo vision b. motion c. texture d. segmentation - ANS c 9. In language understanding, parsing a sentence is part of: a. speech recognition b. syntactic analysis c. semantic analysis d. pragmatic analysis - ANS b 10. We use brute-force search: a. if we have no prior knowledge about the search b. if we need to do the search quickly c. if we need to do the search thoroughly d. after performing heuristic search - ANS a 1. In Facebook, friendship is a _______ relationship. a. one-to-one b. one-to-many c. many-to-one d. many-to-many - ANS a 2. Communication in Facebook is a _________ relationship. a. one-to-one b. one-to-many c. many-to-one d. many-to-many - ANS b 3. The home page in Facebook can be used __________. a. only for sign-up b. only for log-in c. both for sign-up and log-in d. neither for sign-up nor for log-in - ANS c 4. To find friends in Facebook, the member can ______. a. can accept Facebook recommendation b. follow email contacts c. look for old friends d. all of the above - ANS d 5. When you are in Facebook, you can ______. a. Post news. b. read news c. neither a nor b d. both a and b - ANS d 6. In Twitter, a message can be ___________: a. of any size b. of maximum 100 characters c. of maximum 140 characters d. of maximum 200 characters - ANS c P a g e 30 | 31 7. In Twitter, the relationship between member is based on: a. friendship b. following c. either a or b d. both a and b - ANS b 8. In Twitter, follower-member is a ________ relationship. a. One-to-one. b. one-to-many c. many-to-one d. many-to-many - ANS c 9. In Twitter, communication between the sender and the receiver of a tweet is a ______________. a. One-to-one. b. one-to-many c. many-to-one d. many-to-many - ANS b 10. In Twitter, when a message is posted, __________ a. All members in the twitter can see it. b. Only followers of the sender can see it. c. Only friends of the sender can see it. d. none of the above - ANS b P a g e 31 | 31