DCA6210 COMPUTER ARCHITECTURE

Description

SESSION	JAN 2026
PROGRAM	MASTER OF COMPUTER APPLICATIONS (MCA)
SEMESTER	II
COURSE CODE & NAME	DCA6210 COMPUTER ARCHITECTURE

 

Assignment Set – 1

 

Q.1. What is mapping? Explain the difference between Direct and Associative mapping. (10 Marks)

Ans 1.

Mapping in Cache Memory

Mapping is the act of establishing a correspondence between main memory blocks as well as lines (slots) inside the cache memory. It determines where the particular piece of memory is stored in cache. The goal of mapping is that, when a CPU attempts to request an address for memory and the cache controller has the ability to quickly determine whether the required data is present in cache (a cache hit) or must be fetched from main memory (a cache error). The effectiveness of the mapping strategy directly affects the frequency of cache hits as well as overall performance of the

 

Its Half solved only

Buy Complete from our online store

 

https://smuassignment.in/online-store/

 

MUJ Fully solved assignment available for session Jan-Feb 2026.

 

Lowest price guarantee with quality.

Charges INR 198 only per assignment. For more information you can get via mail or Whats app also

Mail id is aapkieducation@gmail.com

 

Our website www.smuassignment.in

After mail, we will reply you instant or maximum

1 hour.

Otherwise you can also contact on our

whatsapp no 8791490301.

 

 

Q.2. Write in brief the process of implementation of FX pipelines. (10 Marks)

Ans 2.

FX Pipelines in Computer Architecture

Fixed-point (FX) math pipelines are special hardware machines designed for Arithmetic operations that are fixed point, such as subtraction or subtraction, multiplication and division with integer or fixed-point binary numbers using an architecture of pipelines that spans various independent operations, resulting in higher efficiency. Fixed-point representation stores numbers with an implicit binary point located at an exact location, which makes the arithmetic functions directly attainable on hardware with integer components with no need for floating-point normalization and exponent

 

 

Q.3. What are different types of addressing modes? Explain in detail. (10 Marks)

Ans 3.

Addressing Modes in Computer Architecture

Addressing mode defines what the operation of an instruction is specified how effectively the address of data being operated on is calculated from the address field within the instruction. Different types of addressing provide compilers and programmers with various options to access data stored in memory, registers and as constants inside instructions that allow for the efficient coding of various data access patterns in machine programming.

Immediate and

 

Assignment Set – 2

 

Q.4. What do you understand by Parallel Processing? What are the different types of Parallel Processing? (10 Marks)

Ans 4.

Parallel Processing

Parallel processing is a type of computational process where several operations or tasks are carried out simultaneously by using different processing units (processors, cores, or specific hardware) working concurrently on different parts of a problem. In contrast to conventional processing where the operations take place one at a time on a single processor. Parallel processing takes advantage of the inherent parallelism in many computational problems it is observed that

 

Q.5. What do you mean by Hazards? Explain the types of Hazards. (10 Marks)

Ans 5.

Pipeline Hazards – Introduction

In a pipelined processor multiple instructions are in different levels of execution at once. Hazards are a situation that blocks the next instruction to execute within its specified clock cycle. This could cause the process to stop (insert insert idle periods, also known as bubbles) or produce inaccurate outcomes or need special handling for ensuring proper execution of the program. These are the biggest

Q.6. Explain the concept of dynamic scheduling in detail. (10 Marks)

Ans 6.

Dynamic Scheduling

Dynamic scheduling is a method used by modern high-performance processors that allows the processor to execute instructions in a different order than the order of execution in which it was originally programmed for the purpose of improving performance, while ensuring that outcomes are equivalent to the results obtained from strictly sequential execution. It’s the hardware alternative to compiler-level instruction order reordering which operates in real-time throughout program execution