In a certain code language, '-' represents '+', '+' represents 'x', 'x' represents '÷' and '÷' represents '-'. Find out the answer to the following question.
Consider the given statement/s to be true and decide which of the given conclusions/assumptions can definitely be drawn from the given statement. Statements: 1. All cycles are ducks. 2. All ducks are swans. Conclusions: I. All swans are cycles. II. Some swans are cycles.
In the question, a word is represented by only one set of numbers as given in any one of the alternatives. The sets of numbers given in the alternatives are represented by two classes of alphabets as in two matrices given below. The columns and rows of Matrix I are numbered from 0 to 4 and that of Matrix II are numbered from 5 to 9. A from these matrices can be represented first by its row and next by its column. e.g. 'O' can be represented by 65, 88 etc. and 'F' can be represented by 13, 42, etc. You have to identify the set for the word ‘NAVY’.
In a certain code language, 'x' represents '+', '÷' represents 'x', '-' represents '÷' and '+' represents '-'. Find out the answer to the following question.