ausslam alaikum sir g i am sumaira kharal. mcs 2nd semester hae
sir g i am so worried about cs subjects pls help me and guide me pls i request u.
Due Date: May 27, 2011View more random threads:
- MGT503 Principles of Management Assignment No.1 Solution...
- Fin622 Assignment No. 1 full solution October 2011
- HRM627 Assignment No. 1 Human Resource Developmentidea...
- Mkt501 Assignment No. 1 idea solution Fall October 2011
- MCM301 Communication Skills assignment no 1 spring fall 27...
- Mkt624 Brand Management assignment no 1 spring 2011
- MKT621 assignment no 5 solution fall 2010 on 22/01/2010
- STA630 assignmnet no 1 April 2012
- MGT613 Production Operations Management Assignment No.2...
- MGMT628 Assignment No. 1 spring fall 14 November 2011
Sponsored Links
Question 1; Mark: 5
Let be defined as
Check whether is bijective function or not?
Question 2; Marks: 5
Let be defined as
Show that and are inverse of each other.
Question 3; Marks: 5
Find the sum of the following series.
i)
ii)
ausslam alaikum sir g i am sumaira kharal. mcs 2nd semester hae
sir g i am so worried about cs subjects pls help me and guide me pls i request u.
hheheh
aur karo use jazz appna hai
MTH202 Assignment No.3 Idea Solution
yah tu lms say copy keya hai app nay
yah ha bhi galt hamri assignment hi or ha.........................
Suppose that a saleswoman has to visit eight different cities. She must begin her trip in a specific city, but she can visit the other seven cities in any order she wishes. How many possible orders can the saleswoman use when visiting these cities?
Answer.
The number of the possible path between the cities is the number of the permutations of seven elements because the first city is determined but remaining 7 can be ordered arbitrarily. Hence
7!=7*6*5*4*3*2*1=5040
So the possible paths are 5040
Use the Euclidean algorithm to find gcd (9993, 93).
Answer
1- Divide 9993 by 93= 93x107+42
2- Divide 93 by 42= 42x2+9
3- Divide 42 by 9=9x4+6
4- Divide 9 by 6=6x1+3
5- Divide 6 by 3=3x2+0
Hence gcd of(9993,93) is 3
There are currently 1 users browsing this thread. (0 members and 1 guests)