Answer:
Versatility refers to the capability of a computer to perform different kinds of works with same accuracy and efficiency.
Explanation:
thank me later
Answer:
It's purpose is to access a webpage.
Explanation:
A URL contains detailed information on the webpage such as, the domain name, protocol, and path. This information directs the browser to the desired page.
Answer:
Optimistic duration
Explanation:
The following three concepts are Project management concepts:
Optismitic duration: Estimation of the shortest duration of a task, taking into account the difficulty, etc.
Pessimistic duration: Estamation of the longest duration of a task, taking into account the difficulty, etc
Expected duration: Expected duration of a task, kind of a compromise between the optmistic duration and the pessimistic duration.
Which of the following is the estimate of the minimum amount of time it would take to perform a task?
The answer is Optimistic duration
Answer:
3) Improving image quality
Explanation:
A responsive web design is a web design that makes website to be user friendly to website users. It enables the users to have an optimal and enjoyable experience when making use of websites.
A responsive web design is the basis on which websites are built. It makes websites interactive for users such that that find the websites easy to access, easy to read and very interactive.
Computer programs used for creating a responsive web design are:
a) JavaScript
b) Cascading Style Sheets e.t.c
The item used for formatting a responsive web design is Improving Image quality. This helps to make the website responsive for users.
Answer:
Sequence of popped values: h,s,f.
State of stack (from top to bottom): m, d
Explanation:
Assuming that stack is initially empty. Suppose that p contains the popped values. The state of the stack is where the top and bottom are pointing to in the stack. The top of the stack is that end of the stack where the new value is entered and existing values is removed. The sequence works as following:
push(d) -> enters d to the Stack
Stack:
d ->top
push(h) -> enters h to the Stack
Stack:
h ->top
d ->bottom
pop() -> removes h from the Stack:
Stack:
d ->top
p: Suppose p contains popped values so first popped value entered to p is h
p = h
push(f) -> enters f to the Stack
Stack:
f ->top
d ->bottom
push(s) -> enters s to the Stack
Stack:
s ->top
f
d ->bottom
pop() -> removes s from the Stack:
Stack:
f ->top
d -> bottom
p = h, s
pop() -> removes f from the Stack:
Stack:
d ->top
p = h, s, f
push(m) -> enters m to the Stack:
Stack:
m ->top
d ->bottom
So looking at p the sequence of popped values is:
h, s, f
the final state of the stack:
m, d
end that is the top of the stack:
m
