Friday, 17 July 2026

Computer Organization & Architecture (COA) – Questions

Computer:- A computer is characterized by the Input–Process–Output (IPO) cycle, in which it accepts input, processes the data, and produces output.

Introduction:-



NET-JUNE-2026

1.    The average memory access time is 130 ns and average time of cache memory is 100 ns . With 75% hit ratio, The average time to access a word is ?

    1.    130 ns

    2.    150 ns

    3.    132.5 ns

    4.    107.5 ns

NET-JUNE-2026

2.    A problem of size n requires n2 bit operations. What is the largest size instance that can be solved in 1 second, if each bit operation is carried out in 10-9 second ?

    1.    109

    2.    3.16 x 104

    3.    3.96 x 107


    4.    210^9



NET-JUNE-2026

3.    Arrange the following in terms of their capacity from smallest to largest :

        A.    L3 Cache            B.    L1 Cache

        C.    CPU Register        D.    L2 Cache

Choose the correct answer from the options given below:

    1.    C, D, B, A

    2.    C, A, B, D

    3.    C, B, D, A

    4.    A, C, D, B

NET-JUNE-2026

4.    What does "Amdahl's Law" describe in the context of parallel processing ?

      1.    Maximum speedup achievable, considering serial and parallel portions of a program

      2.    The efficiency of message passing in a distributed memory system

      3.    Computational efficiency of a parallel algorithm

      4.    The reliability of a fault tolerant system


NET-DEC-2025

Comprehension:

A system trasnfer data blocks of 2000 bytes with programmed I/O, each byte transfer takes 6 CPU cycles, with direct memory access (DMA), the block transfer takes 3000 Cycles total, with CPU setup overhead of 200 cycles. The CPU clock is 1 GHZ. Answer the following 5 questions based on this paragraph. 

1.    How much CPU time is consumed by programmed I/O ?

    1.    12  µs
    2.    20  µs
    3.    24  µs
    4.    30  µs

2.    How much CPU time is consumed by DMA overhead ?

    1.    0.2    µs
    2.    2.0    µs
    3.    3.0    µs
    4.    12.0  µs

3.    How many CPU cycles are spent with DMA ?

    1.    200  Cycles 
    2.    3000  Cycles 
    3.    3200  Cycles 
    4.    4000  Cycles 

4.    Which is more CPU-efficient for large block transfer ?

    1.    Programmed I/O
    2.    DMA
    3.    Both Programmed I/O and DMA
    4.    Depends on block size

5.    How many CPU cycles are spent using programmed I/O ?

    1.    2000 
    2.    6000   
    3.    12000   
    4.    20000   


NET-DEC-2024

1.    Match the LIST-I with LIST-II


LIST-I


LIST-II


A.


(100110011)2


I.


Error detection

 code


B.


Complements


II.


CISC


C.


Parity Bits


III.


Negative number


D.


Variable

 length

 instruction


IV.


(133)16


Choose the correct answer from the options given below:

1.    A - IV,    B - I,    C - III,    D - II

2.    A - IV,    B - III,    C - I,    D - II

3.    A - IV,    B - II,    C - III,    D - I

4.    A - I,    B - IV,    C - II,    D - III


NET-DEC-2024

2.    Match the LIST-I with LIST-II


LIST-I


LIST-II


A.


RAID level 1


I.


bit-interleaved

 parity 

organization 


B.


RAID level 2


II.


disk mirroring


C.


RAID level 3


III.


block-interleaved

 parity 

organization 


D.


RAID level 4


IV.


ECC organization


Choose the correct answer from the options given below:

1.    A - II,    B - I,    C - IV,    D - III

2.    A - II,    B - IV,    C - I,    D - III

3.    A - III,    B - IV,    C - I,    D - II

4.    A - IV,    B - III,    C - II,    D - I


NET-DEC-2024

3.    Which are often needed to evaluate the cache performance ?

    1.    Hit Ratio

    2.    Latency

    3.    Cache Traces

    4.    Transfer Rate


NET-DEC-2024

4.    Arrange the following in the increasing order with respect to access time.

        A.    Solid State Drive

        B.    Optical Disks

        C.    DRAMs

        D.    SRAMs

        E.    Registers

    Choose the correct answer from the options given below:

        1.    D, C, A, B, E

        2.    B, D, C, A, E

        3.    A, E, B, D, C
    
        4.    E, D, C, A, B


NET-DEC-2024

