Answer:
polynomial-bounded algorithms
Explanation:
There are two algorithm complexities and they are time and space complexities. They can be denoted with the big-O notation. The big-o notation for a time and space complexity gets the worst-case time and space respectively.
The time complexity gets the measure of the execution time of an algorithm. When the time function is a polynomial ( k^n + k^n-1 ...) then the algorithm is said to be a polynomial-bounded algorithm.
Answer and Explanation:
Given that total number of records in a file = 100000
Each record consists of= 240 bytes
Given that B= 2400 bytes.
Then total blocks in file = 100000 records * 240 / 2400
= 10000 blocks.
Time that will take for exhaustive read
= s + r + b.btt
= 16 + 8.3 + (10000) * 0.8
= 8024.3 msec
Now as per given X be the number of records that are searched randomly and it takes more than exhaustive read time.
Hence, X (s + r + btt) > 8024.3
X (16+8.3+0.8) > 8024.3
X > 8024.3/25.1
So that, X > 319.69
Hence, atleast 320 random reads should be made to search the file
Answer:
describe two events from the life of the prophet that illustrate the way he treated non muslims3+15-75+375.
Explanation:
53+15-75+3756,1803+15-75+375describe two events from the life of the prophet that illustrate the way he treated non muslims
Answer:
1. social media and mobile devices may lead to psychological.
2. They may contribute to more serious health conditions such as depression.
3. The overuse of technology may have a more significant impact on developing children and teenagers.
Explanation:
may this help you have a good day
The closest line to that would be the first line:
#!/bin/bash
echo "Hello World!"
BTW, the "#!" is referred to as a she-bang. When those are the first characters executed, the (requires an absolute path) program that follows is launched, and the rest of this file is given to it as data. To run this like a program, the execute permissions need to be set ( chmod 0755 script.sh ).
