Answer:
Question is incomplete.
Assuming the below info to complete the question
You have a collection of n lockboxes and m gold keys. Each key unlocks at most one box. Without a matching key, the only way to open a box is to smash it with a hammer. Your baby brother has locked all your keys inside the boxes! Luckily, you know which keys (if any) are inside each box.
Detailed answer is written in explanation field.
Explanation:
We have to find the reachability using the directed graph G = (V, E)
In this V are boxes are considered to be non empty and it may contain key.
Edges E will have keys .
G will have directed edge b1b2 if in-case box b1 will have key to box b2 and box b1 contains one key in it.
Suppose if a key opens empty box or doesn’t contain useful key means can’t open anything , then it doesn’t belongs to any edge.
Now, If baby brother has chosen box B, then we have to estimate for other boxes reachability from B in Graph G.
If and only if all other boxes have directed path from box B then just by smashing box B we can get the key to box b1 till last box and we can unlock those.
After first search from B we can start marking all other vertex of graph G.
So algorithm will be O ( V +E ) = O (n+m) time.
<span>the three fundamental elements of an effective security program for information systems are Identification, Authentication and Authorization.The access control creates the user and assigns the rights to resources and authorization is giving permissions to the users to access the resources.The user who wants to enter the system should have a valid data t enter the system like password, fingerprint or any other type of recognition.</span>
Answer:
<em>D. Separation of duties</em>
Explanation:
Separation of duties (SoD) is a fundamental concept in internal controls and is the hardest and often the most expensive to achieve.
<em>This aim is accomplished by distributing the tasks and associated permissions among multiple people for a specific security system.</em>
Invented by William Oughtred in the 1600s but only used in the mid 1800s
Answer:
public static boolean beginsWithZ(String word){
if(string == null || string.length() == 0)
return 0;
if(word.charAt(0) == 'Z' || word.charAt(0) == 'z')
return 1;
else
return 0;
}
Explanation:
This method is a boolean method, meaning it returns true if the string begins with Z or z and false otherwise. So:
The Java command charAt() let's you find the character at each position of the string, so i use it.
public static boolean beginsWithZ(String word){
if(string == null || string.length() == 0)
return 0;
if(word.charAt(0) == 'Z' || word.charAt(0) == 'z')
return 1;
else
return 0;
}
