Answer:
The cloud-based LinkedIn automation tool makes life easier for you by automating functions like sending connection requests, liking and commenting on posts, sending customized messages, and much more.
Answer:
Following are the program in the Python Programming language.
#define function
def negative_num(num_list):
#set list type variable
nlist=[]
#set the for loop
for n in num_list:
#check negative numbers
if(n<0):
#add the value of n in list
nlist.append(n)
#return list
return nlist
#set new list type variable that store list
newl=[-5,8,-6,3,-4,9,-7]
#print and call the function
print(negative_num(newl))
<u>Output</u>:
[-5, -6, -4, -7]
Explanation:
Here, we define the function "negative_num" and pass an argument "num_list" in its parameter and inside the function.
- Set new list data type variable "nlist".
- Set the for loop which iterate as the list.
- Set the if conditional statement to check the value of the list is less than 0 then, add that negative values in the variable "nlist".
- Then, return the new list.
Finally, we set a variable "newl" which store the list of negative and positive numbers then, we print and call the function.
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
Answer:
step 1:- start
step 2:-read principal amount, rate and time
step 3:- calculate interest using formula sI=((amount*rate*time)/100)
step 4:- print simple interest
step 5:- //CPP program to find compound interest for. //given values
