This download link is referred from the post: PTU B.Tech Question Papers 2020 March (All Branches)
Roll No. EEEEEEEE [ ] Total No. of Pages : 02
Total No. of Questions : 09
--- Content provided by FirstRanker.com ---
B.Tech. (IT) (2018 Batch) (Sem.-3)COMPUTER ARCHITECTURE
Subject Code : BTES-302-18
M.Code : 76394
Time : 3 Hrs. Max. Marks : 60
--- Content provided by FirstRanker.com ---
INSTRUCTIONS TO CANDIDATES :
- SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
- SECTION-B contains FIVE questions carrying FIVE marks each and students have to attempt any FOUR questions.
- SECTION-C contains THREE questions carrying TEN marks each and students have to attempt any TWO questions.
SECTION-A
--- Content provided by FirstRanker.com ---
- Answer briefly :
- What is Structural hazard in pipelining?
- Differentiate between I's complement and 2’s complement number representation systems.
- What are maskable and non-maskable interrupts?
- Differentiate between magnetic disks and magnetic tapes.
- Explain pros and cons of CISC architecture.
- Define Microinstruction and Microoperation.
- Write brief note on USB.
- Define Cache hit and cache miss.
- What are privileged and non-privileged instructions?
- What is Cache coherency?
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
SECTION-B
- Explain Interrupt and DMA mode for I/O access.
- Explain booth multiplier in detail.
- Explain in brief :
- Accumulator machine
- Stack machine
--- Content provided by FirstRanker.com ---
- Explain components of instruction cycle.
- Discuss PC relative and Base register addressing mode
SECTION-C
--- Content provided by FirstRanker.com ---
- Explain various stages in instruction pipelining. Discuss in detail methods to handle Data hazards.
- Explain below page replacement algorithms with examples :
- FIFO
- LIFO
- Least recently used
- Optimal Page replacement
--- Content provided by FirstRanker.com ---
- Give the hardware organization of associative memory. Why associative memory is faster than other memories? Deduce the logic equation used to find the match in the associative memory.
NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any page of Answer Sheet will lead to UMC against the Student.
--- Content provided by FirstRanker.com ---
This download link is referred from the post: PTU B.Tech Question Papers 2020 March (All Branches)