Answers:
1- cell address ( i think)
The code that examines all the strings in the input source and determines how long the longest string (or strings are) is the following:
total = 0;
% initial value is zero, in every while loop it will be incremented
while(input.hasNextInt()){
total += input.nextInt( );
}
Answer:
adware
Explanation:
Adware is a software that shows ads etc online, but also sometimes on the desktop.
Advertisware is not a real term, this is to throw you off.
Sellware is a website not a type of software
Answer:
def typeHistogram(it,n):
d = dict()
for i in it:
n -=1
if n>=0:
if str(type(i).__name__) not in d.keys():
d.setdefault(type(i).__name__,1)
else:
d[str(type(i).__name__)] += 1
else:
break
return list(d.items())
it = iter([1,2,'a','b','c',4,5])
print(typeHistogram(it,7))
Explanation:
- Create a typeHistogram function that has 2 parameters namely "it" and "n" where "it" is an iterator used to represent a sequence of values of different types while "n" is the total number of elements in the sequence.
- Initialize an empty dictionary and loop through the iterator "it".
- Check if n is greater than 0 and current string is not present in the dictionary, then set default type as 1 otherwise increment by 1.
- At the end return the list of items.
- Finally initialize the iterator and display the histogram by calling the typeHistogram.
