"); document.writeln("" + titleString + ""); document.writeln("\n"); document.writeln(""); document.writeln("Name: " + studentName + "
"); document.write("Score: " + numCorrect + " / " + numPossible + " (" + scorePercent + "%)"); if (numSubjective > 0) { document.write("     [" + numSubjective + " subjective "); if (numSubjective == 1) document.write("question"); else document.write("questions"); document.write(" not graded]"); } document.writeln("

"); document.writeln("
" + titleString + "

"); document.writeln(""); currentInstruction = 0; currentNarrative = 0; for (i=0; i < numQuestions; ++i) { if (currentInstruction < numInstructions) { if (instructionIndex[currentInstruction] == i) { document.writeln(""); ++currentInstruction; } } if (currentNarrative < numNarratives) { if (narrativeIndex[currentNarrative] == i) { document.writeln(""); ++currentNarrative; } } document.writeln(""); document.writeln(""); document.writeln(""); document.writeln(""); } document.writeln("

"); document.writeln(instructionText[currentInstruction]); document.writeln("
 
"); document.writeln("
"); document.writeln(narrativeText[currentNarrative]); document.writeln("
 
"); document.writeln("
" + prefixText[i] + "

" + numberText[i] + " 

" + questionText[i]); document.writeln("

"); document.writeln(""); if (listMap.charAt(i) != "1") { document.writeln(""); document.writeln(""); } document.writeln(""); document.writeln(""); if (showNotes) { document.writeln(""); document.writeln(""); } if (showRef) { document.writeln(""); document.writeln(""); } document.writeln("

RESPONSE: 

" + responseText[i] + "

ANSWER: 

" + answerText[i] + "

NOTES: 

" + notesText[i] + "

REF: 

" + refText[i] + "

"); document.writeln("
 
"); document.writeln("
"); document.writeln(""); document.writeln(""); document.write(""); document.writeln("
 
"); document.writeln("Retake Test"); document.write(""); document.writeln("Help"); document.writeln("
"); document.writeln(""); document.writeln(""); document.close(); return(false); } function GetResponse(answerIndex, answer) { var listIndex; var responseText; if (listMap.charAt(answerIndex) == "1") { listIndex = answer.selectedIndex; responseText = answer.options[listIndex].text; } else responseText = answer.value; return(responseText); } function ScoreAnswer(answerIndex, responseText) { var listIndex; var answerText; answerText = ansMap[answerIndex]; if (qtypeMap.charAt(answerIndex) == "4") return(NumericCompare(responseText, answerText)); else if (qtypeMap.charAt(answerIndex) == "5") return(MultiCompare(responseText, answerText)); else if (responseText.toUpperCase() == answerText.toUpperCase()) return(true); else return(false); } function BuildPrefixText(answerIndex, responseText, isCorrect) { var text; var listIndex; text = "
"
		if (isCorrect)
			text += ""
		else
			text += ""

		if (listMap.charAt(answerIndex) == "1") {
			if (responseText.length == 0)
				responseText = " ";
			text += " " + responseText + " ";
		}

		text += "
