0% found this document useful (0 votes)
94 views6 pages

MCS-012 June 2024 Question Paper

The document is an examination paper for the course MCS-012: Computer Organisation and Assembly Language Programming, intended for Master of Computer Applications and Bachelor of Computer Applications students. It includes a variety of questions covering topics such as EXE programs, instruction pipelining, full-adders, cache memory, interrupts, Von-Neumann architecture, addressing modes, programmed I/O techniques, and 8086 assembly language programming. The exam consists of one compulsory question and a selection of three additional questions from a total of five.

Uploaded by

cavgopalrao
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
94 views6 pages

MCS-012 June 2024 Question Paper

The document is an examination paper for the course MCS-012: Computer Organisation and Assembly Language Programming, intended for Master of Computer Applications and Bachelor of Computer Applications students. It includes a variety of questions covering topics such as EXE programs, instruction pipelining, full-adders, cache memory, interrupts, Von-Neumann architecture, addressing modes, programmed I/O techniques, and 8086 assembly language programming. The exam consists of one compulsory question and a selection of three additional questions from a total of five.

Uploaded by

cavgopalrao
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

No.

of Printed Pages : 6 MCS-012

MASTER OF COMPUTER

APPLICATION/BACHELOR OF

COMPUTER APPLICATION

(REVISED) (MCA/BCA)

Term-End Examination

June, 2024

MCS-012 : COMPUTER ORGANISATION AND


ASSEMBLY LANGUAGE PROGRAMMING

Time : 3 Hours Maximum Marks : 100

Note : Question No. 1 is compulsory and carries

40 marks. Attempt any three questions from

the rest.

1. (a) What are the components of an EXE

program ? What are the advantages of

using EXE programs ? 5

P. T. O.
[2] MCS-012

(b) Explain the Instruction Pipelining with the

help of a diagram. 5

(c) What is full-adder ? Draw the logic

diagram of a full-adder circuit. 6

(d) How is the access time calculated on a

hard disk ? 4

(e) Simplify the following Boolean function

using K-map : 6

F (A, B, C, D) =  (0, 4, 5, 6, 12, 13, 14)

Also draw the logic diagram of the

simplified circuit using AND, OR and NOT

gates.

(f) What is the need of Cache memory ?

Explain the direct mapping cache

organisation with the help of a

diagram/example. 6
[3] MCS-012

(g) What is the sequence of micro-operations

required for fetching an instruction from

the memory. You may assume that

machine uses Accumulator (AC) register,

Program Counter (PC) register, Instruction

Register (IR), Memory Address Register

(MAR) and Date Register (DR). 5

(h) What is the role of Int 21h in 8086 micro-

processor ? 3

2. (a) What is an interrupt ? What happens on

the occurrence of an Interrupt ? Explain

with the help of a diagram. 6

(b) Explain Von-Neumann architecture with

the help of a diagram. 7

P. T. O.
[4] MCS-012

(c) Draw and explain the logic diagram of J-K

flip-flop. Also, make the characteristic

table of J-K flip-flop. 7

3. (a) Find 1’s and 2’s complement of the

following fixed point numbers : 4

(i) 10100010

(ii) 00000000

(b) Represent the following numbers in

floating point single procession number

format : 6

(i) 1010.0001

(ii) – 0.0000111

(c) Explain the following addressing modes

with the help of an example of each : 10

(i) Immediate addressing

(ii) Direct addressing


[5] MCS-012

(iii) Register addressing

(iv) Indirect addressing

(v) Indexed addressing

4. (a) Explain the programmed I/O technique

with the help of a flow chart. How is it

different from DMA ? 8

(b) Explain the following terms in the context

of Input/Output system : 12

(i) Device driver

(ii) Refresh rate of a monitor

(iii) Classification of printers

(iv) Modem

5. (a) Write a program using 8086 assembly

language that converts an ASCII digit to

equivalent binary value. 6

P. T. O.
[6] MCS-012

(b) What is the need of segment registers in

8086 micro-processor ? Explain the use of

code segment and stack segment registers

with the help of an example of each. 8

(c) Explain the following 8086 assembly

commands : 6

(i) XCHG instruction

(ii) SHL/SHR instruction

MCS–012 12,260

Common questions

Powered by AI

In the 8086 microprocessor, segment registers define the base addresses for code, stack, data, and extra segments. The code segment register points to the instruction code region for execution, enabling program security and placement flexibility. For example, the stack segment register manages stack operations crucial for function calls and memory management. These registers facilitate structured memory division, optimizing operation efficiency and organization .

Instruction pipelining enhances CPU performance by overlapping the execution phases of multiple instructions, which increases instruction throughput. Typical stages include fetching the instruction, decoding it, executing it, accessing memory, and writing back the result. This concurrent processing reduces idle times and maximizes CPU utilization .

Instruction fetching involves several micro-operations: The program counter (PC) holds the address of the next instruction, which is transferred to the memory address register (MAR). Memory data is fetched and placed in the data register (DR), then transferred to the instruction register (IR). The PC is incremented for the next instruction cycle. This sequence ensures efficient and accurate retrieval of instructions .

A full-adder is a digital circuit that computes the sum of three binary digits, including a carry bit into the next higher bit. It outputs a sum and a carry. The logic diagram consists of two XOR gates, two AND gates, and an OR gate. These components combine to output the sum and carry based on the truth table of binary addition .

The XCHG instruction exchanges the contents of two registers or a register with memory, useful for data manipulation without additional memory. SHL (shift left) and SHR (shift right) instructions adjust operand bit positions, useful for multiplication/division by powers of two. While XCHG focuses on data transfer, SHL/SHR modify data values, each providing distinct functional benefits in programming tasks .

An EXE program primarily consists of an executable code section, a data section, a stack section, and a relocation information section. The advantages of using EXE programs include their self-contained nature, allowing direct execution without needing further modification. They provide a standardized method for executing instructions and handling data, making them versatile across different environments .

Simplifying Boolean functions with Karnaugh maps (K-maps) minimizes the number of necessary logic gates, reducing circuit complexity and power consumption. This simplification leads to more efficient circuit designs with faster operational speeds. K-maps provide a visual method for identifying allows for a reduction in logical expressions, optimizing digital circuit performance significantly .

Von-Neumann architecture uses a singular memory space for both data and program instructions, allowing them to be stored in the same memory and executed interchangeably. This flexibility supports more complex computational processes and programming languages but may lead to bottlenecks due to shared memory access paths, known as the Von-Neumann bottleneck .

Programmed I/O involves the CPU actively managing each data transfer, resulting in high processor involvement and potential inefficiency due to constant CPU monitoring. In contrast, DMA allows external devices to transfer data directly to memory without CPU intervention, freeing CPU resources for other tasks, thereby increasing efficiency significantly .

Cache memory enhances computer performance by storing frequently accessed data closer to the CPU, minimizing access time compared to main memory. Direct mapping assigns each block of main memory to a fixed cache line, simplifying the process of finding data at the expense of flexibility. This reduces memory latency and improves execution speed by allowing quicker data retrieval .

You might also like