answer:
DirectX.
hopefully this is helpful.
D. enter because if you enter something on a cuputer or laptop your selecting something
Answer:
There is no need to make an algorithm for this simple problem. Just add the two numbers by storing in two different variables as follows:
Let a,b be two numbers.
c=a+b;
print(c);
But, if you want to find the sum of more numbers, you can use any loop like for, while or do-while as follows:
Let a be the variable where the input numbers are stored.
while(f==1)
{
printf(“Enter number”);
scanf(“Take number into the variable a”);
sum=sum+a;
printf(“Do you want to enter more numbers? 1 for yes, 0 for no”);
scanf(“Take the input into the variable f”);
}
print(Sum)
Explanation:
hi there answer is given mar me as brainliest
Answer:
Answered below
Explanation:
//Program is written in Python programming language
def charCnt( fileName, char){
if not fileName.exists( ):
return sys.exit(1)
else:
openFile = open("$fileName.txt", "r")
readFile = openFile.read( )
fileLength = len (readFile)
count = 0
for character in range(fileLength):
if readFile[character] == char:
count++
openFile.close( )
return count
}
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.
