Match each activity with a corresponding dialog box:
I. Apply a background color
II. Develop a calculation in a table cell
III. Align a table horizontally
IV. Create a label above or below a table
V. Change table data to tabbed data
A. Table Properties
B. Borders and Shading
C. Formula
D. Convert Table to Text
E. Caption
B, C, A, E, D
You might also like to view...
Which statement is false?
a. In a tightly packed binary tree, each level contains about twice as many elements as the previous level. b. When searching a tightly packed 1,000,000-element binary search tree, approximately 20 comparisons need to be made. c. The level-order traversal of a binary tree visits the nodes of the tree row-by-row starting at the root node level. d. Searching a binary tree for a value that matches a key value is slow for loosely packed trees.
You can click a state in the History panel to go back to that point of your work, and then continue working from that state.
Answer the following statement true (T) or false (F)