Answer:
operating system
Explanation:
There are a lot of operating systems in the market. Ubuntu, red hat, windows, apple Macintosh etc. The choice of an operating system changes all the version of software used in the system. Therefore, while choosing a computer one must be aware of the operating system used in it.
A. Insert Tab. Specifically, The insert tab, then click "Table" which will open the Insert Table Dialog Box. Good luck!
Answer:
A milestone is a significant progress point within your project. Milestones' main purpose is to set goals you have to achieve in order to succeed and complete your project
Explanation:
-Example 1-
You have to write a report for your project. This report contains introduction, problem background, results, and recommendations. The milestones for writing your report could be:
Milestone 1: introduction section is completed
Milestone 2: problem background section is completed
Milestone 3: results section is completed
Milestone 4: recommendations section is completed
-Example 2-
You have to design a webpage that allows the user to login, enters his/her name, and logout. The milestones in this case could be:
Milestone 1: login functionality is completed
Milestone 2: text field for typing the name is placed
Milestone 3: submit name button functionality is completed
Milestone 4: logout button functionality is completed
Milestone 5: all components of the webpage are fully integrated
You might think the goals in these examples can be set differently, and that is true. The definition of the milestones is in general subjective and it depends on how you design the steps you want to follow to complete your project. You might also want to add these milestones to a timeline so you have an estimated schedule of the development of your project.
Answer:
Merge sort is a sorting technique based on divide and conquer technique.
Explanation:
MERGE(A, p, q, r)
n1 = q - p + 1
n2 = r - q
L[1..n1] and R[1..n2] this creates the new array
for i = 1 to n1
L[i] = A[p + i - 1]
for j = 1 to n2
R[j] = A[q + j]
i = 1
j = 1
for k = p to r
if i > n1
A[k] = R[j]
j = j + 1
else if j > n2
A[k] = L[i]
i = i + 1
else if L[i] ≤ R[j]
A[k] = L[i]
i = i + 1
else
A[k] = R[j]
j = j + 1