" return(text); } function StripSpaces(s) { var len; var i; len = s.length; for (i=len - 1; i >= 0 && s.charAt(i) == " "; --i) len = i; if (len == 0) s = ""; else if (len != s.length) s = s.substring(0, len); return(s); } function TranslateHtmlString(text) { var newText; var replaceString; var position; var length; var breakPos; var skipExtra; var i; newText = ""; position = 0; length = text.length; while (position < length) { skipExtra = 0; breakPos = -1; for (i=position; i < length && breakPos < 0; ++i) { switch(text.charAt(i)) { case '>': replaceString = ">"; breakPos = i; break; case '<': replaceString = "<"; breakPos = i; break; case '&': replaceString = "&"; breakPos = i; break; case '\r': if ((i + 1) < length && text.charAt(i + 1) == '\n') skipExtra = 1; replaceString = "
"; breakPos = i; break; case '\n': replaceString = "
"; breakPos = i; break; case ' ': if ((i + 1 < length) && text.charAt(i + 1) == ' ') { replaceString = " "; breakPos = i; } break; } } if (breakPos < 0) { newText += text.substring(position, length); position = length; } else { if (breakPos > position) newText += text.substring(position, breakPos); newText += replaceString; position = breakPos + 1 + skipExtra; } } return(newText); } function FixMCNotes(notesText, studentText) { var displayText; var searchText; var upperNotes; var charCode; var startIndex; var endIndex; displayText = ""; if (notesText.length > 0) { if (studentText.length > 0) { upperNotes = notesText.toUpperCase(); studentText = studentText.toUpperCase(); charCode = studentText.charCodeAt(0); searchText = "/" + String.fromCharCode(charCode) + "/"; startIndex = upperNotes.indexOf(searchText); if (startIndex >= 0) { startIndex += searchText.length; searchText = "/" + String.fromCharCode(charCode + 1) + "/"; endIndex = upperNotes.indexOf(searchText, startIndex); if (endIndex < startIndex) endIndex = notesText.length; displayText = notesText.substring(startIndex, endIndex); } } if (displayText.length == 0 && notesText.charAt(0) != "/") displayText = notesText; } return(displayText); } function NumericCompare(s1, s2) { var s1Sign; var s2Sign; var tempString; var decimalCount; var decimalPos; var numToDelete; var len; var ch; var i; s1.toUpperCase(); s2.toUpperCase(); if (s1 == s2) return(true); else { s1Sign = 1; s2Sign = 1; tempString = ""; for (i=0; i < s1.length; ++i) { ch = s1.charAt(i); if (ch == "-" && tempString.length == 0) s1Sign = -1; else if ((ch >= "0" && ch <= "9") || ch == ".") tempString += ch; } s1 = tempString; decimalCount = 0; decimalPos = -1; for (i=0; i < s1.length; ++i) { if (s1.charAt(i) == '.') { ++decimalCount; if (decimalPos < 0) decimalPos = i; } } if (decimalCount == 1 && decimalPos >= 0) { len = s1.length; for (i=len - 1; i >= decimalPos; --i) { if (i == decimalPos || s1.charAt(i) == '0') len = i; else break; } if (len < s1.length) s1 = s1.substring(0, len); if (s1.length == 0) s1 = "0"; } numToDelete = 0; for (i=0; i < s1.length; ++i) { if (s1.charAt(i) == "0") ++numToDelete; else break; } if (numToDelete > 0) { if (numToDelete == s1.length) --numToDelete; if (numToDelete > 0) s1 = s1.substring(numToDelete); } ///////////////////////////////////////////// tempString = ""; for (i=0; i < s2.length; ++i) { ch = s2.charAt(i); if (ch == "-" && tempString.length == 0) s2Sign = -1; else if ((ch >= "0" && ch <= "9") || ch == ".") tempString += ch; } s2 = tempString; decimalCount = 0; decimalPos = -1; for (i=0; i < s2.length; ++i) { if (s2.charAt(i) == '.') { ++decimalCount; if (decimalPos < 0) decimalPos = i; } } if (decimalCount == 1 && decimalPos >= 0) { len = s2.length; for (i=len - 1; i >= decimalPos; --i) { if (i == decimalPos || s2.charAt(i) == '0') len = i; else break; } if (len < s2.length) s2 = s2.substring(0, len); if (s2.length == 0) s2 = "0"; } numToDelete = 0; for (i=0; i < s2.length; ++i) { if (s2.charAt(i) == "0") ++numToDelete; else break; } if (numToDelete > 0) { if (numToDelete == s2.length) --numToDelete; if (numToDelete > 0) s2 = s2.substring(numToDelete); } if (s1Sign == s2Sign && s1 == s2) return(true); } return(false); } function MultiCompare(responseText, answerText) { var startIndex; var endIndex; var partialText; responseText = responseText.toUpperCase(); answerText = answerText.toUpperCase(); startIndex = 0; do { endIndex = answerText.indexOf("\r", startIndex); if (endIndex < 0) partialText = answerText.substring(startIndex); else partialText = answerText.substring(startIndex, endIndex); if (responseText == partialText) return(true); startIndex = endIndex + 1; } while (endIndex > 0); return(false); } function FixMTF(f) { var text; var letter; var theList; var listIndex; var number; var i; for (i=0; i < f.length; ++i) { if (f.elements[i].name.indexOf("MTF:") == 0) { number = parseInt(f.elements[i].name.substring(4), 10); theList = f["MTF-" + number + "-1"]; if (theList) { listIndex = theList.selectedIndex; letter = theList.options[listIndex].text; } else letter = ""; text = StripSpaces(f["MTF-" + number + "-2"].value); if (text == "") f.elements[i].value = letter; else f.elements[i].value = letter + "," + text; } } } function AllowReset() { return(window.confirm("Do you want to clear all of your answers?")); } // -->
 
