































































Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
there pdf will guide to subjects to the universities the students mainly likely important question and answers for computer science maths
Typology: Exams
1 / 71
This page cannot be seen from the preview
Don't miss anything!
Georg Cantor (1845-1918), a German mathematician, initiated the concept ‘Theory of sets’ or ‘Set Theory’. While working on “ Problems on Trigonometric Series ”, He encountered sets, that have become one of the most fundamental concepts in mathematics. Without understanding sets, it will be difficult to explain the other concepts such as relations, functions, sequences, probability, geometry, etc. A set is defined as a collection of distinct objects of the same type or class of objects. The purposes of a set are called elements or members of the set. An object can be numbers, alphabets, names, etc. A Set is an unordered collection of objects, known as elements or members of the set. An element ‘a’ belong to a set A can be written as ‘a ∈ A’, ‘a ∉ A’ denotes that a is not an element of the set A. Examples of sets are: (a) A set of rivers of India. (b) A set of vowels. We broadly denote a set by the capital letter A, B, C, etc. while the fundamentals of the set by small letter a, b, x, y, etc. If A is a set, and a is one of the elements of A, then we denote it as a ∈ A. Here the symbol ∈ means -"Element of." Sets Representation Sets are represented in two forms:- a) Statement form. b) Roster or tabular form: In this form of representation we list all the elements of the set within braces { } and separate them by commas. Example: If A= set of all odd numbers less then 10 then in the roster from it can be expressed as A={ 1,3,5,7,9}. c) Set Builder form: In this form of representation we list the properties fulfilled by all the elements of the set. We note as {x: x satisfies properties P}. and read as 'the set of those entire x such that each x has properties P.' Example: If B= {2, 4, 8, 16, 32}, then the set builder representation will be: B={x: x= n , where n ∈ N and 1≤ n ≥5} Statement form In this representation, the well-defined description of the elements of the set is given. Below are some examples of the same.
3. Subsets: If every element in a set A is also an element of a set B, then A is called a subset of B. It can be denoted as A ⊆ B. Here B is called Superset of A. To prove A is the subset of B, we need to simply show that if x belongs to A then x also belongs to B. To prove A is not a subset of B, we need to find out one element which is part of set A but not belong to set B. ‘U’ denotes the universal set. Above Venn Diagram shows that A is a subset of B. Example: If A= {1, 2} and B= {4, 2, 1} the A is the subset of B or A ⊆ B. Properties of Subsets: COPYRIGHT DIWAKAR EDUCATION HUB Page 3 BASIC MATHEMATICS UNIT- 1
6. Universal Set: If all the sets under investigations are subsets of a fixed set U, then the set U is called Universal Set. Example: In the human population studies the universal set consists of all the people in the world. 7. Null Set or Empty Set: A set having no elements is called a Null set or void set. It is denoted by∅. 8. Singleton Set: It contains only one element. It is denoted by {s}. Example: S= {x|x∈N, 7<x<9} = {8} 9. Equal Sets: Two sets A and B are said to be equal and written as A = B if both have the same elements. Therefore, every element which belongs to A is also an element of the set B and every element which belongs to the set B is also an element of the set A. A = B ⟺ {x ϵ A ⟺ x ϵ B}. If there is some element in set A that does not belong to set B or vice versa then A ≠ B, i.e., A is not equal to B. NOTE: Order of elements of a set doesn’t matter. 10. Equivalent Sets: If the cardinalities of two sets are equal, they are called equivalent sets. Example: If A= {1, 2, 6} and B= {16, 17, 22}, they are equivalent as cardinality of A is equal to the cardinality of B. i.e. |A|=|B|= 11. Disjoint Sets: Two sets A and B are said to be disjoint if no element of A is in B and no element of B is in A. Example: R = {a, b, c} COPYRIGHT DIWAKAR EDUCATION HUB Page 4 BASIC MATHEMATICS UNIT- 1 S = {k, p, m} R and S are disjoint sets. 12. Power Sets: The power of any given set A is the set of all subsets of A and is denoted by P (A). If A has n elements, then P (A) has 2 n elements. Example: A = {1, 2, 3} P (A) = {∅, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}}. Partitions of a Set: Let S be a nonempty set. A partition of S is a subdivision of S into nonoverlapping, nonempty subsets. Speceficially, a partition of S is a collection {Ai} of nonempty subsets of S such that: o Each a in S belongs to one of the Ai. o The sets of {Ai} are mutually disjoint; that is,
was suggested by John Venn. He represented the relationship between different groups of things in the pictorial form that is known as a Venn diagram. Examples: A set is a collection or group of things. It may contain digits, vowels, animals, prime numbers, etc. A set is denoted by the capital letter and the elements of the set are denoted by the lowercase letters. All the elements of a set enclose in the pair of curly braces {}. For example, E is a set that denotes even numbers less than 10. We can represent it in the form of set, as follows: E = {2,4,6,8} Where E is the set name and 2, 4, 6, 8 are the elements of the set. We can also represent a set in pictorial form that is known as Venn diagram. What is the Venn diagram? A diagram or figure that represents the mathematical logic or relation between a finite collection of different sets (a group of things) is called the Venn diagram. It is used to illustrate the set relationship. We usually use a circle or oval to represent a Venn diagram. It may have more than one circle; each represents a set. Suppose there are two sets A and B having the elements {1, 2, 3} and {8, 5, 9}, respectively. We can represent these two sets in the Venn diagram, as shown below. Advantages of Venn Diagram o It is used for both comparison and classification. COPYRIGHT DIWAKAR EDUCATION HUB Page 6
o It groups the information into different parts. o It also highlights the similarities and differences. Uses of Venn Diagram Venn diagram is used in mathematics to understand the set theory. We also use it to understand the relationship between or among sets of objects. It depicts the set of intersections and unions. How to Draw a Venn Diagram o First, we draw a rectangle. o Write the union () sign either the left or right top corner of the rectangle. o Inside the rectangle, write the elements that do not belong to any set. Draw circle(s) that represent the set. o Inside or outside of the circle, write the name of the corresponding set. o Inside the circle, write the elements of the set. Suppose there are two sets, A and B, having some elements in common. The Venn diagram of the sets can be drawn as follows: Types of Venn Diagram There are following types of Venn diagram: o Two-Set Diagrams o Two-Set Euler Diagrams o Three-Set Diagrams o Three-Set Euler Diagrams o Four-Set Diagrams Two-Set Diagrams: When two sets overlap each other is called two-set diagrams. In the following diagram, there are two sets, A and B , having the elements {a, e, i, o, u} and {a, b, c, d,
COPYRIGHT DIWAKAR EDUCATION HUB Page 8 BASIC MATHEMATICS UNIT- 1 Three-Set Diagrams: When three sets overlap, each other is called three-set diagrams. In the following diagram, there are three sets A, B, and C having the elements {Andrew, Peter, Sam, Tom, David}, {Michael, Sam, Tom, Robert, Jack, Smith}, and {David, Maria, Tom, Angelina, Michael}, respectively. Set A, B, and C represents the name of students who learn physics, chemistry, and math, respectively. In the above sets, some students learn only one subject, some students learn tow subjects, and some students learn all three subjects. o David is the student who learns both physics and math. o Michael is the student who learns both chemistry and math. o Sam is the student who learns both chemistry and physics. o Tom is the student who learns three-subject chemistry, math, and physics. Therefore, we can represent it in the Venn diagram, as shown below. Three-Set Euler Diagram: In the three-set diagram, when a set does not overlap the other two sets is called a three-set Euler diagram. Suppose, the set A represents the set of vowels {a, e, i,
o, u}, set B represents the set of alphabets {a, b, c, d, e, f, g}, and set C represents the set of Greek letters {ρ, ω, φ, θ, ϵ}. We can represent it in the Venn diagram, as follows. The three-set Euler diagram can have a nested set. In the following diagram, the pink things set may contain a set of light-pink things. COPYRIGHT DIWAKAR EDUCATION HUB Page 9 BASIC MATHEMATICS UNIT- 1 The above diagram is not a Venn diagram because two sets do not overlap (Black Things & light-pink Things) each other. Four-Set Diagram: We use an oval shape to represent the four-set diagram because the circle no longer overlaps each other. The oval shape ensures that all sets overlap each other. It is the only option to represent the four-set diagram.
Answer: d Explanation: Set = {0} non-empty and finite set.
a) Infinite set b) Finite set c) Empty set
d) Not a set Answer: a Explanation: There is no extreme prime, number of primes is infinite.
a) {1, 2, 3} b) {1, 3, 5, 7, 9} c) {1, 2, 5, 9} d) {1, 5, 7, 9, 11} Answer: b Explanation: Odd numbers less than 10 is {1, 3, 5, 7, 9}.
and B denoted by A-B, is the set containing those elements that are in A not in B. 26. The complement of the set A is
COPYRIGHT DIWAKAR EDUCATION HUB Page 155 BASIC MATHEMATICS UNIT- 1 a) A – B b) U – A c) A – U d) B – A Answer: b Explanation: The complement of the set A is the complement of A with respect to U. 27. The bit string for the set {2, 4, 6, 8, 10} (with universal set of natural numbers less than or equal to 10) is
a) 0101010101 b) 1010101010 c) 1010010101 d) 0010010101 Answer: a Explanation: The bit string for the set has a one bit in second, fourth, sixth, eighth, tenth positions, and a zero elsewhere. 28. Let Ai = {i, i+1, i+2, …..}. Then set {n, n+1, n+2, n+3, …..} is the _________ of the set Ai. a) Union b) Intersection c) Set Difference d) Disjoint Answer: b Explanation: By the definition of the generalized intersection of the set. 29. The bit strings for the sets are 1111100000 and
a) 1010100000 b) 1010101101 c) 1111111100 d) 1111101010 Answer: d Explanation: The bit string for the union is the bitwise OR of the bit strings. 30. The set difference of the set A with null set is __________ a) A b) null c) U d) B
Answer: a Explanation: The set difference of the set A by the null set denoted by A – {null} is A. 31. Let the set A is {1, 2, 3} and B is {2, 3, 4}. Then the number of elements in A U B is? a) 4 b) 5 c) 6 d) 7 Answer: a Explanation: AUB is {1, 2, 3, 4}.
Explanation: In A – B the common elements get cancelled.
will give the result 1, i.e., B.0 = 0 B+1 = 1 Identity Law When the variable is AND with 1 and OR with 0, the variable remains the same, i.e., B.1 = B B+0 = B Idempotent Law When the variable is AND and OR with itself, the variable remains same or unchanged, i.e., B.B = B B+B = B Complement Law When the variable is AND and OR with its complement, it will give the result 0 and 1 respectively. B.B' = 0 B+B' = 1 Double Negation Law COPYRIGHT DIWAKAR EDUCATION HUB Page 1 DIGITAL LOGIC UNIT- 2 This law states that, when the variable comes with two negations, the symbol gets removed and the original variable is obtained. ((A)')' = A Commutative Law This law states that no matter in which order we use the variables. It means that the order of variables doesn't matter in this law. A.B = B.A A+B = B+A Associative Law This law states that the operation can be performed in any order when the variables priority is of same as '*' and '/'. (A.B).C = A.(B.C) (A+B)+C = A+(B+C) Distributive Law This law allows us to open up of brackets. Simply, we can open the brackets in the Boolean expressions. A+(B.C) = (A+B).(A+C
Absorption Law This law allows us for absorbing the similar variables. B+(B.A) = B B.(B+A) = B De Morgan Law The operation of an OR and AND logic circuit will remain same if we invert all the inputs, change operators from AND to OR and OR to AND, and invert the output. (A.B)' = A'+B' (A+B)' = A'.B' Sub-Algebra Consider a Boolean-Algebra (B, , +,', 0,1) and let A ⊆ B. Then (A,, +,', 0,1) is called a sub algebra or Sub-Boolean Algebra of B if A itself is a Boolean Algebra i.e., A contains the elements 0 and 1 and is closed under the operations , + and '. Example: Consider the Boolean algebra D 70 whose Hasse diagram is shown in fig: COPYRIGHT DIWAKAR EDUCATION HUB Page 2 DIGITAL LOGIC UNIT- 2 Clearly, A= {1, 7, 10, 70} and B = {1, 2, 35, 70} is a sub-algebra of D 70. Since both A and B are closed under operation ∧,∨and '. Note: A subset of a Boolean Algebra can be a Boolean algebra, but it may or may not be sub algebra as it may not close the operation on B. Isomorphic-Boolean Algebras: Two Boolean algebras B and B 1 are called isomorphic if there is a one to one correspondence f: B⟶B 1 which preserves the three operations +, and ' for any elements a, b in B i.e., f (a+b)=f(a)+f(b) f (ab)=f(a)f(b) and f(a')=f(a)'. Example: The following are two distinct Boolean algebras with two elements which are isomorphic. 1.The first one is a Boolean Algebra that is derived from a power set P(S) under ⊆