Z3/Answers - Revision history

Jayaram at 09:55, 8 September 2016

2016-09-08T09:55:41Z

Abin at 07:10, 6 September 2016

2016-09-06T07:10:22Z

Abin at 07:08, 6 September 2016

2016-09-06T07:08:13Z

Abin at 12:24, 25 August 2016

2016-08-25T12:24:56Z

Abin at 12:06, 16 August 2016

2016-08-16T12:06:09Z

Abin at 10:40, 16 August 2016

2016-08-16T10:40:28Z

Abin at 09:28, 16 August 2016

2016-08-16T09:28:20Z

Abin at 09:27, 16 August 2016

2016-08-16T09:27:33Z

Abin at 08:44, 16 August 2016

2016-08-16T08:44:55Z

Abin at 06:43, 16 August 2016

2016-08-16T06:43:18Z

← Older revision		Revision as of 09:55, 8 September 2016
Line 290:		Line 290:

	ReturnSumOfSquares(12)		ReturnSumOfSquares(12)
		+
		+	- - - J
		+	We could also write
		+	SS:=SUM(SQUARES(n));
		+	SS(10);
		+
		+
		+
		+

	41. Given n, find leap years from 1 to n		41. Given n, find leap years from 1 to n

@@ Line 295: / Line 295: @@
      ===Answer By Rajendu ===
-     function ReturnSumOfSquares(SomeNumber)
+     function GetLeapYear(SomeNumber)
+     {
-         return SUM(SQUARES(SomeNumber));
+         someresult = "";
+        FOREACH(1..SomeNumber,function (x)
 . Write a function to merge two arrays and removes all duplicates elements

← Older revision		Revision as of 07:08, 6 September 2016
Line 207:		Line 207:
	(COMBIN(7,3)COMBIN(4,2))5! = 25200		(COMBIN(7,3)COMBIN(4,2))5! = 25200

		+	27. In the following paragraph,

		+	"Parsing" is the process of taking a string from a file or the network or the user, and processing it to extract the information we want. Suppose we have a string that contains some text with a pair parenthesis somewhere inside of it, like this: "It was hot (darn hot!) I'm telling you". Suppose we want to fix the string so that the part in parenthesis is in all upper case. Given a string, check if it returns a substring made of repetitions of that string.
		+
		+	a) Find the number of instances of occurrence of word "string".
		+	===Answer===
		+	Somepara= "Parsing is the process of taking a string from a file or the network or the user, and processing it to extract the information we want. Suppose we have a string that contains some text with a pair parenthesis somewhere inside of it, like this: It was hot (darn hot!) I'm telling you. Suppose we want to fix the string so that the part in parenthesis is in all upper case. Given a string, check if it returns a substring made of repetitions of that string."
		+	SomeString= Somepara.split(/[ ,.:]+/).filter(function (x)
		+	{
		+	return(x.match(/string/));
		+	});
		+	SomeString.count()
		+
		+	b) Find occurrence of word "string" and a whole, not part of any other word.
		+	SomeString= Somepara.split(/[ ,.:]+/).filter(function (x)
		+	{
		+	return(x.match(/^string?/gi));
		+	});
		+	SomeString.count()
		+
		+	31. Return true if the array contains, somewhere, three increasing adjacent numbers like .... 4, 5, 6, ... or 23, 24, 25.
		+
		+	Example array - 3,2,1,2,3,5,67,32,4,5,6,8,2
		+
		+	===Answer by Rajendu ===
		+
		+	function IsAdjacentNumber(somearray)
		+	{
		+	i=0;
		+	j=0;
		+	tempval = 0;
		+	for(i=0;i<somearray.length-1;i++)
		+	{
		+	(somearray[i]-tempval==1) ::
		+	{
		+	j++;
		+	tempval = somearray[i];
		+
		+	(j==2) ::
		+	{
		+	result = true;
		+	break;
		+	}
		+	},
		+	{
		+	j=0;
		+	tempval =somearray[i];
		+	result = false;
		+
		+	}
		+
		+	}
		+	return result ;
		+	}
		+
		+	CALL Function like
		+	arr =[3,2,1,455,3,5,67,32,4,5,6,8,2]
		+	IsAdjacentNumber(arr)
		+
		+	39. Given a string return the reverse of the string
		+
		+	===Answer By Rajendu ===
		+
		+	function ReverseString(somestring)
		+	{
		+	somearray = somestring.split("");
		+	return somearray.reverse().join('')
		+
		+	}
		+
		+	ReverseString("christmas");
		+
		+
		+	40. Given number n, find sum of squares of all natural numbers from 1 to n
		+
		+	===Answer By Rajendu ===
		+
		+	function ReturnSumOfSquares(SomeNumber)
		+	{
		+	return SUM(SQUARES(SomeNumber));
		+	}
		+
		+	ReturnSumOfSquares(12)
		+
		+	41. Given n, find leap years from 1 to n
		+
		+	===Answer By Rajendu ===
		+
		+	function ReturnSumOfSquares(SomeNumber)
		+	{
		+	return SUM(SQUARES(SomeNumber));
		+	}
		+
		+	ReturnSumOfSquares(12)
		+
		+	43. Write a function to merge two arrays and removes all duplicates elements
		+
		+	example : [apple, mango, false, grapes, null] [0, apple, mango, lemon, banana]
		+
		+	===Answer By Rajendu ===
		+
		+	function RemoveDuplicates(SomeArray1,SomeArray2)
		+	{
		+
		+	return UNIQUE($.merge( SomeArray1, SomeArray2 ));
		+	}
		+
		+	RemoveDuplicates(['apple', 'mango', false, 'grapes', null] , [0, 'apple', 'mango', 'lemon', 'banana'])

	</pre>		</pre>

