Explanation:
In an educational setting, standards-based assessment is assessment that relies on the evaluation of student understanding with respect to agreed-upon standards, also known as "outcomes". The standards set the criteria for the successful demonstration of the understanding of a concept or skill -WIKIPEDIA
The print_shape() is an illustration of Python function; whose execution is carried out when the function is called
<h3>The print_shape() function</h3>
The print_shape() function written in Python, where comments are used to explain each action is as follows:
#This defines the function
def print_shape():
#The following iteration is repeated three times
for i in range(3):
#This prints the *** in each iteration
print('***')
#This calls the function
print_shape()
Read more about Python functions at:
brainly.com/question/15745784
It looks like it would have to be choice D.
Explanation: Pagination is number assignment to pages. Word wrap is when if a word is too long it is sent to the next line. Editing would not be a precise or accurate answer.
Answer:
1.the program is moved from secondary storage to memory.
Explanation:
Secondary storage media generally have greater storage capacity than RAM (random access memory), for this reason the data and program are stored there.
but ram memories are much faster, for example, a solid state disk (SSD) with SATA III connection can have read and write speeds of approximately 500 MB/s, while a DDR III RAM can have speeds between 12 and 18 GB/S, that is, more than 20 times faster.
So that the flow of data at the time of running a program is optimal, the data from the secondary storage unit is copied to the RAM and this ensures that the speed at which the programs run is at least 20 times faster, and our processes run better.
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.
