UGC NET CS 2014 Dec - III

Question 31

Dijkstra algorithm, which solves the single-source shortest--paths problem, is a _________, and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a _________

• Greedy algorithm, Divide-conquer algorithm

• Divide-conquer algorithm, Greedy algorithm

• Greedy algorithm, Dynamic programming algorithm

• Dynamic programming algorithm, Greedy algorithm

Question 32

Consider the problem of a chain 1, A₂, A₃ > of three matrices. Suppose that the dimensions of the matrices are 10 × 100, 100 × 5 and 5 × 50 respectively. There are two different ways of parenthesization : (i) ((A₁ A₂ )A ) and (ii) (A₁ (A₂ A₃ )). Computing the product according to the first parenthesization is ________ times faster in comparison to the second parenthesization.

• 5
• 10
• 20
• 100

Question 33

Which methods are utilized to control the access to an object in multi-threaded programming?

• Asynchronized methods
• Synchronized methods
• Serialized methods
• None of the above

Question 34

Converting a primitive type data into its corresponding wrapper class object instance is called

• Boxing
• Wrapping
• Instantiation
• Autoboxing

Question 35

The behaviour of the document elements in XML can be defined by

• Using document object
• Registering appropriate event handlers
• Using element object
• All of the above

Question 36

What is true about UML stereotypes?

• Stereotype is used for extending the UML language.

• Stereotyped class must be abstract

• The stereotype indicates that the UML element cannot be changed

• UML profiles can be stereotyped for backward compatibility

Question 37

Which method is called first by an applet program?

• start( )
• run( )
• init( )
• begin( )

Question 38

Which one of the following is not a source code metric?

• Halstead metric
• Function point metric
• Complexity metric
• Length metric

Question 39

To compute function points (FP), the following relationship is used FP = Count – total × (0.65 + 0.01 × Σ(F_i )) where F_i (i = 1 to n) are value adjustment factors (VAF) based on n questions. The value of n is

• 12
• 14
• 16
• 18

Question 40

Assume that the software team defines a project risk with 80% probability of occurrence of risk in the following manner : Only 70 percent of the software components scheduled for reuse will be integrated into the application and the remaining functionality will have to be custom developed. If 60 reusable components were planned with average component size as 100 LOC and software engineering cost for each LOC as $ 14, then the risk exposure would be

• $ 25,200
• $ 20,160
• $ 17,640
• $ 15,120