894 views

Uploaded by Wendoor6696

- Assignment Software Engineering
- ADL - 301 Mathematics
- BFIA01172009-2012041_BPSM
- Basic Mathematics Vol I for Online
- DMS Assignment
- SE Software Quality
- Operating Systems
- FA Assigment
- Assignment SAD
- Operating System for Online
- P&LAC Exercises Practice
- Assignment_Basic_Mathematics.pdf
- ASB_BFIA01172009-2012041
- question number 1
- BomAssinDVD
- amity assignment
- Basic mathematics
- Database Management System Assignment
- Oracle Assignment
- Answers Problem Set 1

You are on page 1of 6

Amity Centre for eLearning

ASSIGNMENT

PROGRAM: SEMESTER:

Subject Name : Permanent Enrollment Number (PEN) : Roll Number (SEN) : 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 40 Objective 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 (specified from time to time) and need to be submitted for evaluation by Amity University.

( √ ) Tick mark in front of the assignments submitted Assignment ‘A’ Assignment ‘B’ Assignment ‘C’

Copyright© 2010 Amity Univesity

one with the largest possible some of weights. b) Define the following with the help of suitable examples. If p: He is smart q: He is rich Give a simple verbal proposition for each of the following propositions. Figure 1 Copyright© 2010 Amity Univesity . median. that is. Marks Students 0-10 2 10-20 14 20-30 10 30-40 7 40-50 9 50-60 15 60-70 2 70-80 9 80-90 3 90-100 1 4. (i) p (ii) q (iii) p q (iv) p q (v) p q (vi) p q (v) p q (vi) p q 2. a) What is a set? Explain various methods to represent a set in set theory. a) Define logical statement. An art museum has arranged its current exhibition in the five rooms shown in figure 1. give a sketch of your tour. What is a truth table? Prepare the truth tables for the following statements and then check which are the tautologies.Basic Mathematics Assignment A 1. (i) (p q) (p q) (ii) (p q) ( ( r q)) (iii) q (p q) (iv) p q ↔ (q p) b) Define Conjunction. Disjunction with example. b) Find the mean. mode for the following data. 5. (i) Singleton Set (ii) Finite Set (iii) Cardinality of a Set (iv) Subset of a Set 1. a) What are the advantages of measures of central tendency? Discuss various measures of central tendency. Is there a way to tour the exhibit so that you pass through each door exactly once? If so. Modify Kruskal’s algorithm so that it will produce a maximal spanning tree.

Let G be a group. G defined by f(a) = a-1 is an 4. a) Describe all the relationships seen in this Venn diagram: b) Draw the Venn diagram for A B= . C are sets with A B and B C. then A C. Consider the labeled tree whose diagraph is shown in the following figure. c) Draw a Venn diagram to prove the third subset theorem: If A.Basic Mathematics Assignment B 1. Draw the graph of the corresponding binary positional tree B(T) to show their correspondence to vertices of T. B. a) Prove that following two statements are contradictions. Show that the function f:G isomorphism if and only if G is Abelian. (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. s t u v w x y z Copyright© 2010 Amity Univesity . 2.

16. 36. 3. h. 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. c. A = Set of multiples of 12. The mean of their marks when the marks of each student are doubled. B = {12. 19. 5.. 19. Copyright© 2010 Amity Univesity . B = {12. 7. B = Set of vowels in word "May" 14.. the marks obtained by 12 students in a class test are 14. 2. classify the sets as finite or infinite set. The mean of their marks when the marks of each student are increased by 3. Set of multiples of 2 more than 0 and less than 4 7. x} B = { 1.. f(x) = Cos x implies f’(x) = -Sin x 20. B = Set of letters in "mathematics" 16. 13. 16.3. 4.} 15. 7. 11.} In question 18 through 21. 21. A = Set of letters in "finance". {0} 8. g. A = Set of multiples of 7. 09. d.. The sum of one even and one odd integer is even integer 21. Calculate the arithmetic mean of 5.. classify the sets as empty or singleton set. B = {7. 5.. 18. 2. 24} 13. 25. 1. B = Set of vowels in word "bottom" 12. 05.2. and 6. 24.2. In question 23 through 25. Set of vowels in word "fair" 10.. 24.6. {9} In question 11 through 17. For every integer n. A = Set of multiples of 12.. 24.. 6.. 8. classify the non-equivalent or equal sets. b. (2n+1) is an even integer. A = Set of vowels in word "March". 08. 6. f. 6. 5+6=11 22. 17. 11. 14. The mean of their marks. 12.. 10. 4.. Set of vowels in word "call" 9. find the truth table. 9.Basic Mathematics Assignment C In question 1 through 5. A = Set of vowels in word "bottom".} 17. 36.7. A = { a. e. Find 23.... 3.

Basic Mathematics In exercise 26 through 37. The number of different rooted labeled trees with n vertices a) 2n-1 b) 2n n-1 c) n d) nn 35. A graph with n vertices and n+1 edges that is not a tree. 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. choose the correct answer: 26. which includes every vertex of the graph is known as a) Euler b) Universal c) Hamilton d) None of these 29. 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. The number of vertices of odd degree in a graph is a) always even b) always odd c) either even or odd d) always zero 27. 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. is a) connected b) disconnected c) eculer d) a circuit 32. Copyright© 2010 Amity Univesity . A circuit in a connected graph. 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 number of circuit in a tree with n nodes a) zero b) 1 b) n-1 d) n/2 36. A graph is a tree if and only if a) is completely connected c) contains a circuit b) is minimum connected d) is planer 33. A vertex of degree one is called as a) Rendant b) isolated vertex c) null vertex d) colored vertex 28.…p-1} forms a group under function composition.2.

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.Basic Mathematics c) The set of all strings over a finite alphabet forms a group under concatenation. b S.*) is an Abelian group c) (z. which of the following statements is true for (z. a * b-1 S 37. 38. d) A subset S of G is a sub group of the group (G. m). Let (Z. The set of all matrices under the operation of matrix addition Copyright© 2010 Amity Univesity . *) be an algebraic structure where Z is the set of integers and the operation * is defined by n * m = maximum (n. where * is subtraction 39.*) if and only if for any pair of elements a. where a * b = a + b + 2 40. a) (z. R.*) is a monoid b) (z.*).

