Answer:
def get_middle_ten(sentence):
ind = (len(sentence) - 12) // 2
return sentence[ind:ind + 12]
# Testing the function here. ignore/remove the code below if not required
print(get_middle_twelve("abcdefghijkl"))
print(get_middle_twelve("abcdefghijklmnopqr"))
print(get_middle_twelve("abcdefghijklmnopqrst"))
Answer:
Rainbow table attack
Explanation:
A rainbow table attack is a type of network attack or hacking where the hacker tries to utilize a rainbow hash table to crack the passwords in a database system. A rainbow table itself is a hash function used in cryptography for saving important data in a database. Especially passwords.
In this process, sensitive data are hashed two or multiple times with the same key or with different keys so as to avoid rainbow table attack. In a rainbow table attack, the hacker simply compares the hash of the original password against hashes stored in the rainbow table and when they find a match, they then identify the password used to create the hash.
Answer: Desk checking
Explanation:
The desk checking is one of the type of informal way manual testing in which the programmer use this method for evaluating or checking the coding or the different types of algorithm logic in the system.
- It helps in identifying the errors in the program so that it can be executed properly without any interruption in the system.
- It is one of the effective way for the error detection and also known as the modern debugging tool.
According to the given question, the desk checking is the term which is used to refers to the programmers for reading the given program step by step each statement. Therefore, Desk checking is the correct answer.
Therefore, Desk checking is the correct answer.
Answer:
Check the explanation
Explanation:
Algorithm for solving flood condition:
We suggest an algorithm to resolve the flood condition by creating a flow network graph.
Let us assume for every patient "p" there is a node "2" and for every hospital "h" there is a node "uh" and there is an edge ()T, uh) exist between patient "p" and hospital "h" with flow capacity of 1 iff patient "p" is reachable to hospital "h" within a half-hour.
Then source node "s" is made between all the patient-nodes by an edge with flow capacity of 1 and then the sink "t" is made by linking all the hospital nodes by an edge with capacity "[n/k]".
There is an approach to send patients to hospitals: when there is a source "s" to sink "t" flow of "n". We can send 1 flow-unit from source "s" to sink "t" along the paths (s, yp, uh, t) whenever a probable approach is available to send patients.
This approach of sending patients to hospitals doesn't break the capacity limitation of edges. Hence we can send patient "p" to hospital "h" with 1 flow- unit if edge(m uh) permits at least 1 flow- unit.
The running-time of this algorithm is found by finding the time needed to solve max-flow graph with nodes O(n+k) and edges O(
) edges.
