Computer organization gate questions and answers - Practice Set 6

Computer organization gate questions and answers Practice Set 6 Practice These Questions 1 . Consider the following statem...


Computer organization gate questions and answers

computer organization and architecture solved problems

Practice Set 6
Practice These Questions

1. Consider the following statements.

S1: The RISC processor has CPI always 1.
S2: In horizontal instruction control signals are always in encoded form.
S3: In vertical instruction control signals are always in encoded form.
S4: In terms of speed vertical instruction is slower than horizontal instruction.

Which of the above statements are true?

(a) Only S1 and S2 (b) Only S2 and S3
(c) Only S1, S3 and S4 (d) None of the above

2. Computer uses addressing mode technique for __________.

(a) giving program versatility to user by providing facilities as a pointer to memory counters for
loop control
(b) reducing number of bits in the field of instruction
(c) provide rule or specification for calculating address
(d) All of the above

3. Which of the following is added to the page table in order to track whether a page of cache has been modified since it was read from the memory?
(a) Reference bit (b) Dirty bit
(c) Tag bit (d) Valid bit

4.  Select the appropriate match of list 1 with list 2

A. Pointer 1. Indirect addressing mode
B. Position independent code 2. Immediate addressing mode
C. Constant operand 3. Relative addressing mode

Codes:
A B C
(a) 1 2 3
(b) 3 2 1
(c) 1 3 2
(d) 2 3 1

5. A 50 kbps device is connected to the processor. The interrupt overhead is 50 μsec.  what is the performance achieved if interrupt initiated and data transferred is performed using programmed I/O is __________.
(a) 2.4 (b) 0.4
(c) 3 (d) 3.5

6. Consider the following sequence of micro-operations.
MBR ‹ PC
MAR ‹ SP
M[MAR] ‹ MBR
PC ‹ Vector address.
Which of the following operation performed by this sequence?
(a) Instruction fetch (b) Operand fetch
(c) Interrupt subprogram initialization (d) Conditional branch

7. We have two designs P1 and P2 for a synchronous pipeline processor. P1 has 8 pipeline stages with execution time of 3 nsec, 2 nsec, 4 nsec, 8 nsec, 2 nsec, 5 nsec, 4 nsec and 1 nsec while design P2 has 5 stages each with 5 nsec each with 5 nsec execution time. How much time (in μsec) can be saved using design P2 over design P1 for executing 500 instructions? (upto 3 digit).
(a) 2.536 (b) 1.365
(c) 1.536 (d) 1.653

8. In which of the following addressing mode, the content of the program counter is added to the address part of the instruction to get the effective address?

(a) Indexed addressing mode (b) Implied addressing mode
(c) Relative addressing mode (d) Register addressing mode

9. Suppose that a cache is 20 times faster than main memory and cache memory can be used 80% of the time. What is the speed up factor ?
(a) 2.16 (b) 3.16
(c) 4.20 (d) 4.16

10. If the last operation performed on a computer with an 8-bit word has an addition in which the two operands were 00000010 and 00000011, what would be the value of the Overflow, Sign and Half-Carry flags respectively?
(a) 0, 0, 0 (b) 0, 1, 0
(c) 1, 0, 1 (d) 0, 1, 1

11. A 4 byte long PC-relative branch instruction is fetched from memory address 51210 and while its execution, the branch is made to location 88510. Find out the displacement in relative mode.



                   

12. Consider the following program segment:
Instruction Meaning Size (words)
I1 LOAD r0, 500 r0 ⃪ [500] 2
I2 MOV r1, r0 r1 ⃪ [r0] 1
I3 ADD ro, r1 r0 ⃪ r0 + r1 1
I4 INC r0 r0 ⃪ r0 + 1 1
I5 INC r1 r1 ⃪ r1 + 1 1
I6 ADD r0, r1 r0 ⃪ r0 + r1 1
I7 Store r1, r0 M[(r1)] ⃪ r0 2
I8 Halt Stop 1

Suppose that memory is word addressable and word size is 32 bits. Program is loaded into memory location (3000)10 on wards. What is the value of program counter register at the end of the program?.

