| Vishal chugh asks : if we arrange in alphabetical order all the words which are formed by rearranging the letters of the given word |
| Rani ramrakhiani asks : LOGICAL REASONING Q1) In a language, words are made with only three letters A,B,C. The words follow a fixed sequence. (1)if x is a viable word sequence ending with A then a B can be added at the end . (2)If CX is a viable word sequence then so is CXX. (3) if there are three A's i.e AAA then the trio can be repalced by a single B. (4) if there are two B's i.e BB then the pair can be dropped altogether. it is known that CA ia a viable word. Example- to obtain CBAAB from CA, the minimum number of steps is STEP 1-CA STEP 2-CAA STEP 3-CAAAA STEP 4-CBA STEP 5-CBAB STEP 6-CBABBAB STEP 7-CBAAB In one step only one operation can be carried out. 1) what is the minimum number of steps required to obtain CBBAA fron CA ? (a)5 (b)6 (c)7 (d)8 2)wat is the minimum number of steps required to obtain CBBBA from CA? (a)8 (b)9 (c)10 (d)11 3) What is the minimum number of steps required to obtain BC from CA? (a)3 (b)5 (c)6 (d) not possible. 4) starting from CBAB,what is the minimum number of steps required to obtain CBBAB ? (a)4 (b)5 (c)6 (d)7 5) how many steps are required to get CABAB from CA? (a)3 (b)4 (c)5 (d)6. -------------------------- Q2) what would be the serial number of the word MOTHER in a dictionary consisting of words formed by letters in MOTHER arranged in an alphabetical order? (a)307 (b)308 (c)309 (d)312. -------------------------- |