Hello, dear friend, you can consult us at any time if you have any questions, add WeChat: daixieit

COMP2113 Programming Technologies / ENGG1340 Computer Programming II

Assignment 2

Deadline: 16 November (Thursday) 23:59

If you have any questions, please post to the Moodle discussion forum on Assignment 2.

Total marks: 100 marks

General Instructions

Read the instructions in this document carefully.

In this assignment you will solve 3 tasks and a tester would automatically test your submitted program. So if your submitted files and program outputs do not conform to our instructions given here, your programs cannot be evaluated and you will risk losing marks totally.

Sample test cases are provided with each task in this document. Note that the test cases mayor may not cover all boundary cases for the problem. It is also part of the assessment whether you are able to design proper test cases to verify the correctness of your program. We will also use additional test cases when marking your assignment submission.

Input and output format

Your  C++  programs  should  read  from  the standard  input.  Also,  your  answer  should  be  printed  through the standard output. If you failed to follow this guide, the tester may not able to give a score for your program. Additionally, you should strictly follow the sample output format (including space, line breaker, etc.), otherwise, your answer might be considered as wrong.

How to use the sample test cases for problems 1 and 3?

Sample testcases in text file formats are made available for you to check against your work. Here’show you may use the sample test cases. Take problem  1 test case 2 as an example. The sample input and the expected output are given in the files input1_2.txt and output1_2.txt, respectively. Suppose that your program is named " 1", do the followings at the command prompt of the terminal to check if there is any difference between your output and the expected output.

./1 < input1_2.txt > myoutput.txt

diff myoutput.txt output1 2.txt

Testing against the sample test cases is important to avoid making formatting mistakes. The additional test cases for grading your work will be of the same formats as the sample test cases.

Coding environment

You must make sure that your C++ program can compile, execute and generate the required outputs on our standard environment, namely, the gcc C++11 environment we have on the CS Linux servers (academy*). Make sure the following compilation command is used to compile your programs:

g++ -pedantic-errors -std=c++11 [program name].cpp -o [object code name]

The name after the “-o” option is the name of the object code. In the above example, you can run the program using the following command:

./[object_code_name]

As a programmer/developer, you should always ensure that your code can work perfectly as expected on a target (e.g., your client’s) environment, not only on yours.

While you may develop your work on your own environment, you should always try your program (compile & execute & check results) on our standard environment before submission.

Submission

Name your C++ program files (and Makefile for Problem 3) as the following table shows and put them together into one directory. Make sure that the folder contains only these source files (*.cpp / *h / Makefile) and no other files. Compress this directory as [uid].zip file where [uid] is your university number and check carefully that the correct file have been submitted. We suggest you to download your submitted file from Moodle, extract them, and check for correctness. You will risk receiving 0 marks for this assignment if you submit incorrect files. Resubmission after the deadline is not allowed.

Filename	Description
1.cpp	Problem 1
searchword.cpp	Problem 2
quadratic.cpp, main3.cpp, Makefile	Problem 3

Late submission

Problem 1 [30%]:

A playing card consists of a suit (“Heart”, “Diamond”, “Club” or “Spade”) and a number value (1 to 13). For  simplicity, let’suse characters ‘H’, ‘D’, ‘C’ and ‘S’ to represent suits “Heart”, “Diamond”, “Club” and “Spade” respectively. So, a playing card is represented by one character combined with a number such as “H2”, “C6” and “D12” . Two cards are said to be a pair when they have the same number value. Please write a C++ program to  read an integer N and then N playing cards afterwards. The program then outputs 1) the number of pairs among  the N playing cards, and 2) the sum of the values of theN playing cards.

For example, the sets  {“H3”, “D3”} and {“H3”, “D3”, “C3”} contain 1 pair each and their sum of values are 6 and 9 respectively. The sets {“H3”, “D3”, “C3”, “ S3”} and  {“H3”, “D3”, “C6”, “S6”} contain 2 pairs each and their sum of values are 12 and 18 respectively. You can assume that the input playing cards are always valid and the N playing cards are distinct (which means N must be smaller than or equal to 52).

Sample Test Cases

User inputs are shown in blue.

