Image editing tools like photoshop and GIMP?
Answer:
The answer to this question is given below in the explanation section. However, the correct option is B. i.e a for loop.
Explanation:
The correct answer to this question is for-loop. Beause, in the for loop is written to perform a certain number of iterations or to iterate until a specific result is achieved.
for example, to calculate the average of 10 numbers, we use the for loop to iterate statements written in its body 10 times to calculate the average.
when the specific numbers of the iteration are reached it will get terminated.
for example
for (int i=0; i<=10; i++)
{
// perfrom average, code
}
this loop iterate 10 times or less, when it reached above the limit it gets stopped.
however, the other options are not correct, because an ordered data structure is like a list of order data, print function print something to the user or on screen. while an array is like a list of data of the same data type.
Answer:
by learning the right home keys and how to place the fingers
Explanation:
the left hand side : A,S,D,F
the right hand side: :, L, K, J
the two little fingers are guide keys
guide keys: letter A and column
Answer:
One approach would be to move all items from stack1 to stack2 (effectively reversing the items), then pop the top item from stack2 and then put them back.
Assume you use stack1 for enqueueing. So enqueue(x) = stack1.push(x).
Dequeueing would be:
- For all items in stack1: pop them from stack1 and push them in stack 2.
- Pop one item from stack2, which will be your dequeue result
- For all items in stack2: pop them from stack2 and push them in stack 1.
Hope it makes sense. I'm sure you can draw a diagram.
Answer:
Yes, it can be determined if an an external web site was likely accessed from a computer in the same department a couple of seconds ago.
Explanation:
Yes. “Dig” can be used to search that website in the local DNS server. A practical example would be to insert “dig google.com” and that will give us the result of the query time for searching and finding google.com. Supposing google.com was accessed a few seconds ago, then an entry for google.com is cached in the local DNS cache and the search or query time is 0 msec. If not the query time will be large.