← Older revision		Revision as of 12:24, 25 August 2016
Line 181:		Line 181:

	24. In how many different ways can the letters of the word 'CORPORATION' be arranged so that the vowels always come together?		24. In how many different ways can the letters of the word 'CORPORATION' be arranged so that the vowels always come together?
		+	===Answer===
		+	word = "CORPORATION";
		+	vowels ="AEIOU";
		+	vowelsarray=vowels.split("");
		+	wordletterswithoutvowels=word.split("").filter((x)=>!x.isin(vowelsarray));
		+	vowellettersfromtheword=word.split("").filter((x)=>x.isin(vowelsarray));
		+	length1=wordletterswithoutvowels.count();
		+	length2=vowellettersfromtheword.count();
		+	totalletters = length1+1;
		+	repeatedletters=2;
		+	repeatedvowelletters=3;
		+
		+	TotalWords = (totalletters!/repeatedletters!)*(length2!/repeatedvowelletters!);
		+	TotalWords;

	25. In a shop there are Jeans, Pants, Shirts and Tops of colors black, blue, grey etc and prices $20 to $200. Write a program for selection of Jeans, blue in color, that is priced between $50 and $100. If there are no Jeans, get grey color pants priced less than $50.		25. In a shop there are Jeans, Pants, Shirts and Tops of colors black, blue, grey etc and prices $20 to $200. Write a program for selection of Jeans, blue in color, that is priced between $50 and $100. If there are no Jeans, get grey color pants priced less than $50.

← Older revision		Revision as of 12:06, 16 August 2016
Line 191:		Line 191:
	Each group have 5 letter that can for 5! words = 120		Each group have 5 letter that can for 5! words = 120
	So total number of words = 210*120 = 25200 words		So total number of words = 210*120 = 25200 words
		+	(COMBIN(7,3)COMBIN(4,2))5! = 25200

← Older revision		Revision as of 10:40, 16 August 2016
Line 70:		Line 70:

	12. A helium balloon with an internal pressure of 1.00 atm and a volume of 4.50 L at 20.00 C is released. What volume will the balloon occupy at an altitude where the pressure is 0.600 atm and the temperature is –20.00 C?		12. A helium balloon with an internal pressure of 1.00 atm and a volume of 4.50 L at 20.00 C is released. What volume will the balloon occupy at an altitude where the pressure is 0.600 atm and the temperature is –20.00 C?
		+	===Answer===
		+	p1v1/nRt1=p2v2/nRt2
		+	v2:=p1v1t2/t1*p2
		+	v2:=((p1<>atm)(v1<>l)(t2<>K))/((t1<>K)*(p2<>atm))
		+	v2(1,4.5,-20,20,0.6)<>l
		+	= 7.5l
		+

	13. How many moles of gas occupy 98 L at a pressure of 2.8 atmospheres and a temperature of 292 K?		13. How many moles of gas occupy 98 L at a pressure of 2.8 atmospheres and a temperature of 292 K?

@@ Line 76: / Line 76: @@
 n=p*v/%gas*t
 n:=((p<>atm)*(v<>l))/(%gas*(t<>K))
-n(2.8,98,298)<>moles = 0.11
+n(2.8,98,298)<>moles = 0.11moles

← Older revision		Revision as of 09:27, 16 August 2016
Line 72:		Line 72:

	13. How many moles of gas occupy 98 L at a pressure of 2.8 atmospheres and a temperature of 292 K?		13. How many moles of gas occupy 98 L at a pressure of 2.8 atmospheres and a temperature of 292 K?
		+	===Answer===
		+	PV=nR*T
		+	n=pv/%gast
		+	n:=((p<>atm)(v<>l))/(%gas(t<>K))
		+	n(2.8,98,298)<>moles = 0.11
		+

	14. Following is precipitation data		14. Following is precipitation data

@@ Line 127: / Line 127: @@
 ===Answer===
 A=[[3,-4,2],[4,5,6],[2,3,-2]]
-Determinant = MDETERM(A)
+Determinant = MDETERM(A) = -159.99999
 . Generate random number sequence to simulate 1 hour of windspeed data. Updated every 30 seconds.

@@ Line 125: / Line 125: @@
 Find the sum of squares of all numbers
 Find inverse
 . Generate random number sequence to simulate 1 hour of windspeed data. Updated every 30 seconds.