Hello,

please try to solve these questions

Printable View

- Feb 11th 2007, 06:44 AMm777mcqs
Hello,

please try to solve these questions - Feb 11th 2007, 07:25 AMThePerfectHacker
Part 1)

False

True

True

False

Part 2)

The second one.

Part 3)

The third one.

Part 4)

Do not know. - Feb 11th 2007, 07:38 AMm777
Hello,

But i have to choose only one option in question no 1.i think so option no 3 is more suitable what is your point of view. - Feb 11th 2007, 07:48 AMThePerfectHacker
- Feb 11th 2007, 03:04 PMSoroban
Hello, m777!

Quote:

a) Which of these is true?

1) {x} ε {x}

2) φ ε {x}

3) {X} ε {{x}}

4) none of these

**really**an upper-case X in (3), the answer is (4) "none of these".

If it's supposed to be "x" in there, the answer is (3).

Quote:

b) In R, the symmetric property with respect to equality of numbers is:

1) .a = b . → . b = -a

2) .a = b . → . b = a

3) .a = b . → . b = 2a

4) .a = b . → . a = -b

Do you**know**what the symmetric property is?

The answer is (2).

Quote:

Combination of*n*and*k*. . . that is: C(n,k)

. . . .n!

1) -------

. . (n-k)!

. . . . n!

2) ---------

. . k!(n-k)!

. . . . n!

3) ---------

. . n!(n-k)!

4) None of these

You're new to "combinations", aren't you?

The answer is (2).

I'm not familiar with "binary trees" . . . sorry.

- Feb 11th 2007, 07:28 PMCaptainBlack
- Feb 11th 2007, 08:30 PMCaptainBlack
d) There is a full binary tree that has 10 internal vertices and 13 terminal vertices

No, for a full binary tree:

n(terminal)=n(internal)+1

RonL

- Feb 11th 2007, 08:47 PMm777soroban
Hello,

Soroban.

yes, i have just started the topic "combinations". For any quantities a and b, if a = b, then b = a is symmetric property.