Answer:
Online shopping is the process where costumers buy online goods and products over the internet from the sellers. The basic concept is that it is a e-commerce which runs partially over the internet. It has grown in popularity over the years because people find it easy to bargain shop and convenient.
Abstract of online shopping :
The main objective of the online shopping is that easy to use and make it interactive. It is a web based application for online retailers and users can view the each product and its complete specifications. It is a user friendly application which also provides drag and drop features so that user can easily add the product to the shopping cart and user can also go online and make changes in the order.
Answer:
a. Convenience
b. Random
c. Stratified
d. Systematic
Explanation:
Types of sampling:
The selection of sample is arbitrary and each member has an equal chance of selection.
This selection does not take probability of selection into account rather focuses on the convenience and proximity of the member for selection.
An ordered system is decided to choose the members for this sample.
This sampling plan divided the population into groups, called clusters. A cluster is then randomly selected from the selected population.
The members of the population are divided into groups, called strata. A random sample is drawn from each strata.
Yes. But most find it usually faster though to just click and drag as most people highlight more than a single word because you're more than likely to copy and paste it.
Answer:
C. FIFO
Explanation:
The first-in, first-out (FIFO) page replacement algorithm is a low-overhead algorithm that requires work on the part of the operating system. On a page fault, the frame that has been in memory the longest is replaced.
Using FIFO algorithm implies that
a page which was brought into memory first will be removed first since variable was initialized very early. it is in the set of first in pages that will be removed.
It is the simplest page replacement algorithm. The operating system keeps track of all pages in the memory in a queue, the oldest page is in the front of the queue. When a page needs to be replaced page in the front of the queue is selected for removal that is first in first out.
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is called First In First Out.