Tom is preparing a speech on the Civil War for the weekly meeting of the Business and Professional Womens Club. As an amateur historian, Tom had previously created an Excel spreadsheet on significant Civil War battles including dates, locations, casualties, and key military figures involved. He drafts his remarks in Word, then pastes the Excel spreadsheet in the document.After selecting and copying the spreadsheet cell range, Tom maintains spreadsheet formatting in the Word file by clicking ____ in the Paste Options button.
A. Keep Source Formatting
B. Keep Source Formatting and Link to Word
C. Keep Source Formatting and Link to File
D. Keep Source Formatting and Link to Excel
Answer: D
You might also like to view...
Consider the data set shown in Table 7.13. Suppose we are interested in extracting the following association rule:
{?1 ? Age ? ?2,Play Piano = Yes} ?? {Enjoy Classical Music = Yes}
To handle the continuous attribute, we apply the equal-frequency approach
with 3, 4, and 6 intervals. Categorical attributes are handled by introducing
as many new asymmetric binary attributes as the number of categorical val-
ues. Assume that the support threshold is 10% and the confidence threshold
is 70%.
(a) Suppose we discretize the Age attribute into 3 equal-frequency intervals.
Find a pair of values for ?1 and ?2 that satisfy the minimum support
and minimum confidence requirements.
(b) Repeat part (a) by discretizing the Age attribute into 4 equal-frequency
intervals. Compare the extracted rules against the ones you had ob-
tained in part (a).
(c) Repeat part (a) by discretizing the Age attribute into 6 equal-frequency
intervals. Compare the extracted rules against the ones you had ob-
tained in part (a).
(d) From the results in part (a), (b), and (c), discuss how the choice of
discretization intervals will affect the rules extracted by association rule
mining algorithms.
Typing the value for which you are looking as a criterion is a query approach known as ____.
A. Filter by Form B. Query by Example C. Query by Selection D. Filter by Selection
Consider the following string matching algorithm, what is the name of this algorithm?
void algo(String P, String T) { int N = T.length()-1; int M = P.length()-1; char p = P.charAt(M); for(int x=N;x>=0;x--){ if(T.charAt(x) == p){ int y=0; for(y=0;y<=M;y++){ if(T.charAt(x-M+y) != P.charAt(y)) break; } if(y ==M+1) System.out.printf("Match at:%d%n",(x-M)); } } } a. Naïve string matching b. Boyer-Moore c. Rabin-Karp d. Aho-Corasick
Write a statement to increment variable n in the following sequence: 10, 20, 30, 40, etc.
What will be an ideal response?