Discrete Mathematics. Test. (63 Issues).
Sold <10
The sale of this product is suspended.
Product 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:
"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:
Main features
- Content type File
- Content description 69 kB
- Updated on the site 28.08.2014
Reviews
No reviews yet
The sale of this product is suspended.
RD.Pro
Blocked
RD.Pro
Blocked
You viewed
All images, logos, and names of games, programs, and other products used are taken from public sources and are for informational purposes only. All trademarks, logos, names, and other intellectual property belong to their respective owners. Use of such images on the website does not imply any affiliation or connection with the copyright holders.