Assignment 03 Solution

PART A – TIC TAC TOE, 5 points

Please implement a basic version of Tic Tac Toe:
    1. Function main and function headers are provided. Please implement the functions and do not change the main.

    2. Our program must produce identical output: Assignment-03_PA_Run1.txt and Assignment-03_PA_Run2.txt


PART B – Credit Card Number Validation, 5 points

Credit card numbers follow certain patterns. A credit card number must have between 13 and 16 digits. The starting numbers are: 4 for Visa cards, 5 for MasterCard cards, 37 for American Express cards, and 6 for Discover cards.

Example: Validating 4 3 8 8 5 7 6 0 1 8 4 0 2 6 2 6


    a) Double every second digit from right to left. If doubling of a digit results in a two-digit number, add the two digits to get a single digit number.

    b) Now add all single-digit numbers from Step a:
4+4+8+2+3+1+7+8=37

    c) Add all digits in the odd places from right to left in the card number: 6+6+0+8+0+7+8+3=38

    d) Sum the results from Step b and Step c:
37+38=75

    e) If the result from Step d is divisible by 10, the card number is valid; otherwise, it is invalid.

Please implement Credit Card Number Validation:

    1. Function main is provided. Please implement isvalidcc and other functions which you may add to the program.
    2. Please do not change function main
    3. Your program must produce identical output: Assignment-03_PB_Run.pdf



PART C – Dictionary 340 C++, 90 points

Our satisfied clients are back to ask us to implement another interactive dictionary. Our dictionary takes input from users and uses the input as search key to look up values associated with the key. Requirements:

    • Coding: No hard coding, https://en.wikipedia.org/wiki/Hard_coding. Please think about Dynamic and Scalable.

    • Data Source: A text file, Data.CS.SFSU.txt . Please think about Software Deployment and Usability.

    • Data Structure: Use existing data structure(s) or create new data structure(s) to store our dictionary’s data. Each keyword, each part of speech, and each definition must be stored in a separate data field. Do not combine them such as storing three parts in one String.

    • Data Loading: When our program starts, it loads all the original data from the Data Source into our dictionary’s data structure. The data source file is opened once and closed once per run. It must be closed as soon as possible. It must be closed before our program starts interacting with users.

    • User Interface: A program interface allows users to input search keys. This interface then displays returned results. Our program searches the dictionary’s data (not the data source text file) for values associated with the search keys.

    • Identical Output: Our program’s output must be identical to the complete sample run’s output: Assignment-03_PC_Run.pdf


        1. Program Analysis to Program Design, 10 points. Please think about Interviews.

In at least 1 full page, please focus on the differences/improvements you are making in this C++ version of the program in comparison to your previous Java version while explaining the following in detail:

                • Your analysis of the provided information and the provided complete sample output. Please think about

Clients and Sales.

                • What problem you are solving. Please explain it clearly then define it concisely. Please think about

Problem Solving and Interviews.

                • How you store data from the external text file. And why. Please think about Data Structures and Data Design.

                • Which data structures you use/create for your dictionary. And why. Please think about Data Structures

and Data Design.


        2. Program Implementation, 80 points. Please think about Interviews.

            ▪ Implement your program to meet all the requirements.

            ▪ In your assignment report, demonstrate your program to your grader/client.

            ▪ Does your program work properly?

            ▪ How will you improve your program?


Happy problem-solving and happy coding!