1: Where does a computer add and compare data? a. Hard disk b. Floppy disk c. CPU chip d.

Memory chip

2: Which of the following registers is used to keep track of address of the memory location where the next instruction is located? a. Memory Address Register c. Instruction Register b. Memory Data Register d. Program Register

3: A complete microcomputer system consists of a. microprocessor b. memory c. peripheral equipment d. all of above

4: CPU does not perform the operation a. data transfer b. logic operation c. arithmetic operation d. all of above

5: Pipelining strategy is called implement a. instruction execution c. instruction decoding 6: A stack is a. an 8-bit register in the microprocessor b. a 16-bit register in the microprocessor c. a set of memory locations in R/WM reserved for storing information temporarily during the execution of computer d. a 16-bit memory address stored in the program counter 7: A stack pointer is a. a 16-bit register in the microprocessor that indicate the beginning of the stack memory. b. a register that decodes and executes 16-bit arithmetic expression. c. The first memory location where a subroutine address is stored. d. a register in which flag bits are stored 8: The branch logic that provides decision making capabilities in the control unit is known as a. controlled transfer b. conditional transfer c. unconditional transfer d. none of above b. instruction prefetch d. instruction manipulation

9: Interrupts which are initiated by an instruction are a. internal b. external c. hardware d. software

10: A time sharing system imply a. more than one processor in the system b. more than one program in memory

c. more than one memory in the system

d. None of above

11: Processors of all computers, whether micro, mini or mainframe must have a. ALU b. Primary Storage c. Control unit d. All of above

12: What is the control unit's function in the CPU? a. To transfer data to primary storage c. to perform logic operations b. to store program instruction d. to decode program instruction

13: What is meant by a dedicated computer? a. which is used by one person only c. which does one kind of software b. which is assigned to one and only one task d. which is meant for application software only

14: The most common addressing techniques employed by a CPU is a. immediate b. direct c. indirect d. register e. all of the above

15: When a subroutine is called, the address of the instruction following the CALL instructions stored in/on the a. stack pointer b. accumulator c. program counter d. stack

16: A microprogram written as string of 0's and 1's is a a. symbolic microinstruction c. symbolic microprogram b. binary microinstruction d. binary microprogram

17: Interrupts which are initiated by an instruction are a. internal b. external c. hardware d. software

18: Memory access in RISC architecture is limited to instructions a. CALL and RET b. PUSH and POP c. STA and LDA d. MOV and JMP

19: In immediate addressing the operand is placed a. in the CPU register b. after OP code in the instruction c. in memory d. in stack

20: Microprocessor 8085 can address location upto a. 32K b. 128K c. 64K d. 1M

21. Two main measures for the efficiency of an algorithm are a. Processor and memory b. Complexity and capacity c. Time and space d. Data and space

22. The time factor when determining the efficiency of algorithm is measured by a. Counting microseconds c. Counting the number of statements b. Counting the number of key operations d. Counting the kilobytes of algorithm

23. The space factor when determining the efficiency of algorithm is measured by

a. Counting the maximum memory needed by the algorithm b. Counting the minimum memory needed by the algorithm c. Counting the average memory needed by the algorithm d. Counting the maximum disk space needed by the algorithm 24. Which of the following case does not exist in complexity theory a. Best case b. Worst case c. Average case d. Null case

25. The Worst case occur in linear search algorithm when a. Item is somewhere in the middle of the array b. Item is not in the array at all c. Item is the last element in the array d. Item is the last element in the array or is not there at all 26. The Average case occur in linear search algorithm a. When Item is somewhere in the middle of the array b. When Item is not in the array at all c. When Item is the last element in the array d. When Item is the last element in the array or is not there at all 27. The complexity of the average case of an algorithm is a. Much more complicated to analyze than that of worst case b. Much more simpler to analyze than that of worst case c. Sometimes more complicated and some other times simpler than that of worst case d. None or above 28. The complexity of linear search algorithm is a. O(n) b. O(log n) c. O(n2) d. O(n log n)

29. The complexity of Binary search algorithm is a. O(n) b. O(log ) c. O(n2) d. O(n log n)

30. The complexity of Bubble sort algorithm is a. O(n) b. O(log n) c. O(n2) d. O(n log n)

31. The complexity of merge sort algorithm is a. O(n) b. O(log n) c. O(n2) d. O(n log n)

32. The indirect change of the values of a variable in one module by another module is called a. internal change b. inter-module change c. side effect d. side-module update

33. Which of the following data structure is not linear data structure? a. Arrays b. Linked lists c. Both of above d. None of above

34. Which of the following data structure is linear data structure? a. Trees b. Graphs c. Arrays d. None of above

35. Arrays are best data structures

a. for relatively permanent collections of data b. for the size of the structure and the data in the structure are constantly changing c. for both of above situation d. for none of above situation 36. Linked lists are best suited a. for relatively permanent collections of data b. for the size of the structure and the data in the structure are constantly changing c. for both of above situation d. for none of above situation 37. Each array declaration need not give, implicitly or explicitly, the information about a. the name of array b. the data type of array c. the first data from the set to be stored d. the index set of the array 38. The elements of an array are stored successively in memory cells because a. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated b. the architecture of computer memory does not allow arrays to store other than serially c. both of above d. none of above 39. The simplified form of the Boolean expression (X + Y + XY) (X + Z) is (A) X + Y + ZX + Y (B) XY YZ (C) X + YZ (D) XZ + Y 40. The answer of the operation (10111)2 * (1110)2 in hex equivalence is (A) 150 (B) 241 (C) 142 (D) 101011110 41. How many 1s are present in the binary representation of 3 x512 + 7 x64 + 5 x8 + 3 (A) 8 (B) 9 (C) 10 (D) 1

21: Interrupts which are initiated by an I/O drive are a. internal Answers 1. Two main measures for the efficiency of an algorithm are c. Time and space 2. The time factor when determining the efficiency of algorithm is measured by b. Counting the number of key operations 3. The space factor when determining the efficiency of algorithm is measured by a. Counting the maximum memory needed by the algorithm 4. Which of the following case does not exist in complexity theory d. Null case 5. The Worst case occur in linear search algorithm when d. Item is the last element in the array or is not there at all 6. The Average case occur in linear search algorithm a. When Item is somewhere in the middle of the array 7. The complexity of the average case of an algorithm is a. Much more complicated to analyze than that of worst case 8. The complexity of linear search algorithm is a. O(n) 9. The complexity of Binary search algorithm is 10. The complexity of Bubble sort algorithm is 11. The complexity of merge sort algorithm is b. O(log n) c. O(n2) d. O(n log n) b. external c. software d. all of above

12. The indirect change of the values of a variable in one module by another module is called c. side effect 13. Which of the following data structure is not linear data structure? d. None of above 14. Which of the following data structure is linear data structure? 17. Arrays are best data structures a. for relatively permanent collections of data 18. Linked lists are best suited c. Arrays

b. for the size of the structure and the data in the structure are constantly changing 19. Each array declaration need not give, implicitly or explicitly, the information about c. the first data from the set to be stored 20. The elements of an array are stored successively in memory cells because a. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated