Answer:
Replace /* Your solution goes here */ with:
cin>>matchValue;
numMatches = 0;
for (i = 0; i < userValues.size(); ++i) {
if(matchValue == userValues.at(i))
{
numMatches++;
}
}
Explanation:
This line gets input for matchValue
<em>cin>>matchValue;
</em>
This line initializes numMatches to 0
<em>numMatches = 0;
</em>
The following iteration checks for the number of matches (numMatches) of the matchValue
<em>for (i = 0; i < userValues.size(); ++i) {
</em>
<em>if(matchValue == userValues.at(i))
</em>
<em>{
</em>
<em> numMatches++;
</em>
<em>}
</em>
<em>}
</em>
<em>See Attachment for full source code</em>
Answer:
Following is attached the code that works accordingly as required. It reads in characters from standard input and outputs the number of times it sees an 'a' followed by the letter 'b'. All the description of program is given inside the code as comments.
I hope it will help you!
Explanation:
I do not know spanish please say in english
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).