13. A branch mark program is running on a 40 MHz processor. The executed program consists of 100,000 instruction executions, with the following instruction mix and clock cycle count.
Instruction Type Instruction Count Cycles per Instruction
Integer arithmetic 45000 1
Date transfer 32000 2
Floating point 15000 2
Control transfer 8000 2

The execution time in msec is __________.
computer organization gate questions and answers pdf

14. A hypothetical control unit supports 5 groups of mutually exclusive control signals. The numbers of bits that can be saved using vertical approach compared to horizontal are __________.

15. Consider the micro-programmed control unit which support 256 instructions, each of which on an average takes 16 micro operations. The system support 16 flag conditions and 52 control signals. If vertical microprogramming control is used in the system then total length of control word is __________ (bits/word).

16. Consider a non-pipeline processor has clock rate of 25 MHz and CPI of 6, another processor designed with same clock rate and 8 stage instruction pipeline. If program has 500 instructions to be executed on both processors what will be the value of speed up factor ?

17. Consider the following statements:
S1: Compulsory miss can be reduced.
S2: Conflict miss can be reduced.
S3: Capacity miss can be reduced.
Which of the above statements are True?
(a) Only S1 (b) Only S1 and S2

(c) Only S2 and S3 (d) S1, S2 and S3

18. Consider the hypothetical processor which support 512 k words memory. It uses the memory mapped IO configuration. In which when 2 most significants bits of address are 1 then assigned to IO port.
How many numbers of I/O port address and memory addresses are possible in the processor respectively?
(a) 1×217, 3×217 (b) 3×217, 1×217
(c) 2×217, 1×217 (d) None of these

19. Which of the following statements are True?
S1: Reference bit in page table entry used for page replacement.
S2: In hierarchical memory access organization, CPU perform read and write operation on only
level 1 memory.
S3: In simultaneous memory access organization, CPU perform read and write operation on any
level of memory.
(a) S1 and S2 only (b) S1 and S3 only
(c) S2 and S3 only (d) S1, S2 and S3

20. A computer has 32-bit instruction and 9-bit address. If there are 400 two address instructions then how many one address instructions can be formulated?
(a) 214 (b) 232 – 200
(c) 214 – 400 (d) (214 – 400) × 29

21. Find the true statement

(a) In write through protocol, cache location and main memory location area unit updated simultaneously.
(b) In write back protocol, cache location and main memory location area unit updated at the same time.
(c) changed or dirty bits area unit utilized by write through protocol.
(d) None of those.

22. A 16KB 4-way set associative write-back cache is organized as multiple blocks, every of size 64-bytes.The processor generates 32-bit addresses. The cache controller maintains the tag data for every cache block comprising with one valid bit and one changed bit.

As several bits because the minimum required to spot the memory block mapped within the cache. what's the whole size of memory required at the cache controller to store meta-data (tags) for the cache?
(a) 5362 bytes (b) 5361 bytes
(c) 704 bytes (d) 176 bytes

23. Take into account a system with the most access time as two hundred ns and cache time interval as ten ns. Hit magnitude relation for browse request is zero.8 and eight0% of the memory requests area unit for browse. If write through policy is employed, then the common time considering each browse and write requests is a little more.

(a) 169.6 ns (b) 192.4 ns

(c) 78.4 ns (d) None of those


24. Consider the following instructions.
I1 : R1 = 100
I2 : R1 = R2 + R4
I3 : R2 = R4 + 25
I4 : R4 = R1 + R3
I5 : R1 = R1 + 30
Calculate sum of (WAR, RAW and WAW) dependencies the above instructions.
(a) 10 (b) 12
(c) 6 (d) 8


                                 
25. A 4-way set associative cache memory consists of 128 blocks. The main memory consists of 32768 memory blocks and each block contains 512 eight bit words. Find how many bits are needed to represent TAG, SET and WORD field respectively?
(a) 5, 9, 10 (b) 10, 6, 8
(c) 10, 9, 5 (d) 10, 5, 9

26. Suppose directed mapped cache with 2m lines 2p bytes per cache lines. Memory is byte addressable of 2n bytes. Compute the space required for storing tags (in bits)?
(a) 2n – (m+p) (b) 2m × (n – (m+p))
(c) 2n+m (d) (m+n) × 2m

