Full form of CASE

1.   ?    computer aided s/w engg
2.   ?    computer aided System engg
3.   ?    computer aided Solution engg
4.   ?    None Of the Above

UML

1.   ?    United modelling language
2.   ?    Unified Markup language
3.   ?    Unified modelling language
4.   ?    None Of the Above

1. value of N and! K is100
2.N is divided by K and the integer part of the quotient is stored in I.
3. N is divided by K and the reminder is stored in K
4. I is multiplied by itself to get the new value of I
5. if the value of I and J are equal then N is printed
6. add 1 to N
7. if the value of N exceeds 999 then stop.
8. go to step 2
The result of the above logic is

1.   ?    124, 248, 369 ....
2.   ?    101 , 204, 309, .....
3.   ?    111, 222, 333, ...
4.   ?    none

1. Sony =0
2.jimmy =1
3.Add jimmy to sony to get new jimmy
4. add sony to jimmy to get new jimmy.
5. if jimmy is equal to 34 then stop
6. go to step 3
What is the value of Sony when the logic terminates.

1.   ?    15
2.   ?    18
3.   ?    21
4.   ?    None

1.T=1
2.T1=T*1000
3.T2=T+1
4.T3=T2*100
5.T4=T2+1
6.T5=T4*10
7.T6=T4+1
8.T7=T1+T3+T6+T5
9.print T7
10.T=T+1
11.if T<8 then 2
12.stop
which of the following value will not ptinted by above logic

1.   ?    6789
2.   ?    7890
3.   ?    7900
4.   ?    none

1.let the value of N be 10
2.divide N by 10 to give quotient (Q) remainder(R)
3.diff=R-Q
4.if diff=1 then 6
5.go to step 7
6.display the value of N
7.add 1 to N
8.if N <100 go to step 2
the above logic will produce

1.   ?    11,12,13,,14..
2.   ?    12,23,34,.....
3.   ?    21,32,4,354......
4.   ?    none

when A is devided by B,it is reqd tro round of the result to the
nereast whole no,the logic is giv en below .give the correct sequence
1. divide A by B giving correct s! equence
2.substract INTERGER(A/B) from C and store theresult in D
3.if reminder (A/B) is 0 then stop
4.print INTERGER (A/B)
5.if D>.49,increase the value of INTRGER (A/B) by 1

1.   ?    1,3,2,5,4
2.   ?    1,3,2,4,5
3.   ?    1,2,3,5,4
4.   ?    none

the logic to! convert a 3 digit number to a word is given, Ex 123 should be written as One Two Three
1. accept the number N
2. if N < 100 or N > 999 go to step 1
3. Split N into hundreds(H), Tens (T), & Units(U)
4. Store words zero,one,two,....... in array W(10)
5. print W(H),W(T),W(U)
6. Stop
The above logic is

1.   ?    incomplete
2.   ?    complete
3.   ?    complete but inefficient
4.   ?    none

given a number which is more than 99 but less than 1000, the logical
sequence of steps to say how many hundreds, tens & units are in the
given number is given below.identify the logical order.
1.get the number N
2.write quotient and the words 'tens'
3.write the remainder and the words "units'
4.write the quotient and the word "hundred"
5.divide the number N by 100 and get the quotiient and remainder
6.divide the remainder by 10 giving the quitient and remainder

1.   ?    1,5,6,2,3,4
2.   ?    1,5,4,3,2,6
3.   ?    1,5,4,6,2,3
4.   ?    none

step 1.no of toffees in hand (TIH)=2
2.no of picks (NOP) = 1
3. Multiply TIH by 2
4. Add 1 to NOP
5. If NOP is less than 4 then step 3
6. Print TIH
7. Stop
The value of TIH at the end of execution of logic is

1.   ?    16
2.   ?    20
3.   ?    34
4.   ?    None