5.    Correct the order of instruction cycle:

        A.    Read the effective address
    
        B.    Fetch the information

        C.    Execute the instruction

        D.    Decode the instruction

Choose the correct answer from the options given below:

        1.    A, B, C, D

        2.    B, D, A, C

        3.    B, A, D, C

        4.    A, B, D, C


NET-DEC-2024

6.    If the virtual memory size is 32 MB and a physical memory size is 4 MB with a page size of 2 KB, Calculate the number of frames available in physical memory.     

        1.    1024

        2.    2048

        3.    3072

        4.    4096 

















Sunday, 12 July 2026

Home






B.Tech. Pt-III (IT) 1st Semester Examination, 2025 - Subject: Computer Organization & Architecture



Department of Engineering and Technological Studies, University of Kalyani

B.Tech. Pt-III (IT) 1st Semester Examination, 2025

Subject: Computer Organization & Architecture

Paper: IT504

Full marks=70                             Time: 3 Hours


The figures in the right-hand margin indicate marks.

Candidates are required to give their answers in their own words as far as possible.

The notations follow their standard meanings.

Answer question number one and any five from rest.




1.     Answer any ten questions:             (2 x 10 = 20)


    a)     State the principle of locality of references.

    b)     Define instruction prefetching.

    c)     What, in general terms, is the distinction between computer architecture and computer organization?

    d)     Derive the range of an n-bit number using the 2’s-complement, and 1’s-complement number representations.

    e)     Explain memory address register (MAR) and instruction register (IR).

    f)     Why 2’s complement representation of a signed number is a better representation?

    g)     What are the difference between DRAM and SRAM.

    h)     What do you mean by seek time and rotational latency?

    i)     What are the write through and write back policy?

    j)     Explain temporal and spatial locality.

    k)     What are the differences between sequential access of memory and random access of memory?

    l)     What are the differences between Immediate Addressing and Direct Addressing?

    m)     Discuss Bus Interconnection Scheme.

    n)     Define parallel and serial interface.

    o)     What do you mean by Displacement Addressing?



2.     a)     State Amdahl’s Law.

        b)     Suppose that we want to enhance the processor used for Web serving. The new processor is 10 times faster on computation in the Web serving application than the original processor. Assuming that the original processor is busy with computation 40% of the time and is waiting for I/O 60% of the time, what is the overall speedup gained by incorporating the enhancement?

        c)     What do you mean by millions of instructions per second (MIPS) rate? 

                                                                                                (2+5+3)


3.     a)     Suppose that the processor has access to two levels of memory. Level 1 contains 1000 words and has an access time of 0.02 ms; level 2 contains 100,000 words and has an access time of 0.2 ms. Assume that if a word to be accessed is in level 1, then the processor accesses it directly. If it is in level 2, then the word is first transferred to level 1 and then accessed by the processor. For simplicity, we ignore the time required for the processor to determine whether the word is in level 1 or level 2. Suppose 90% of the memory accesses are found in level 1. Then what are the average time to access a word?

        b)     Consider the execution of a program that results in the execution of 2 million instructions on a 400-MHz processor. The program consists of four major types of instructions. The instruction mix and the CPI for each instruction type are given below, based on the result of a program trace experiment:

Instruction Type                 CPI     Instruction Mix (%)

Arithmetic and logic                1             58

Load/store with cache hit         3             20

Branch                                      5             10

Memory reference                    
with cache miss                        6             12

Find the average CPI when the program is executed on a uniprocessor with the above descriptions. Also, find MIPS rate. 

                                                                                            (4+4+2)


4.     a)     Express the (-5.75)10 number in IEEE 32-bit floating point format.

        b)     The (1 10000011 11000000000000000000000)2 number use the IEEE 32-bit floating-point format. What is the equivalent decimal value?

        c)     Consider a single-platter disk with the following parameters: rotational speed: 7200 rpm; number of tracks on one side of platter: 30,000; number of sectors per track: 600; seek time: one ms for every hundred tracks traversed. Let the disk receive a request to access a random sector on a random track and assume the head starts at track 0.

    i)     What is the average seek time?

    ii)     What is the average rotational latency?

    iii)     What is the transfer time for a sector?

    iv)     What is the total average time to satisfy a request? 

                                                                                                (3+3+4)


