It depends on a language you code. I think this could be either C++ or Java. I know answer for both of them.
For C++: <span>address.find("Avenue")
For Java: </span><span>address.indexOf("Avenue")</span>
Answer:
No, it can't be verified with a pseudocode.
Explanation:
We can not verify this with a pseudocode because the largest integer that we can store in 32-bit integer goes by the formula 2^32 - 1 = 4, 294, 967,295 and this means that it has 32 ones. Or it may be 2^31 - 1 = 2, 147, 483,647 which is a two complement signed integer.
Despite the fact that it can not be verified by using pseudocode, we can do the Verification by writting programs Through some programming language or in plain English code.
In a 32-bit CPU, the largest integer that we can store is 2147483647 because we can store integer as 2^31 and - (2^31 + 1).
Umm
This is to bunch of questions..
Answer:
see explaination for program code
Explanation:
scalar_product = 0
li=[]
li2=[]
#reading numbers1.txt and numbers2.txt intoli and li2 respectively
with open('numbers1.txt') as n1, open('numbers2.txt') as n2:
for line1 in n1:
li.append(int(line1))
for line2 in n2:
li2.append(int(line2))
#storing min list size into variable l
a=len(li)
b=len(li2)
if a<b:
l=a
else:
l=b
#calculating scalar product
for i in range(l):
scalar_product=scalar_product+li[i]*li2[i]
print("scalar product is",scalar_product)
