It takes places during surveying.
For example, let's say you want to review your own produced game application software, and found out whether it satisfy your consumer or not
Before you conduct the survey, you have to identify what aspect you want to find out from your consumers , such as : Does it have any bug ? Is it challenging enough ? is the graphic good enough ? etc
<span>When studying an information system, illustrations of actual documents should be collected using a process called sampling. Correct answer: D
</span>This process systematically selects representative elements of a population with the goal to get representative and useful information about the population as a whole and it is useful when <span>data sets that are too large to efficiently analyze in full.</span>
Answer:
Process re-design is the process in which re-work is done to achieve the improvement in the output. The major aim is to set the goals for achieving the main objective.
The various essential steps in the process of re-design are:
- Data capturing process are used to identify the process and making the necessary changes.
- Identify every step of the process to ensure that process is in organized way along with the workflow.
Re-engineering is the process of re-design the system with focuses to improve the efficiency and quality. It basically analysis the whole business re-engineering process. The main step is to identify the need for the changes.
5 I don’t think it’s good. I thought it was boring.
Answer:
See explaination
Explanation:
The reasons why indexed sequential search structure is better are:
1. In index sequential search any field of the records can be used as the key. This key field can be numerical or alphanumerical.
2. Since each record has its data block address, searching for a record in larger database is easy and quick. There is no extra effort to search records. But proper primary key has to be selected to make efficient.
3. This method gives flexibility of using any column as key field and index will be generated based on that. In addition to the primary key and its index, we can have index generated for other fields too. Hence searching becomes more efficient, if there is search based on columns other than primary key.
The reasons why 5 B-tree is better:
1.The B-tree Provides support for range of queries in an efficient manner and You can iterate over an ordered list of elements.
2. B-Tree algorithms are good for accessing pages (or blocks) of stored information which are then copied into main memory for processing. In the worst case, they are designed to do dynamic set operations in O(lg n) time because of their high "branching factor" (think hundreds or thousands of keys off of any node). It is this branching factor that makes B-Trees so efficient for block storage/retrieval, since a large branching factor greatly reduces the height of the tree and thus the number of disk accesses needed to find any key.
3. It is a generalization of a BST in that a node can have more than two children. These are self-balancing and hence the average and worst complexities is logarithmic. We opt for these when the data is too huge to fit in main memory. These structures are used in database indexing and help in faster operations on disk
the additional informations is we should first decide to choose which structure is suiatable for which algoritm in terms of space and time and then use the appropriate search algorithm.