5.     a)     Write down the steps of Booth’s Algorithm for twos complememt multiplication using flowchart.

        b)     Use the Booth algorithm to multiply (23)10(multiplicand) by (29)10(multiplier), where each number is represented using 6-bits. 
                                                                                            (5+5)


6.     a)     For a system with two levels of cache, define Tc1 = first - level cache access time; Tc2 = second - level cache access time; Tm = memory access time; H1 = first – level cache hit ratio; H2= combined first/second level cache hit ratio. Provide an equation for Ta for a read operation.

        b)     Assume a instruction pipeline with six-stages: Fetch Instruction(FI), Decode Instuction(DI), Calculate Operands(CO), Fetch Operands(FO), Execute Instruction(EI), Write Operand(WO). Draw a timing diagram for nine-instructions pipeline operation.

        c)     Find speeup factor for the instruction pipeline compare to execution without the pipeline. 
                                                                                                (2+4+4)


7.     a)     What is the memory mapping functions? What are the differences among direct and associative memory mapping function?

        b)     A set associative cache consists of 64 lines, or slots, divided into four-line sets. Main memory contains 4K blocks of 128 words each. Show the format of main memory addresses.
                                                                                    (4+6)


8.     Short notes:                                    (2 x 5)

Answer any two of the following:

    a)     Flynn’s taxonomy of processor.

    b)     RISC versus CISC Architecture.

    c)     Redundant Array of Independent Disks (RAID).

    d)     The Memory Hierarchy.







Thursday, 9 July 2026

Soft Computing Lab - Semester Exam Questions for B.Tech. and M.Tech. Programs




B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



1.     Write python functions to implement the following:

        (a)     Add an element in a given set.

        (b)     Update the set.

        (c)     Remove an element from the set.

        (e)     Discard an element from the set.

        (f)     Pop the element from the set.

        (g)     Clear the set.

        (h)     Distinguish between remove() and discard() functions in python.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



2.     Write python functions to generate the following parameterized fuzzy membership functions and visualize them for different parameter values in a single window:

    (a)     Triangular MF

    (b)     Trapezoidal MF

    (c)     Gaussian MF

    (d)     Generalized Bell MF



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



3.     Write a program to realize the logical AND function with a neural net model.


4.     Write a program to perform intersection and union operations of two fuzzy sets.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



5.     Write a program to realize the logical XOR operation in ANN model.


6.     Write a program to realize the fuzzy cartesian product.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)




8.     Write a program to perform Max-Min composition of fuzzy sets.

9.     Write a program to realize the logical X-NOR operation in ANN model.


B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



10.     Write a program to realize the Travelling Salesperson Problem(TSP) by using genetic
algorithm (GA). Taking the number of nodes and their cost matrix as user-defined input. You must include random.sample() and random.shuffle() python method for implementing the task.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



11.     Write python functions to compute the symmetric difference of two crisp sets.

12.     Write python functions to compute the power set of a crisp set.

14.     Write a program to perform Max-Min composition of fuzzy sets.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



15.     Write python functions to demonstrate the effect of contrast intensification on a fuzzy membership function.


16.     Write a program to realize the logical OR function with a neural net model.




B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)




17.     Given a fuzzy membership function function mf(X) representing the fact x is A and a fuzzy relation R(X,Y) representing the fuzzy implication if x is A then y is B, find the consequent membership function representing y is B. Implement this for both max- min and max-product compositions and demonstrate the process visually.


OR


Implement the fuzzy reasoning procedure for the following:


Premise 1 (fact): x is A' and y is B'

Premise 2 (rule 1): if x is A1 and y is B1 then z is C1

Premise 3 (rule 2): if x is A2 and y is B2 then z is C2

---------------------------------------------------------------------------------------------

Consequence (conclusion): z is C'

The notations have usual meaning. Demonstrate the procedure visually.


18.     Write a program to demonstrate the effect of contrast intensification on a fuzzy membership function.


B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



19.     Write a program to solve the problem of the 0/1-Knapsack Problem by using a genetic algorithm. Taking the knapsack capacity, number of items, and weight of each item as user 
input. Your task is to maximize the knapsack weight as per their capacity.


20.     Write a python function to realizing the logical AND function by a Extended Delta Learning Rule.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)


21.     Write a program to visualize the parameterized Trapezoidal fuzzy membership function, Gaussian fuzzy membership function and Sigmoidal fuzzy membership function for different parameter values in single window.


22.     Write a program to realize the fuzzy cartesian product.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