1_1:

8 H5 D6 C5 S6 C13 H10 D5 C6

2

56

1_2:

9 H2 H1 D2 D1 C2 C1 S2 S5 D5

4

21

1_3:

10 D6 D9 H9 C9 S12 S6 H6 C6 H12 S9

5

84

Sample Test Cases

Sample text files t1.txt, t2.txt, t3.txt, t4.txt are provided.

We show only the contentsof t1.txt, t2.txt, t3.txthere:

t1.txt	t2.txt	t3.txt
Cab AbB CAB Ab CaB ABc aBb AB cAb caB aBcAB CAB ABcAb AbcAb aBCAB AB ABcAb aBCaB ABCAB Abb aBC abC AbC ABCAB abCab ABC aBCAB ABcAB AB cAb	ab abcab Ab abc aBCAB AbCAb abC AbC ab abcab aBc aBc ab abcAB Abc aBC ab abC ab aB AbCAB AbcaB Ab ab ABc aBcab abC ABc AbCab ABcAb	app THe Elf DeEd keep SHe DEED dEEd aPP Ab sheeP Cde THe sHe ElF CDE sHe KeEP aB eLF An CaT sHE hE KEeP he SHE dEED ab she

Commands entered by the users at the command line prompt “>” to run your program are shown in blue.

Note that since there is no user input from the standard input, here's how you should test your output against

the sample output (e.g., for test case 2_1) to check for correctness:

./main2 abc t1.txt t2.txt t3.txt > myoutput.txt

diff myoutput.txt output2_1.txt

2_1:

./main2 abc t1.txt t2.txt t3.txt

t1.txt: 2 5  t2.txt: 4 11  t3.txt: 0 0

2_2:

./main2 ab t1.txt t2.txt t3.txt

t1.txt: 3 4  t2.txt: 4 9  t3.txt: 3 3

2_3:

./main2 he t3.txt t4.txt t5.txt

t3.txt: 1 2  t4.txt: 3 4  t5.txt: error opening file

// quadratic.cpp

#include

#include

#include "quadratic.h"using namespace std;

double discriminant(double a, double b, double c) {

// to be implemented

}

int numRoots(double a, double b, double c) {

// to be implemented

}

double root1(double a, double b, double c) {

// to be implemented

}

double root2(double a, double b, double c) {

// to be implemented

}

Requirements

Task 1: Please complete the implementation of the 4 functions in quadratic.cpp.

Task 2: Please implement a main program main3.cpp which accepts 3 double values (a, band c in the quadratic equation). The program then prints the discriminant, the number of roots and the root(s) on screen. All double values should be printed with 3 significant figures. You may use setprecision(n) defined in the header  to set the precision parameter of the output stream.

You  must  call  the   functions   discriminant(),  numRoots(),  root1() and  root2() defined  in “quadratic.cpp” in your main program.

Please compile your programs using the command g++ -pedantic-errors -std=c++11 main3.cpp quadratic.cpp -o main3. Then run the main program using the command  ./main3 to see whether it behaves as expected.

Task 3: Please create a Makefile to generate the following targets:

quadratic.o: which depends on quadratic.cpp and quadratic.h

main3.o: which depends on main3.cpp and quadratic.h

main3: which depends on quadratic.o and main3.o

clean: for cleaning main3, main3.o and quadratic.o

You should assume that there can be a file named “clean” in the folder and you need to make sure that running make clean will not cause any conflict.

Upon Makefile is  created  appropriately,  you  should   be  able  to  compile  all   programs   by  issuing  the command make main3 and cleaning all object files by issuing the command make clean.

Sample Test Cases

User inputs are shown in blue.

3 1:

_

6

-17

12

Discriminant: 1

Number of roots: 2

The roots are 1.5 and 1.33

3 2:

_

1

4

4

Discriminant: 0

Number of roots: 1

The root is -2

3 3:

_

1

-11

28

Discriminant: 9

Number of roots: 2

The roots are 7 and 4

3_4:

6

-1

-5

Discriminant: 121

Number of roots: 2

The roots are 1 and -0.833

3_5:

3

4

4

Discriminant: -32

Number of roots: 0

No real root