Answer:
Following are the features for formatting a report in word 2013
- Design Tab
- Convenient Layout options and alignment
- Resume work option
- Managing longer documents in a better way
- Enhanced table features
Explanation:
In word 2013, many of the new features were introduced:
- The design tab was given a new look, including templates options and much more.
- The layout option was also made much convenient by putting all necessary option under the right-click option.
- Word started to present an option for resuming the work were you left last time. This made the working much efficient.
- By dealing with headings the word 2013 version made it easier to compact the document by collapsing heading and focus on the specific part you want.
- Many of the options were added to tables formatting such as border, colors, line weight and much more.
i hope it will help you!
Answer:
Subject Matter.
Explanation:
If you have ever heard the commentary of anything in your life .You should have observed that the all of the commentators are the experienced people in that field or experts in that field.
They use their knowledge of that field to given us in depth analysis and also explain in language that is easily understandable.
Answer:
1) Choose Slide
2) Transition Tab
3) Transition To This Slide
4) Select New Transition
Explanation:
There are 4 main steps that Evie needs to take in order to accomplish this. First, she needs to choose the slide that she wants to apply the transition to. Secondly, she needs to click on the Transitions Tab at the top of the application. Thirdly, she needs to go to the "Transition to this Slide" section of the tab. Lastly, she needs to choose one of the available animation/transitions from the list of options. This will apply that transition effect to that slide, so that when she switches to that slide it performs the animation.
Answer:
# Program to find kth element
# from two sorted arrays
def kth(arr1, arr2, m, n, k):
sorted1 = [0] * (m + n)
i = 0
j = 0
d = 0
while (i < m and j < n):
if (arr1[i] < arr2[j]):
sorted1[d] = arr1[i]
i += 1
else:
sorted1[d] = arr2[j]
j += 1
d += 1
while (i < m):
sorted1[d] = arr1[i]
d += 1
i += 1
while (j < n):
sorted1[d] = arr2[j]
d += 1
j += 1
return sorted1[k - 1]
# driver code
arr1 = [2, 3, 6, 7, 9]
arr2 = [1, 4, 8, 10]
k = 5;
print(kth(arr1, arr2, 5, 4, k))
The running time will be O(n) and O(log k)
Answer:
Please find the complete solution in the attached file.
Explanation:
