Answer:
Check explanation
Explanation:
Two stacks can make use of one array by utilizing various stack pointers that begins from different ends of an array. Looking at the array A[1...
], the first stack will drive elements that starts from position 1 as well as to move its' pointer to .
The Second stack will begin at the position and motion its' pointer to 1. The best likely divide is to offer each stack a half of an array. whenever any of two stacks transverse the half-point, an overflow can happen but for that overall number of elements, it must be
Answer:
Software requirement specification
Explanation:
requirement specification is the first step before proceeding with any project.
we should validate our output at all phases with software requirement specification
Answer:
APR is the Interest rate advertised by lenders.
Explanation:
APR is the annual percentage rate that is different from the interest rate. Interest rate is the rate of borrowing money. While APR is the rate which includes interest rate, processing fee and other cost that are involved in loan approving.
This cost is decided by lender, which may be equal to interest rate or greater than interest rate.
Answer:
The solution code is written in Python:
- def square(num):
- if type(num).__name__ == 'int':
- sq_num = num * num
- return sq_num
- else:
- return "Invalid input"
-
- print(square(5))
- print(square("Test"))
Explanation:
To ensure only certain type of operation can be applied on a input value, we can check the data type of the input value. For example, we define a function and name it as <em>square</em> which take one input number, <em>num </em>(Line 1).
Before the <em>num</em> can be squared, it goes through a validation mechanism in by setting an if condition (Line 2) to check if the data type of the input number is an integer,<em> int.</em> If so, the<em> num </em>will only be squared otherwise it return an error message (Line 6).
We can test our function by passing value of 5 and "Test" string. We will get program output:
25
Invalid input
