ISRO CS 2011

    Last Updated :
    Discuss
    Comments

    Question 1

    What is the output of the following C code? 

    #include 
    int main()
    {
    int index;
    for(index=1; index<=5; index++)
    {
    printf("%d", index);
    if (index==3)
    continue;
    }
    }

    • 1245

    • 12345

    • 12245

    • 12354

    Question 2

    Consider the following pseudocode: 
     

    x:=1;
    i:=1;
    while (x ? 500)
    begin
    x:=2x ;
    i:=i+1;
    end


    What is the value of i at the end of the pseudocode?
     

    • 4

    • 5

    • 6

    • 7

    Question 3

    There are three processes in the ready queue. When the currently running process requests for I/O how many process switches take place?

    • 1

    • 2

    • 3

    • 4

    Question 4

    The following table shows the processes in the ready queue and time required for each process for completing its job. 

    Process    Time
    P1          10
    P2          5
    P3          20
    P4          8
    P5          15

    If round-robin scheduling with 5 ms is used what is the average waiting time of the processes in the queue?

    • 27 ms

    • 26.2 ms

    • 27.5 ms

    • 27.2 ms

    Question 5

    One SAN switch has 24 ports. All 24 supports 8 Gbps Fiber Channel technology. What is the aggregate bandwidth of that SAN switch?

    • 96 Gbps

    • 192 Mbps

    • 512 Gbps

    • 192 Gbps

    Question 6

    Let T(n) be defined by T(1) = 10 and T(n + 1) = 2n + T(n) and for all integers n ≥ 1 . Which of the following represents the order of growth of T(n) as a function of

    • O(n)

    • O(n log n)

    • O(n2)

    • O(n3)

    Question 7

    Which one of the following in place sorting algorithms needs the minimum number of swaps?

    • Quick sort

    • Insertion sort

    • Selection sort

    • Heap sort

    Question 8

    Which of the following algorithm design technique is used in merge sort?

    • Greedy method

    • Backtracking

    • Dynamic programming

    • Divide and Conquer

    Question 9

    If the page size in a 32-bit machine is 4K bytes then the size of page table is

    • 1 M bytes

    • 2 M bytes

    • 4 M bytes

    • 4 K bytes

    Question 10

    Consider a 32-bit machine where four-level paging scheme is used. If the hit ratio to TLB is 98%, and it takes 20 nanosecond to search the TLB and 100 nanoseconds to access the main memory what is effective memory access time in nanoseconds?

    • 126

    • 128

    • 122

    • 120

    Tags:
    ISRO

    There are 80 questions to complete.

    Take a part in the ongoing discussion