72.

73.

74.

78.

76.

77.

Which of the following is likely 10 be the most expensive cost of quality in Software
Engineering ?
A) External Failure Cost B) Appraisal Cost

C) Internal Failure Cost D) Prevention Cost

Which is the correct preorder traversal of the following binary tree ?

1 ^ ` 3 10 ன 30
‏لس‎ 40

40 ,7 ,30 ,10 ,11 ,1 ,3 ,2 ,14 )8 40 ,30 0 ,14 (ھ
3,2,1 ,7 ,10 ,11 ,14 ,30 ,40 )0 40 ,30 ,14 ,11 ,10 ,7 ,3 ,2 ,1 )©

Suppose we're debugging a quicksort implementation that is supposed to sort an
array in nding order. After the first partition step has been completed, the contents
of the array are in the following order :

391 18 24 22 20

Which of the following statements is correct about the partition step ?

A) The pivot could have been 18, but could not have been 19

8) The pivot could have been 19, but could not have been 18

were implementing a data structure to store information about the
paintings on display at an art dealer's showroom. Of the following data structures,
which one is the right one 10 use ?

array B) Sorted array

arch tree D) Itdepends

What is the running time of the following code fragment ?
for(inti=0;i<10; i++)

for(intj=0; j < N; j++)

for(intk =N=2; k < N+2; k++)

:800 >> [ >> ">> | >> أنا00
‎A) O (log N B) O(N) C) O(Nlog N) D) ೦/8೨)‏
‎Breadth first search‏

A) Scans each incident node along with its children

B) Scans all incident edges before moving to other node
C) Is same as back tracking

D) Scans all the nodes in random order

-12-