Name: 
 

Test Chapter6



Multiple Choice
Identify the letter of the choice that best completes the statement or answers the question. ( 3 marks each)
 

1. 

A function f is increasing on an interval chapter6_files/i0020000.jpg if
a.
chapter6_files/i0020001.jpg whenever chapter6_files/i0020002.jpg in the interval chapter6_files/i0020003.jpg
b.
chapter6_files/i0020004.jpg whenever chapter6_files/i0020005.jpg in the interval chapter6_files/i0020006.jpg
c.
chapter6_files/i0020007.jpg whenever chapter6_files/i0020008.jpg in the interval chapter6_files/i0020009.jpg
d.
chapter6_files/i0020010.jpg whenever chapter6_files/i0020011.jpg in the interval chapter6_files/i0020012.jpg
 

2. 

A function f is decreasing on an interval chapter6_files/i0030000.jpg if
a.
chapter6_files/i0030001.jpg whenever chapter6_files/i0030002.jpg in the interval chapter6_files/i0030003.jpg
b.
chapter6_files/i0030004.jpg whenever chapter6_files/i0030005.jpg in the interval chapter6_files/i0030006.jpg
c.
chapter6_files/i0030007.jpg whenever chapter6_files/i0030008.jpg in the interval chapter6_files/i0030009.jpg
d.
chapter6_files/i0030010.jpg whenever chapter6_files/i0030011.jpg in the interval chapter6_files/i0030012.jpg
 

3. 

A function f has a local maximum value chapter6_files/i0040000.jpg at x = c if
a.
chapter6_files/i0040001.jpg when x is close to c, on both sides of c
b.
chapter6_files/i0040002.jpg when x is close to c, on both sides of c
c.
chapter6_files/i0040003.jpg when x is close to c, on both sides of c
d.
chapter6_files/i0040004.jpg when x is close to c, on both sides of c
 

4. 

A function f has a local minimum value chapter6_files/i0050000.jpg at x = c if
a.
chapter6_files/i0050001.jpg when x is close to c, on both sides of c
b.
chapter6_files/i0050002.jpg when x is close to c, on both sides of c
c.
chapter6_files/i0050003.jpg when x is close to c, on both sides of c
d.
chapter6_files/i0050004.jpg when x is close to c, on both sides of c
 

5. 

A critical number is
a.
a number c in the domain of a function f such that chapter6_files/i0060000.jpg
b.
a number c in the domain of a function f such that chapter6_files/i0060001.jpg
c.
a number c in the domain of a function f such that chapter6_files/i0060002.jpg or chapter6_files/i0060003.jpg does not exist
d.
either a local maximum point or a local minimum point
 

6. 

Let c be a critical number of a continuous function f. Then, f has a local maximum value at x = c provided that
a.
chapter6_files/i0070000.jpg
b.
chapter6_files/i0070001.jpg
c.
chapter6_files/i0070002.jpg changes from positive to negative at x = c
d.
chapter6_files/i0070003.jpg changes from negative to positive at x = c
 

7. 

Let c be a critical number of a continuous function f. Then, f has a local minimum value at x = c provided that
a.
chapter6_files/i0080000.jpg
b.
chapter6_files/i0080001.jpg
c.
chapter6_files/i0080002.jpg changes from positive to negative at x = c
d.
chapter6_files/i0080003.jpg changes from negative to positive at x = c
 

