Answer:
Explanation:
The program in question would create a new Scanner Object which asks the user for the Username first. It would then save this input into a temporary variable and compare it to the actual username in the database. Since the username is not case sensitive, we would use the toLowerCase() method on both the input and the database username so that they match even if the letters are not the same case structure. If both usernames match then we would move on to ask the user for the Password and compare it with the database password for that user. Since this one is case sensitive we would compare as is. Finally, if both Username and Password match we would print "Hello World" otherwise we would print "Login Failed."
Answer:
<u><em>please mark brainliest!</em></u>
Explanation:
Benjamin Franklin found and acquainted power (electricity) with the USA. He likewise had numerous different developments such the wood stove. Benjamin Franklin initially stunned himself in 1746, while leading examinations on power with discovered items from around his home. After six years and precisely 261 years back today, the establishing father flew a kite joined to a key and a silk lace in a storm and adequately caught lightning in a jug.
Answer:
tuple
Explanation:
at first its a dictionary but then it is reassigned to a tuple
don't forget tuples are immutable
Answer:
Sequence of popped values: h,s,f.
State of stack (from top to bottom): m, d
Explanation:
Assuming that stack is initially empty. Suppose that p contains the popped values. The state of the stack is where the top and bottom are pointing to in the stack. The top of the stack is that end of the stack where the new value is entered and existing values is removed. The sequence works as following:
push(d) -> enters d to the Stack
Stack:
d ->top
push(h) -> enters h to the Stack
Stack:
h ->top
d ->bottom
pop() -> removes h from the Stack:
Stack:
d ->top
p: Suppose p contains popped values so first popped value entered to p is h
p = h
push(f) -> enters f to the Stack
Stack:
f ->top
d ->bottom
push(s) -> enters s to the Stack
Stack:
s ->top
f
d ->bottom
pop() -> removes s from the Stack:
Stack:
f ->top
d -> bottom
p = h, s
pop() -> removes f from the Stack:
Stack:
d ->top
p = h, s, f
push(m) -> enters m to the Stack:
Stack:
m ->top
d ->bottom
So looking at p the sequence of popped values is:
h, s, f
the final state of the stack:
m, d
end that is the top of the stack:
m
What the hell is the point of this, just to waist people's time?
