RNEC-ongole CSE dept
Model Test 1 Dt:20-08-11
Answr all , each carries 1 mark Max Marks : 20 ,Time :30 min
1 .How many bits of address bus are required to address 1MB memory [ ]
a) 12 bits b) 20 bits c) 25 bits d) 24 bits
2. During the fetch/decode cycle, the contents of PC are transferred to [ ]
a) MAR b) MBR c) IR 3) Cache
3. which one of the following is not true about the primary memory [ ]
a) Implemented in high speed devices located outside CPU b)Volatile
c) Holds program contents currently being executed d)Cheaper than secondary memory
4. What are the sequence of execution of an instruction [ ]
a)Analysis, Decode and Execute b)Fetch, Decode and Execute
c)Transfer, Analysis and Execute d)Decode, Analysis and Fetch
5.The process where the DMA controller directly access the memory system to obtain the data is known as [ ]
a)Data transfer b)Data stealing c)page stealing d)cycle stealing
6.Which of the following algorithm design technique is used for binary search algorithm [ ]
a) Divide and Conquer b) Brute force c) Greedy approach d)Heuristic based approach
7. Which of the following is NOT an essential property of an algorithm [ ]
a) Definiteness b) Concurrency c) Finiteness d) Effectiveness
8. Which of the following statement is False [ ]
a) Greedy approach always gives optimal solution
b) All the algorithms must have property of definiteness
c) Computer science is study of computation d)Brute force is just DOIT approach
9. Which of the following statement is Incorrect [ ]
a)Flowchart is a graphical representation of an algorithm
b)Algorithm can be represented in the form of flowchart
c) Algorithm is a set of steps to accomplish a task and the set may contain infinite steps
d)An operating system logic in theory is not an algorithm
10. The avg. successful search time taken by binary search on a sorted array of 10 items is [ ]
a)2.6 b)2.8 c)2.9 d)3.3
11.The algorithm design technique primarly used in optimization problems is? [ ]
a)Divide and Conquer b)Greedy c)Dynamic programming d)b&c
12.Which of the following algorithm design technique uses the top down approach [ ]
a)Divide and Conquer b)Greedy c)Dynamic programming d)Brute force
______________________________________________________________________________
13. The following data structure is more efficient to store the large number of employees in the organization [ ]a) Array b) Stack c) Linked List d) Linear list
14. Virtual memory size depends on [ ]
a) address lines b) data bus c) disc space d) a & c
15. Context switch takes place when process [ ]
a) blocks b)i/o interrupt occurs c)terminates d)all
16. Indicate which of the following transition not possible [ ](a) Run-Ready (b) Run-Blocked (c) Blocked-Run (d) Run-Terminate
17. What is the disadvantage of non-preemptive scheduling [ ]
a) Aging b) Context switching c) Thrashing d) Monopoly
a) Reallocation b) Allocation c) Linking d) Both (a) and (b)
19. Compaction technique is used to overcome the ________ problem [ ]
a) Internal fragmentation b) External fragmentation c) deadlock d) Starvation
20. What is the max. decimal number that can be accommodated in a byte. [ ]
a) 128 b) 255 c) 256 d) 512
21. What is the page fault for the following reference string using LRU algorithm. Assume no. of frames available are 5 [ ]
2 3 5 2 1 3 4 6 4
a) 6 b) 5 c) 4 d) 7
22. What is the average waiting time for FCFS for the following processes whose CPU times are given below [ ]
P1 8ms P2 5ms P3 6ms
a) 7 b) 9 c) 12 d) 6
23. What is the page fault for the following reference string using LRU algorithm. Assume no. of frames available are 5 [ ]
2 3 5 2 1 3 4 6 4
a) 6 b) 5 c) 4 d) 7
24. Belody anamoly problem occurs in ____ page replacement algorithm [ ]
a) FIFO b) LRU c) MRU d) LFU
| Key for Campus Connect Sample test Dt : 20-08-11 | ||
| Q.No | Answer | |
| 1 | b | |
| 2 | a | |
| 3 | d | |
| 4 | b | |
| 5 | d | |
| 6 | a | |
| 7 | b | |
| 8 | a or c | |
| 9 | c | |
| 10 | d | |
| 11 | c | |
| 12 | a | |
| 13 | a | |
| 14 | a or d | |
| 15 | d | |
| 16 | c | |
| 17 | d | |
| 18 | d | |
| 19 | b | |
| 20 | b | |
| 21 | a | |
| 22 | a | |
| 23 | Q repeated _ Cancelled | |
| 24 | a | |
| Valued Only for a3 Questions | ||
where are explanations for this ???
ReplyDeleteThank u so much sir
ReplyDelete