SOME SMALL QUESTIONS AND ANSWERS FROM DISCRETE MATHEMATICS!

1. What is Discrete Mathematics?
Answer: To solve a subject or problem with a mathematical solution, it is considered as dissociative mathematics, by analyzing it in an integral part of an integral part by analyzing the simple solution.
2. What is logic?
Answer: The basis of all the mathematical arguments is called logic.
3. What is the statement?
Answer: The statement is a declarative sentence that will be true or false, but it will not be true and false at the same time.
4. Compund Proposition: A statement composed of one or more logical operators is compound statement.
5. Negation: A given statement is the opposite statement of P. Negation. It's a It is written as.

6. Conjunction: When combining two statements and combining the compound statement, it is called the combination of the original statement. It is written by P ^ Q.
7. Disjunction: If any two statements are combined with OR, composite statements are formed, they are deceptive. It is written by P v Q.
8. Totolji: If the authenticity of a composite statement is true for every possible assembly of its authenticity, its computational statement may be called a 'Totology'. The word p is indicated by a person when it is at the catarrh.
9. Contradiction: If the authenticity of a composite statement is false for every possible assembly of the authenticity of its original statements, it may be inappropriate for the composite statement.
10. Conditioning: (P → Q) If two conditions are added by the condition, then if it is added by condition then it is called conditional or conditional.
11. Two-Point Conditioning: (P ⇔ Q) If two statements are made by "if and only if" the new quote constitutes the two-pronged conditioning "If and Only If"
12. Set: The combination of specificly defined objects is called set.
13. Tabular or roster: If a list of all membership members is written in the set description, then the writing method is called table or roster. Eg A = {1, 2, 3}
14. Set Builder: If a set specifies the list of all the elements in the set and not the list of elements, then the content of the content is specified, then the set pattern of the set is defined as the set builder. Eg A: {x: 4 <x <10, where X ∈ Z}
15. Set Type 2 1, table form, 2, set builder form
16. Vane diagram: The relationship between the two or more sets of relationships expressed in the diagram is called the Vane diagram.
17. Relation: Conditional subject matter of the components between different fields is called relation. Such as jobs and salaries, businesses and telephones.
19. If two sets of 'A' and 'B' are set, then an inexhaustible subset of AXB of Axb is called an affinity or relation from A to B.
20. Annex domain: The set of the first elements of the series included in the F set is called D, domain of relation F.
21. According to Boishshaya, how many types and what?
Answer: There are four types.
1. Reflect or reflexive 2 Symmetric symmetric 3. Non-symetric 4 Transitive
22. Function: Function is special type of relation. If any relation does not have multiple sequences of the same material, then that relation is called function.
23. Vector is a one dimensional array called vector.
24 Matrix: A matrix of two-dimensional array between the set is called matrix.
25. Set: A set list of the objects in the real world, collection or set of classes.
26. Karna Matrix: The class matrix of AIJ = 0, when i ≠ j, then the matrix is ​​called the Karna matrix.
27 Inverse or opposite matrix: A square matrix A will be called the opposite or inverse matrix if it has a feature B matrix that is AB = BA = I
29 Single Matrix: Matrix is ​​known as an identical matrix or single matrix if the unreliable components of the scalar matrix are single.
30. Identity Matrix: The square of the matrix 1 and the other elements are 0, it is called Idenitity Matrix. Identity Matrix is ​​called unit matrix or identical matrix.
31. Specify Elementary Row Operations.
Answer: 1, Gesian Elementary Row Operation 2 Gesian Jordan Elementary Row Operation
32. Counting does not count the determination of the number of the possible possibilities of some events by formatting, assembly, and splitting without identifying each object separately.
33. The basic principles of calculation are 2. Such as the principles of yojana Principles of Guidance
34. Pigeon Hole Policy: If n is the number of pigeons n + 1 or more than pigeons, but at least one pigeon must have more than one pigeon.
35. Possibility: Probability is the ratio of all the events and total results. That is, the probability of the level of belief in the statement given about an uncertain event is feasible.
36. Probability mathematical formula: probability =
37. The probability element is 2.
1. Sample field 2 Events
38. Sample field: All the results set in an examination, without regard to the repetition of any result, is the sample field of that test.
39 Incident: The samples related to a test are the facts of the set of suitable results for a particular feature of the field.
40. The probability of not being able to throws a sixfold 0
41. If a currency is cleared twice, then the sample field will be:
S:{HH, HT, TH, TT}
Total sample point = 4
42 Impossible facts: If there is no outcome in favor of an event, then it would be an impossible event.
43. The simple fact is that the facts made of a single sample point are simple facts.
44 Composite phenomena: The phenomenon involving more than one sample point is called composite phenomenon.
45. What type of graph?
Graph 5 Type
45. What is a loop?
Loop: If an arm starts with that node, then it ends up in the node, but it is called a loop.
46. Graph: graph is the decatur structure. Made up of Vertex and Edge, which connects the verticals. Graph 5 Type
47 Degree of vertex: A graph is written in the top V of V of G, the degree (v), is equal to the number of Edge in G, which holds V, that is, which falls on V.
47 Tree triangle is an attached graph, which does not contain any normal rotation.
48. Extended Binary Tree: Any Binary Tree T will be called an Extended Binary Tree, if there are 2 children in each node or there will be no children.
৫০। Polytechnic: 55440 ; FIRST = 120 ; SECOND=720, ENGINEERING= 277200; DHAKA = 60
51 Pascal's Triangle: A group of coefficient of expansion (a + b) is classified as triangular triangle, with pseckellal triangles.
52 Function's domain and range F: AA is a function. Here A's function's domain and B's range is