- Assignment Software EngineeringUploaded byNadia Baker
- ADL - 301 MathematicsUploaded byluvlastcall
- BFIA01172009-2012041_BPSMUploaded byFrancis Mtambo
- Basic Mathematics Vol I for OnlineUploaded byAmity-elearning
- DMS AssignmentUploaded byTanuj Ghimire
- SE Software QualityUploaded byChaii Chai
- Operating SystemsUploaded bysolvedcare
- FA AssigmentUploaded byFrancis Mtambo
- Assignment SADUploaded byVincent Keys
- Operating System for OnlineUploaded byAmity-elearning
- P&LAC Exercises PracticeUploaded byDilfaraz Kalawat
- Assignment_Basic_Mathematics.pdfUploaded byTsrt Kbfe
- ASB_BFIA01172009-2012041Uploaded byFrancis Mtambo
- question number 1Uploaded bySteve Mus
- BomAssinDVDUploaded byFrancis Mtambo
- amity assignmentUploaded bySameer Sharma
- Basic mathematicsUploaded byRanjan Singh Garhia
- Database Management System AssignmentUploaded byNadia Baker
- Oracle AssignmentUploaded byComfort Johnson
- Answers Problem Set 1Uploaded byNadia Baker
- Assignments 2Uploaded bykiwanuka45
- Mmak Msi 204Uploaded byNadia Baker
- AssignmentUploaded byRoy Kachale Banda
- Assignments 3Uploaded bykiwanuka45
- MC0068 - Set 2Uploaded bynikeneel
- Binary SubtractionUploaded byArnab Pal
- Question Bank QpUploaded bymani85a
- AmityUploaded byHritwik Arya
- AMITY UNIVERSITYUploaded bySeema Gupta

- EE384y HeuristicsUploaded bysakthi91
- NotesRGCNUploaded byNina Brown
- Shotest Path Algorithm Dijikstra’s AlgorithmUploaded bysoneshl
- COAMRUploaded byselva20
- On Triangular Sum Labeling of GraphsUploaded byGRD Journals
- CMU-CS-98-189Uploaded byKrzysztof Chudzicki
- Trigonometric IdentitiesUploaded bylekz re
- Python Program to Create a List of Tuples With the First Element as the Number and Second Element as the Square of the Number - SanfoundryUploaded byRavinderRavi
- 11-global-routingUploaded byBhavya Gautam
- BfsUploaded byMăcău Maria Giorgiana
- Trigo 1 Class Test {MS}Uploaded byMadhu Sharma
- dm1Uploaded bybasualok@rediffmail.com
- Chapter - I2003FinishedUploaded bypalanishanthi
- My Solutions to or Exercise Set 7Uploaded byU.N.Owen
- en-h04Uploaded byShuvadeep Das
- TrigUploaded byDon Wilson
- Handbook of Industrial Engineering Equations, Formulas and CalculationsUploaded byartust
- Numerical Methods MCQUploaded bybhattoo07
- Matching GraphUploaded bytutorciecleteam
- Odd Harmonious Labeling of Some GraphsUploaded byDon Hass
- Calculus Cheat SheetUploaded byJacquelyn Keller
- notes dda line drawing algorithmUploaded byapi-263987257
- Ch 2 Inverse Trigo Multiple Choice Questions (With Answers)Uploaded byCRPF School
- Graph Theory 0.3Uploaded byserdaryesilmurat
- Clustering Wireless Sensor Nodes Using Caterpillar GraphUploaded byijcsis
- Emuneration Techniques_Gabriel CarrollUploaded byLiu Yi Jia
- Graphs ModulationUploaded bykowskii666_719410288
- IRJET-Global Accurate Domination in Jump GraphUploaded byIRJET Journal
- UNIT v Rejinpaul Pds2Uploaded byRevathi Saravanan
- NodeXL Tutorial DraftUploaded byRoland Walter Miranda