19.     Write a program to solve the problem of the 0/1-Knapsack Problem by using a genetic algorithm. Taking the knapsack capacity, number of items, and weight of each item as user input. Your task is to maximize the knapsack weight as per their capacity.


20.     Write a python function to realizing the logical AND function by a Extended Delta Learning Rule.


B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



10.     Write a program to realize the Travelling Salesperson Problem(TSP) by using genetic
algorithm (GA). Taking the number of nodes and their cost matrix as user-defined input. You must include random.sample() and random.shuffle() python method for implementing the task.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



1.     Write python functions to implement the following:

    (a)     Add an element in a given set.

    (b)     Update the set.

    (c)     Remove an element from the set.

    (e)     Discard an element from the set.

    (f)     Pop the element from the set.

    (g)     Clear the set.

    (h)     Distinguish between remove() and discard() functions in python.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



2.     Write python functions to generate the following parameterized fuzzy membership functions and visualize them for different parameter values in a single window:

    (a)     Triangular MF

    (b)     Trapezoidal MF

    (c)     Gaussian MF

    (d)     Generalized Bell MF



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



3.     Write a program to realize the logical AND function with a neural net model.

4.     Write a program to perform intersection and union operations of two fuzzy sets.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



5.     Write a program to realize the logical XOR operation in ANN model.

6.     Write a program to realize the fuzzy cartesian product.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



8.     Write a program to perform Max-Min composition of fuzzy sets.


9.     Write a program to realize the logical X-NOR operation in ANN model.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



10.     Write a program to realize the Travelling Salesperson Problem(TSP) by using genetic algorithm (GA). Taking the number of nodes and their cost matrix as user-defined input. You must include random.sample() and random.shuffle() python method for 
implementing the task.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



11.     Write python functions to compute the symmetric difference of two crisp sets.

12.     Write python functions to compute the power set of a crisp set.

14.     Write a program to perform Max-Min composition of fuzzy sets.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



15.     Write python functions to demonstrate the effect of contrast intensification on a fuzzy membership function.


16.     Write a program to realize the logical OR function with a neural net model.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)




17.     Given a fuzzy membership function function mf(X) representing the fact x is A and a fuzzy relation R(X,Y) representing the fuzzy implication if x is A then y is B, find the consequent membership function representing y is B. Implement this for both max- min and max-product compositions and demonstrate the process visually.


OR


Implement the fuzzy reasoning procedure for the following:

Premise 1 (fact): x is A' and y is B'

Premise 2 (rule 1): if x is A1 and y is B1 then z is C1

Premise 3 (rule 2): if x is A2 and y is B2 then z is C2

---------------------------------------------------------------------------------------------

Consequence (conclusion): z is C'

The notations have usual meaning. Demonstrate the procedure visually.


18.     Write a program to demonstrate the effect of contrast intensification on a fuzzy membership function.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



19.     Write a program to solve the problem of the 0/1-Knapsack Problem by using a genetic algorithm. Taking the knapsack capacity, number of items, and weight of each item as user input. Your task is to maximize the knapsack weight as per their capacity.


20.     Write a python function to realizing the logical AND function by a Extended Delta Learning Rule.



B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)




21.     Write a program to visualize the parameterized Trapezoidal fuzzy membership function, Gaussian fuzzy membership function and Sigmoidal fuzzy membership function for different parameter values in single window.


22.     Write a program to realize the fuzzy cartesian product.




B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)




19.     Write a program to solve the problem of the 0/1-Knapsack Problem by using a genetic algorithm. Taking the knapsack capacity, number of items, and weight of each item as user input. Your task is to maximize the knapsack weight as per their capacity.




20.     Write a python function to realizing the logical AND function by a Extended Delta Learning Rule.




B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)



10.     Write a program to realize the Travelling Salesperson Problem(TSP) by using genetic algorithm (GA). Taking the number of nodes and their cost matrix as user-defined input. You 
must include random.sample() and random.shuffle() python method for implementing the task.




B.Tech. Pt-III (CSE) 2 nd Semester Examination, 2026

Subject: Soft Computing Lab (CS 692)




30.     Write a Python program to implement the backpropagation for X-OR Problem.








Programming Methodology Using C, C++, Java & Other Languages – UGC NET Previous Years’ Questions.

NET-JUNE-2026 1.     Match the LIST-I with LIST-II LIST-I LIST-II A. long signed int I. %lf B. double II. %Lf C. long double III. %c D. unsi...