2012-2013学年 第1学期
2012级《计算机导论》考试试题A卷
考试时间：2012年12 月23日1:00~3:30
班级 学号 姓名
? 要求答案写在答题纸上，不必抄题；
? 要求在每个大题号(I, II, III,IV,V)前划一个满页的横线，以便教师批阅； ? 要求在答题纸和试题纸上都写上班级、学号和姓名，交卷时一并交上来。
I. Choice Questions(25 questions, 1 score for each question) 1. The _____ model is the basic for today’s computer.
a. von Neumann b. Ron Newman c. Pascal d. Charles Babbage 2. ________ is a step-by-step method for solving a problem or doing a task.. a. A construct b. An algorithm c. An operating system d. A CPU 3. A byte consists of _____ bits.
a. 2 b. 4 c. 8 d. 16
4. The bitmap graphic method and the vector graphic method are used to represent ______in a computer. a. audio b. video c. numbers d. images 5. In _____ number representation, there is only one representatin for zero. a. unsigned integers b. one’s complement c. two’s complement d. a and c 6. In ______ number representation, 1111 in memory represents –1.
a. unsigned integers b. sign-and-magnitude c. one’s complement d. two’s complement
7. You use a bit pattern called a ________ to modify another bit pattern.
a. mask b. carry c. float d. byte
8. To flip all the bits of a bit pattern, make a mask of all 1s and the _____ the bit pattern and the mask.
a. AND b. OR c. NOT d. XOR 9. The _____ is a computer subsystem that performs operations on data.
a. memory b. I/O hardware c. operating system. d. CPU
10. The three steps in the running of a program on a computer are performed _____ in this specific order.
a. fetch, execute, and decode b. decode, execute, and fetch c. decode, fetch, and execute d. fetch, decode, and execute 11. A _____ bus connects the CPU and memory.
a. data b. address c. control d. all of the above
第 1 页 共 4 页
12. A _____ is a device that can route a packet based on its network layer address which is called logic address.
a. bridge b. repeater c. router d. all of the above 13. The IP address is currently _____ bits in length.
a. 4 b. 8 c. 32 d. any of the above
14. A process in the ready state goes to the running state when _____.
a. it finishes running b. it enters memory c. it gets access to the CPU d. it requests I/O
15. _____ is a program that facilitates the execution of other programs.
a. An operating system b. Hardware c. A queue d. An application program 16. The _____ construct tests a condition.
a. sequence b. repetition c. decision d. logical 17. Use a _____ search for an unordered list.
a. sequential b. binary c. bubble d. insertion
18. Recursion is a process by which an algorithm calls ________.
a. a subalgorithm b. a search algorithm c. a sorting algorithm d. itself
19. A computer uses memory-mapped I/O addressing. The address bus uses 10 lines, if memory is made of 1000 words; ______ four-register controllers can be accessed by this computer.
a. 24 b. 12 c. 6 d. 4 20. Machine language is ________.
a. a variant of BASIC b. written in Linux
c. the same as assembly language d. the only language understood by a computer 21. Testing a software package can involve _____ testing. a. black box b. white box
c. programmable data processor d. a and b
22. _____ is an ordered collection of data in which each element contains the location of the next element. a. A record b. An array c. A node d. A linked list 23. A(n) ______ list is also known as a queue.
a. LIFO b.FIFO c. ordered d.unordered 24. A(n) ______ list is also known as a stack.
a. LIFO b.FIFO c. ordered d.unordered 25. A word is _____ bits. a. 32 b. 8 c. 16 d. any of the above
第 2 页 共 4 页
II. Questions (5 questions, 4scores for each question)
1. Name the seven layers of the OSI model.
2. What are the five components of an operating system?
3. What are the three common topologies in LANs? Which is the most popular today? 4. What are three methods to represent signed integers? 5. What are the three subsystems that make up a computer?
III. Calculation (5 subjects, 4 scores for each subject)
1. For an 8-bit allocation, fill in the following blank. Decimal -125
2. Using an 8-bit allocation, first convert the following numbers to two’s complement, do the
operation, and fill the blanks with the result in hexadecimal. A +100 +127 -128 -1 B -50 +2 +50 +1 A B A + B (two’s complement in (two’s complement in (two’s complement in hexadecimal) hexadecimal) hexadecimal) Sign-and-magnitude (hexadecimal) x8F xC7 One’s complement (hexadecimal) Two’s complement (hexadecimal) xFF 3. Show the result of the following operations, and then convert the result to hexadecimal. Operations NOT x77 x15 AND x10 x55 OR xAA 第 3 页 共 4 页
results (in hexadecimal) (xFF XOR xBB) AND (xFF OR xBB)
4. Change the -13.80625 decimal numbers to binary numbers, and show it in 32-bit IEEE format, and then convert the result to hexadecimal.
5. A gray scale picture is digitized using 256 different gray levels, if the picture is composed of 800x600 pixels, how many bytes of memory are needed to store it?
IV. Analyzing (3 subjects, 6, 7, 7 scores for each subject)
1. (6 scores) A computer uses isolated I/O addressing. Memory has 1024 words. If each controller has 16 registers, how many controllers can be accessed by this computer?
2. (7 scores) A company has decided to assign a unique bit pattern to each employee. If the company has 700 employees, what is the minimum number of bits needed to create this system of representation? How many patterns are unassigned? If the company hires another 600 employees, should it increase the number of bits? Explain your answer.
3. (7 scores) Show the contents of stack s1 after the following each operation:
Push (s1, 5) Push (s1, 3) Push (s1, 2) Pop (s1) Pop (s1) Push (s1, 6)
V. Design (2 subjects, 10, 5 scores for each subject)
1. (10 scores) Using the insertion sort algorithm, manually sort the following list and show your work in each pass.
12, 6, 78, 31, 50, 46, 99, 2, 20, 44, 55.
2. (5 scores) Write a recursive algorithm in pseudocode to realize binary search. The name of algorithm is RecursiveBinarySearch. Search the list to find the target. Input target, first and last pointer. Output fail or mid pointer if finded.
第 4 页 共 4 页