27. Consider a small two-way set-associative cache memory, consisting of 4 blocks. For choosing the block to be replaced, use the least recently used (LRU) scheme. The number of cache misses for the sequence of block addresses 18, 22, 10, 22, 18 is __________.
(a) 2 (b) 3
(c) 4 (d) 5

28. Consider a pipelined system with four stages: IF, ID, EX, WB. Following chart shows the clock cycles required by each instruction to compete each stage
How many clock cycles are required to complete the above instructions?
(a) 15 (b) 9
(c) 14 (d) 13

29. A laptop features a cache, main memory and a tough disk used for computer storage. If documented word is in cache, twenty ns area unit needed to access it. If it's in main memory however not in cache sixty ns area unit required to load it into cache then reference is started once more. If word isn't in main memory, twelve ms area unit needed to fetch the word from disk followed by sixty ns to repeat into cache, the reference is started once more. The cache hit magnitude relation is zero.9 and main memory hit magnitude relation is zero.6.

The average time in nano seconds needed to access a documented word on this technique is an excellent.


30. In Associate in Nursing sweetening of a style of a CPU, the speed of a floating purpose unit has been inflated by half-hour and therefore the speed of a set purpose unit has been inflated by 2 hundredth. the quickening achieved if the magnitude relation of the amount of mounted purpose operation to floating purpose operations is four : vi and therefore the floating purpose operation accustomed take doubly the time taken by mounted purpose operation within the original style (upto two decimal places) is a little more.

31. Suppose that in a thousand memory references there area unit a hundred and fifty misses in 1st level and a hundred miss in second level cache. Assume that miss penalty from L2 cache to memory is one hundred twenty cycles. The hit time of L2 cache is fifty cycles.If there area unit four memory references per instruction, the common stall per instruction is an excellent.

32. take into account the machine with a computer memory unit available main memory of 216 computer memory unit, block size of sixteen computer memory unit and a two manner set associative mapped cache having 210 lines. Suppose there area unit 2 bytes in main memory i.e. 1st computer memory unit [E 01 F]16 and second computer memory unit [E 208]16 severally then the distinction of the set price (in decimal) between given 2 bytes i.e. (SET price of second computer memory unit – SET price of first byte) is a little more.

33. take into account 2 cache organizations. the primary one if sixty four kilobyte manner associative with sixty four computer memory unit block size. The second is of the sixty four kilobyte direct mapped cache. the dimensions of Associate in Nursing address is thirty two bits in each organizations. A four to one electronic device has latency of zero.8 ns that k bit comparator has latency of k/5 nsec. The distinction between the hit latencies of each cache organizations (i.e. associative hit latency – direct mapped hit latency) (in nsec) is an excellent.



Click Here for the Solution of This Practice SET

COMMENTS

Name

