Assignment Basic Mathematics PDF
Assignment Basic Mathematics PDF
ASSIGNMENTS
PROGRAM: MSc IT SEMESTER-I
Subject Name Study COUNTRY Roll Number (Reg.No.) Student Name : : : :
INSTRUCTIONS a) Students are required to submit all three assignment sets. ASSIGNMENT Assignment A Assignment B Assignment C b) c) d) e) DETAILS Five Subjective Questions Three Subjective Questions + Case Study Objective or one line Questions MARKS 10 10 10
Total weightage given to these assignments is 30%. OR 30 Marks All assignments are to be completed as typed in word/pdf. All questions are required to be attempted. All the three assignments are to be completed by due dates and need to be submitted for evaluation by Amity University. f) The students have to attached a scan signature in the form.
Signature : Date :
_________________________________ _________________________________
4. An art museum has arranged its current exhibition in the five rooms shown in figure 1. Is there a way to tour the exhibit so that you pass through each door exactly once? If so, give a sketch of your tour. 5. Modify Kruskals algorithm so that it will produce a maximal spanning tree, that is, one with the largest possible some of weights.
Figure 1
Assignment B
1. a) Describe all the relationships seen in this Venn diagram:
B=
c) Draw a Venn diagram to prove the third subset theorem: If A, B, C are sets with A B and B C, then A C. 2. a) Prove that following two statements are contradictions. (i) (p q) ( p) ( q) (ii) (p b) Prove that following are the equivalent statements. (i) p (q r) (p q) (p r) (ii) (p q)
q)
( p q)
( p
q)
3. Let G be a group. Show that the function f:G isomorphism if and only if G is Abelian.
4. Consider the labeled tree whose diagraph is shown in the following figure. Draw the graph of the corresponding binary positional tree B(T) to show their correspondence to vertices of T.
s
Assignment C
In question 1 through 5, classify the sets as finite or infinite set. 1. 2. 3. 4. 5. Set of four seasons in year Set of vowels in word "fitted" Set of multiples of 8 more than 95 and less than 97 Set of months of the year Set of vowels in word "command"
In question 6 through 10, classify the sets as empty or singleton set. 6. Set of multiples of 2 more than 0 and less than 4 7. {0} 8. Set of vowels in word "call" 9. Set of vowels in word "fair" 10. {9} In question 11 through 17, classify the non-equivalent or equal sets. 11. A = Set of vowels in word "bottom", B = Set of vowels in word "bottom" 12. A = { a, b, c, d, e, f, g, h, x} B = { 1, 2, 3, 4, 5, 6, 7, 8, 24} 13. A = Set of vowels in word "March", B = Set of vowels in word "May" 14. A = Set of multiples of 12, B = {12, 24, 36......} 15. A = Set of letters in "finance", B = Set of letters in "mathematics" 16. A = Set of multiples of 12, B = {12, 24, 36......} 17. A = Set of multiples of 7, B = {7, 14, 21......} In question 18 through 21, find the truth table. 18. For every integer n, (2n+1) is an even integer. 19. f(x) = Cos x implies f(x) = -Sin x 20. The sum of one even and one odd integer is even integer 21. 5+6=11 22. Calculate the arithmetic mean of 5.7, 6.6, 7.2, 9.3, and 6.2. In question 23 through 25, the marks obtained by 12 students in a class test are 14, 13, 09, 19, 05, 08, 16, 17, 11, 10, 12, 16. Find 23. The mean of their marks. 24. The mean of their marks when the marks of each student are increased by 3. 25. The mean of their marks when the marks of each student are doubled. In exercise 26 through 37, choose the correct answer: 26. The number of vertices of odd degree in a graph is a) always even b) always odd
d) always zero
27. A vertex of degree one is called as a) Rendant b) isolated vertex c) null vertex d) colored vertex 28. A circuit in a connected graph, which includes every vertex of the graph is known as a) Euler b) Universal c) Hamilton d) None of these 29. A given connected graphic is a Euler graph if and only if all vertices of G are of a) same degree b) even degree c) odd degree d) different degrees 30. The length of Hamilton path (if exists) in a connected graph of n vertices is a) n-1 b) n c) n+1 d) n/2 31. A graph with n vertices and n+1 edges that is not a tree, is a) connected b) disconnected c) eculer d) a circuit 32. A graph is a tree if and only if a) is completely connected c) contains a circuit
33. The minimum number of spanning trees in a connected graph with n nodes is a) 1 b) 2 c) n-1 d) n/2 34. The number of different rooted labeled trees with n vertices a) 2n-1 b) 2n n-1 c) n d) nn 35. The number of circuit in a tree with n nodes a) zero b) 1 b) n-1 d) n/2 36. Which of the following is false ? a) The set of all bijective functions on a finite set forms a group under function composition b) The set {1,2,p-1} forms a group under function composition. c) The set of all strings over a finite alphabet forms a group under concatenation. d) A subset S of G is a sub group of the group (G,*) if and only if for any pair of elements a, b S, a * b-1 S
37. Let (Z, *) be an algebraic structure where Z is the set of integers and the operation * is defined by n * m = maximum (n, m), which of the following statements is true for (z,*). a) (z,*) is a monoid b) (z,*) is an Abelian group c) (z,*) is a group d) None of the above In question 38 through 40 determine whether the set together with binary operation is a group. 38. Z, where * is subtraction 39. R, where a * b = a + b + 2 40. The set of all matrices under the operation of matrix addition