ISRO CS 2007

Question 61

Which of the following is not an approach to Software Process Assessment?

• SPICE(ISO/IEC15504)
• Standard CMMI Assessment Method for process improvement
• . ISO 9001:2000
• IEEE 2000:2001

Question 62

A physical DFD specifies

• what processes will be used
• who generates data and who processes it
• what each person in an organization does
• which data will be generated

Question 63

In UML diagram of a class

• state of object cannot be represented
• state is irrelevant
• state is represented as an attribute
• state is represented as a result of an operation

Question 64

Which of the following models used for software reliability

• Waterfall
• Musa
• COCOMO
• Rayleigh

Question 65

Dijkstra’s algorithm is used to

• Create LSAs

• Flood an internet with information

• Calculate the routing tables

• Create a link state database

Question 66

The five items: A, B, C, D, and E are pushed in a stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue. The two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is

• A
• B
• C
• D

Question 67

Study the following program:

// precondition: x>=0
public void demo(int x)
{
    System.out.print(x % 10);
    if (x % 10 != 0) {
        demo(x / 10);
    }
    System.out.print(x % 10);
}

Which of the following is printed as a result of the call demo(1234)?

• 1441

• 3443

• 12344321

• 4321001234

Question 68

Consider a system having ‘m’ resources of the same type. The resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of ‘m’ that ensures that deadlock will never occur is

• 11
• 12
• 13
• 14

Question 69

Consider a job scheduling problem with 4 jobs J₁, J₂, J₃, J₄ and with corresponding deadlines: ( d₁, d₂, d₃, d₄) = (4, 2, 4, 2). Which of the following is not a feasible schedule without violating any job schedule?

• J₂, J₄, J₁, J₃

• J₄, J₁, J₂, J₃

• J₄, J₂, J₁, J₃

• J₄, J₂, J₃, J₁

Question 70

The time taken by binary search algorithm to search a key in a sorted array of n elements is

• O ( log₂n )

• O ( n )

• O ( n log₂n )

• O ( n^2)