- Arts & Culture 4535
- Books in Foreign Languages 202
- Business & Economics 4694
- Computers 2361
- Dictionaries & Encyclopedias 675
- Education & Science 80262
- Abstracts 1266
- Astrology 14
- Astronomy 13
- Biology 40
- Chemistry 3089
- Coursework 3778
- Culture 30
- Diplomas 2711
- Drawings 1709
- Ecology 31
- Economy 328
- English 1255
- Entomology 2
- Ethics, Aesthetics 29
- For Education Students 21528
- Foreign Languages 118
- Geography 20
- Geology 17
- History 231
- Maps & Atlases 42
- Mathematics 6112
- Musical Literature 5
- Pedagogics 221
- Philosophy 190
- Physics 13015
- Political Science 131
- Practical Work 112
- Psychology 475
- Religion 51
- Russian and culture of speech 103
- School Textbooks 70
- Sexology 67
- Sociology 53
- Summaries, Cribs 917
- Tests 21556
- Textbooks for Colleges and Universities 209
- Theses 185
- To Help Graduate Students 19
- To Help the Entrant 111
- Vetting 343
- Works 57
- Информатика 9

- Engineering 3001
- Esoteric 1168
- Fiction 3162
- For Children 420
- House, Family & Entertainment 2537
- Law 2884
- Medicine 1234
- Newspapers & Magazines 333
- Security 315
- Sport, Tourism 993
- Website Promotion 681

# Discrete Mathematics. Test. (63 Issues).

Refunds: 0

Uploaded:

**28.08.2014**

Content: 40828165619933.rar (69 kB)

# Seller

RD.Pro information about the seller and his itemsSeller will give you a gift certificate in the amount of **5,6** RUB

# Description

The list of questions:

"If M ~ N, the N ~ M» - the property equivalent to the set, which is called:

"If M ~ N, and N ~ P, then M ~ P" - the property equivalent to the set, which is called:

Will Let V any subset of a set?

Restore the original message, if received = 1001011

Restore the original message, if received = 1010101010100

Restore the original message, if received = 1011101

Restore the original message, if received = 11011100110

Graf, any two vertices can be connected by a chain, called:

Graphs, between the peaks where you can establish a one-to-one correspondence is called:

The route is grafa-:

To prove that the sets A and B need to install:

If M = N and P (X) - a statement about the set, then P (M) is true if and only if

If the set A = {a, b, c}, then the set {{a, b}, {b, c}, {c, a}, {a}} called

A closed path is called:

Which of the following statements is written wrong?

Can a finite set A contain a proper subset of the equivalent of the entire set of A?

Is it possible in any infinite set contains a countable subset?

Is it possible to assign a one or a zero, respectively universal and the empty set, based on the properties of operations on

sets?

Drinking «x - familiar with y» is:

Drinking «x - winner y» is:

The ratio "to be like" is:

The ratio to be "relative" is:

The ratio of x <y <z is:

The ratio of x> y> z is:

Mapping of X into Y, when taken for each element of Y there is at most one preimage is called:

Mapping of X into Y, when taken for each element of the inverse image of Y is called:

According to a communication channel to be transmitted the word 100100100. To transfer using Hamming code. Specify the correct filling of control

categories:

According to a communication channel to be transmitted the word 101111011. To transfer using Hamming code. Specify the correct filling of control

categories:

According to the communication channel received code word 010011100101. To send used Hamming code. Specify in which discharge mistake

in data transmission:

According to the communication channel received codeword 1001001. To send used Hamming code. Specify in which discharge a mistake when

data transmission:

Build method of Hamming code word for message = 10101011

Build method of Hamming code word for message 111001111 =

Why does the set of real numbers and the set of natural numbers are not similar?

A simple circuit containing all edges of the graph, called:

The set of all subsets of A is:

Are the laws of distributive Boolean algebra and set theory?

Are the laws of idempotent Boolean algebra and set theory?

Indicate which of the following equation holds:

The chain, which passes through the arc of the graph once called:

Elementary circuit passing through all vertices, called:

# Feedback

0Period | |||

1 month | 3 months | 12 months | |

0 | 0 | 0 | |

0 | 0 | 0 |

**5,6 RUB**