8. 

The graph of a function f is said to be concave upward on an interval chapter6_files/i0090000.jpg if
a.
it is moving upward on chapter6_files/i0090001.jpg
b.
it looks like a concave lens on chapter6_files/i0090002.jpg
c.
it lies above all of its tangents on chapter6_files/i0090003.jpg
d.
all of the above
 

9. 

The graph of a function f is said to be concave downward on an interval chapter6_files/i0100000.jpg if
a.
it is moving downward on chapter6_files/i0100001.jpg
b.
it looks like a concave lens on chapter6_files/i0100002.jpg
c.
it lies below all of its tangents on chapter6_files/i0100003.jpg
d.
all of the above
 

10. 

A point chapter6_files/i0110000.jpg on the graph of a function f is said to be a point of inflection if
a.
chapter6_files/i0110001.jpg
c.
the sign of chapter6_files/i0110002.jpg changes at chapter6_files/i0110003.jpg
b.
the sign of chapter6_files/i0110004.jpg changes at chapter6_files/i0110005.jpg
d.
both a) and c)
 

11. 

If chapter6_files/i0120000.jpg and chapter6_files/i0120001.jpg, f has
a.
a local minimum at chapter6_files/i0120002.jpg
c.
a point of inflection at chapter6_files/i0120003.jpg
b.
a local maximum at chapter6_files/i0120004.jpg
d.
none of the above
 

12. 

If chapter6_files/i0130000.jpg, the graph of f has
a.
a vertical asymptote at chapter6_files/i0130001.jpg
c.
a local maximum at chapter6_files/i0130002.jpg
b.
a horizontal asymptote at chapter6_files/i0130003.jpg
d.
none of the above
 

13. 

If chapter6_files/i0140000.jpg, the graph of f has
a.
a vertical asymptote at chapter6_files/i0140001.jpg
c.
a local maximum at chapter6_files/i0140002.jpg
b.
a horizontal asymptote at chapter6_files/i0140003.jpg
d.
a slant asymptote at chapter6_files/i0140004.jpg
 

14. 

If chapter6_files/i0150000.jpg, the graph of f has
a.
a vertical asymptote at chapter6_files/i0150001.jpg
c.
a vertical asymptote at chapter6_files/i0150002.jpg
b.
a horizontal asymptote at chapter6_files/i0150003.jpg
d.
a horizontal asymptote at chapter6_files/i0150004.jpg
 

15. 

If chapter6_files/i0160000.jpg, the graph of f has
a.
a vertical asymptote
c.
a slant asymptote
b.
a horizontal asymptote
d.
no asymptote
 

16. 

If chapter6_files/i0170000.jpg, the graph of f has
a.
a vertical asymptote
c.
a slant asymptote
b.
a horizontal asymptote
d.
no asymptote
 

17. 

“Optimization” means to determine
a.
the new and improved solution to a problem
b.
the best solution to a problem
c.
the biggest and brightest solution to a problem
d.
how to get someone else to solve the problem for you
 

Matching

5 Marks each
 
 
Match each function with the corresponding graph.
a.
chapter6_files/i0200000.jpg
e.
chapter6_files/i0200001.jpg
b.
chapter6_files/i0200002.jpg
f.
chapter6_files/i0200003.jpg
c.
chapter6_files/i0200004.jpg
g.
chapter6_files/i0200005.jpg
d.
chapter6_files/i0200006.jpg
h.
chapter6_files/i0200007.jpg
 

18. 


chapter6_files/i0210000.jpg
 

19. 


chapter6_files/i0220000.jpg
 

20. 


chapter6_files/i0230000.jpg
 

21. 


chapter6_files/i0240000.jpg
 

22. 


chapter6_files/i0250000.jpg
 

23. 


chapter6_files/i0260000.jpg
 

24. 


chapter6_files/i0270000.jpg
 

25. 


chapter6_files/i0280000.jpg









/40
 

Problem
 

26. 

A right circular cylinder is inscribed in a sphere of radius 8 m. Determine the maximum possible volume for such a cylinder.



































/30
 



 
Check Your Work     Reset Help