addressing modes types,1,advance-java,2,advancejava,1,aktu entrance exam,1,aktu exam schedule,1,ASP,1,bare machine,1,base register and limit register,1,C Programming,14,C Plus Plus,1,C Programming,3,C Programming MCQ,2,C Programming Questions,2,C programming study material for gate exam,12,Cache Memory,1,CBNST Program,1,Childcare,1,CJ,2,Cloud Computing,1,COA GATE Questions,1,components of use case diagram,1,Computer Architecture,2,Computer architecture based questions for gate exam,11,Computer Network,4,Computer Network Study Material,2,Computer network study material for gate,2,Computer Networks,6,Computer networks GATE Questions,1,Computer Science Study Material for Gate,19,computer science study material for gate exam,34,content based image retrieval content based image retrieval system,1,contiguous memory allocation,2,Core Java,8,COre Java Interview Questions,1,core java interviews questions,1,cyber crime report,1,Cyber crime status,1,cybercrime and security,1,cybercrime examples,1,Data Mining,1,Data Structure Questions,1,Data Transmission Architecture,1,Data Transmission in wsn,1,DBMS,5,dbms question paper,1,DE,1,Digital Electronics,1,DS,1,dynamic linking,1,dynamic linking in memory management,1,Dynamic memory allocation in c,1,Electroencephalogram,1,File Handling,1,file management in operating system notes,1,FOC,1,Fundamenatl of Computer,1,Gate 2017,5,Gate 2017 Admit card,1,Gate 2017 Exam Schedule,1,Gate 2017 Syllabus,1,gate 2018,1,gate cse study material,1,gate practice set,10,gate study material for computer science,16,Gate study material for computer science 2017,1,GatePreviousYear,1,General,3,HCL Aptitude Test,1,HR Interview Questions,1,HTML,1,Image Processing,1,Important Date of Gate 2017 Exam,1,Information Security Policy,1,internal and external fragmentation,1,JS,1,lagrange's interpolation formula,1,lagrange's interpolation formula examples,1,Looping in C,1,MComputing,1,memory fragmentation,1,memory management,1,memory management questions and answer in os,1,Motivational,4,NCER,2,Numerical Techniques Lab,1,OOT,1,Operating System,12,Operating System Gate Questions,1,Operating System Objective Questions,4,Operating System Questions Bank,1,Operating system questions for gate,1,Operating System Study material,2,operating system study material for gate exam,16,Operating system tutorial,2,page swapping,1,paged memory allocation,1,paged memory allocation in operating system,1,paging technique of memory management .paging technique,1,paging technique of memory management program in c,1,Pointer in C,4,Process based question for gate,1,Quiz on non conventional energy resources,1,Regression testing,1,relocation in memory management,1,relocation registe,1,relocation register,1,resident monitor,1,resident monitor in operating system,1,routing table,1,segmentation in memory management,1,segmentation in memory management in operating system,1,Servlet,1,session tracking,1,session tracking in java,1,session tracking in servlet,1,Software Engineering,10,Software Engineering baes study material for gate,1,software engineering interview questions,1,Software Quality Assurance,3,software verification methods,1,SPM,1,Structure in C,1,Study Material for gate Computer Science,9,swapping in memory management,1,swapping in operating system,1,TCS Code Vita,1,TCS Interview Questions,1,Technical Interview,1,Technical Questions from DBMS,1,Thrashing in Operating System,1,Threads concept in operating system,1,Tips to Learn Coding,1,Top 30 Core Java Interview Questions with Answer,2,top down approach,1,top down approach in programming,1,Types of operating system,1,UML,1,use case diagram explanation,1,website uses cookies,1,what is cookies website,1,What is process control block ?,1,what is software testing?,1,Wireless Sensor Network,3,worst fit algorithm for memory allocation,1,XML,1,
ltr
item
Computer Science Junction: Computer organization gate questions and answers - Practice Set 6
Computer organization gate questions and answers - Practice Set 6
https://1.bp.blogspot.com/-V4a1tpKteqo/W8twslqffUI/AAAAAAAAA-U/2NStJBGmaZUGpsNCVp2wT7D5oghzx5ZRwCLcBGAs/s320/coagatequestions.jpg
https://1.bp.blogspot.com/-V4a1tpKteqo/W8twslqffUI/AAAAAAAAA-U/2NStJBGmaZUGpsNCVp2wT7D5oghzx5ZRwCLcBGAs/s72-c/coagatequestions.jpg
Computer Science Junction
https://www.computersciencejunction.in/2017/10/computer-organization-and-architecture-based-questions-for-gate-exam6.html
https://www.computersciencejunction.in/
https://www.computersciencejunction.in/
https://www.computersciencejunction.in/2017/10/computer-organization-and-architecture-based-questions-for-gate-exam6.html
true
425357657003182083
UTF-8
Loaded All Posts Not found any posts VIEW ALL Readmore Reply Cancel reply Delete By Home PAGES POSTS View All RECOMMENDED FOR YOU LABEL ARCHIVE SEARCH ALL POSTS Not found any post match with your request Back Home Sunday Monday Tuesday Wednesday Thursday Friday Saturday Sun Mon Tue Wed Thu Fri Sat January February March April May June July August September October November December Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec just now 1 minute ago $$1$$ minutes ago 1 hour ago $$1$$ hours ago Yesterday $$1$$ days ago $$1$$ weeks ago more than 5 weeks ago Followers Follow THIS PREMIUM CONTENT IS LOCKED STEP 1: Share. STEP 2: Click the link you shared to unlock Copy All Code Select All Code All codes were copied to your clipboard Can not copy the codes / texts, please press [CTRL]+[C] (or CMD+C with Mac) to copy