Turing machine is the theoretical model of computation
Answer:
A) Switch
Explanation:
In Java and most programming Languages, A Switch Statement provides a multi branch statements which provides a more flexible way for transfer of execution to the branch that fulfills the condition of the expressed value. This is a better way of handling if...elseif....else statements. In this way, a variable is tested for equality against some values. Variables used in switch expressions can only be primitives (int, byte, char), enums and strings. A switch statement has
1. A default statement (optional), appears at the end of the switch and acts as the else condition.
2. A break statement which terminates the switch when reached.
The syntax of a switch statement is given below:
switch(expression) {
case x:
// code block
break;
case y:
// code block
break;
default:
// code block
}
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.
Explanation:
I have attached the answer as an image. I can't upload the file as it requires a licensed product and I only used demo version. I can provide the file too if you can give me your vlsig file required to use full software. However, If you just copy along the images on your Visual Studio, you will easily create the files yourself. Answer is provided for both scenarios as part A and part B, one which stops after 1 iteration and the one which loops until 0 height is given.
