Question

using basic c++ and use no functions from c string library

b) Write a fragment of code (with declarations) that reads a pair of words from the keyboard and determines how many letters in corresponding positions of each word are the same. The words consist only of the letters of the English alphabet (uppercase and lowercase). For example, if the words are coat and CATTLE, the following output should be generated: 012245 0122 matching letter in position 0 t is a matching letter in position 3 c is a There are 2 matching letter/s. [8 marks] c) A nym word is a word which ends with the letters nym. For example, antonym and homonym are nym words. Write a function, isNymWord, with the following prototype: bool isNymWord (char s[]) Assume that s contains only lowercase letters. You may use the built-in strlen function [5 marks] which accepts a C-string s and returns true if s is a nym word and false, otherwise. d) A certain 6-sided die is weighted such that 2's and 4's come up twice as likely as any other number. Write a program to simulate 1000 throws of the die and output how many times each number occurs [8 marks] Total marks: 26

Answer 1

// d)

#include <iostream>

#include <time.h>

using namespace std;

int main() {

srand(time(NULL));

int dice[1000] = {0, 0, 0, 0, 0, 0};

for(int i=0; i<1000; i++)

{

int one = rand() % 8;

if(one == 6)

dice[1]++;

else if(one == 7)

dice[3]++;

else

dice[one]++;

}

for(int i=0; i<6; i++)

{

cout << i+1 << " occurred " << dice[i] << " times." << endl;

}

}

/*OUTPUT

1 occurred 147 times.

2 occurred 222 times.

3 occurred 135 times.

4 occurred 237 times.

5 occurred 135 times.

6 occurred 124 times.

*/

// Multiple questions are posted. Answered one. Please post one at a time. HOMEWORKLIB RULES.