CS代考 COMP1110/1140/6710 2020 S2 Exam – cscodehelp代写
# COMP1110/1140/6710 2020 S2 Exam
This repo contains an IntelliJ project for the 2020 S2 exam.
*Note that you will see multiple versions of many of the questions (eg Q1.1A, Q1.1B, etc).
In the actual exam you would be randomly assigned one of the variants. When using
this as a practice exam, you should just chose one of each variant, and then you
can do the other variants later for further practice. Each variant is very similar.*
You have **3 hours and 15 mins** to complete the exam.
This exam is open book. This means that you may use books, notes, and any
other such *pre-existing* information as you complete the exam.
You **must
not** communicate with any person other than the examiners at any time during
Chat, text, email and all other such forms of communications **must**
be turned off prior to the exam and must remain off for the **duration of the
exam**. **The penalties for cheating in an exam at ANU are severe.**
Important notes:
* There are six (6) questions, each worth different marks.
* The total marks for the exam are 90 (15 + 5 + 25 + 20 + 5 + 20)
* The exam will be **entirely auto-graded**, so it is important that your code
passes the tests, and that you commit and push your work.
* The CI for the multiple choice question will *not* tell you whether your
answer is correct, it will only tell you if your answer is *formatted correctly*.
* There are two practice questions, **P1** and **P2**. You do not need to
complete them. They are worth **zero** marks. They are there
only to help you prepare your environment for the exam.
## Question 1 [15 Marks] Imperative Programming in Java
### Q1.1A [5 Marks] Basic Imperative Programming
Using the incomplete template for [Q1Ceil.java](src/comp1110/exam/Q1Ceil.java),
complete the unimplemented method `findLess()`.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
### Q1.1B [5 Marks] Basic Imperative Programming
Using the incomplete template for [Q1Closest.java](src/comp1110/exam/Q1Closest.java),
complete the unimplemented method `findClosest()`.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
### Q1.1C [5 Marks] Basic Imperative Programming
Using the incomplete template for [Q1Floor.java](src/comp1110/exam/Q1Floor.java),
complete the unimplemented method `findGreater()`.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
### Q1.1D [5 Marks] Basic Imperative Programming
Using the incomplete template for [Q1Furthest.java](src/comp1110/exam/Q1Furthest.java),
complete the unimplemented method `findFurthest()`.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
### Q1.1E [5 Marks] Basic Imperative Programming
Using the incomplete template for [Q1Remainder.java](src/comp1110/exam/Q1Remainder.java),
complete the unimplemented method `findCloseDivisor()`.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
### Q1.2A [5 Marks] Recursion (harder)
Using the incomplete template for [Q1Magic.java](src/comp1110/exam/Q1Magic.java),
complete the unimplemented method `magic()`.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
### Q1.2B [5 Marks] Recursion (harder)
Using the incomplete template for [Q1Ox.java](src/comp1110/exam/Q1Ox.java),
complete the unimplemented method `ox()`.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
### Q1.2C [5 Marks] Recursion (harder)
Using the incomplete template for [Q1TwoThree.java](src/comp1110/exam/Q1TwoThree.java),
complete the unimplemented method `twothree()`.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
### Q1.2D [5 Marks] Recursion (harder)
Using the incomplete template for [Q1VowCon.java](src/comp1110/exam/Q1VowCon.java),
complete the unimplemented method `vowcon()`.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
### Q1.3A [5 Marks] Search (harder)
Using the incomplete template for [Q1Number.java](src/comp1110/exam/Q1Number.java),
complete the unimplemented method `find()`.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
### Q1.3B [5 Marks] Search (harder)
Using the incomplete template for [Q1Puzzle.java](src/comp1110/exam/Q1Puzzle.java),
complete the unimplemented method `fillGrid()`.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
### Q1.3C [5 Marks] Search (harder)
Using the incomplete template for [Q1Word.java](src/comp1110/exam/Q1Word.java),
complete the unimplemented method `find()`.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
### Q1.3D [5 Marks] Search (harder)
Using the incomplete template for [Q1Bishop.java](src/comp1110/exam/Q1Bishop.java),
complete the unimplemented method `blackBishopMoves()`.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
## Q2A [5 Marks] File I/O, Imperative Programming
Using the incomplete template for [Q2Caps.java](src/comp1110/exam/Q2Caps.java),
complete the unimplemented method `capitalize()`.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
## Q2B [5 Marks] File I/O, Imperative Programming
Using the incomplete template for [Q2Checksum.java](src/comp1110/exam/Q2Checksum.java),
complete the unimplemented method `checksum()`.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
## Q2C [5 Marks] File I/O, Imperative Programming
Using the incomplete template for [Q2Redact.java](src/comp1110/exam/Q2Redact.java),
complete the unimplemented method `redact()`.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
## Q3A [25 Marks]
### Q3.1A [20 Marks] Software Implementation
Using the incomplete template for [Q3Hollywood.java](src/comp1110/exam/Q3Hollywood.java),
complete *all unimplemented methods*.
You must complete your solution as **a single file, [Q3Hollywood.java](src/comp1110/exam/Q3Hollywood.java)**.
You are encouraged to create additional classes as required to solve the problem;
any additional classes must be implemented as **nested classes** within the
`Q3Hollywood` class.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
### Q3.2A [5 Marks] Software Testing
Using the incomplete template for [Q3GetMaxCoStarsTest.java](src/comp1110/exam/Q3GetMaxCoStarsTest.java),
write one or more unit tests for the `getMaxCoStars()` method. You must complete
your solution as a single file, `Q3GetMaxCoStarsTest.java`. When writing the
tests, you may assume that the provided methods in the `Q3Hollywood` class are
correctly implemented.
The specification of the `getMaxCoStars()` method is provided in the Javadoc
comment immediately above the method. This question is auto-graded; your tests
will be run against multiple implementations of the `getMaxCoStars()` method,
one of which is correct and some incorrect. Your test must be able to pass
the correct implementation. If you cannot pass the correct implementation
you will get zero (regardless of how many incorrect implementations you fail.
If you pass the correct implementation, you will get one mark, and then one
additional mark for each incorrect implementation that you fail.
Once you have completed your tests, commit and push your changes to GitLab.
## Q3B [25 Marks]
### Q3.1B [20 Marks] Software Implementation
Using the incomplete template for [Q3Library.java](src/comp1110/exam/Q3Library.java),
complete *all unimplemented methods*.
You must complete your solution as **a single file, [Q3Library.java](src/comp1110/exam/Q3Library.java)**.
You are encouraged to create additional classes as required to solve the problem;
any additional classes must be implemented as **nested classes** within the
`Q3Library` class.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
### Q3.2B [5 Marks] Software Testing
Using the incomplete template for [Q3GetMaxCoauthorsTest.java](src/comp1110/exam/Q3GetMaxCoauthorsTest.java),
write one or more unit tests for the `getMaxCoauthors()` method. You must complete
your solution as a single file, `Q3GetMaxCoauthorsTest.java`. When writing the
tests, you may assume that the provided methods in the `Q3Library` class are
correctly implemented.
The specification of the `getMaxCoauthors()` method is provided in the Javadoc
comment immediately above the method. This question is auto-graded; your tests
will be run against multiple implementations of the `getMaxCoauthors()` method,
one of which is correct and some incorrect. Your test must be able to pass
the correct implementation. If you cannot pass the correct implementation
you will get zero (regardless of how many incorrect implementations you fail.
If you pass the correct implementation, you will get one mark, and then one
additional mark for each incorrect implementation that you fail.
Once you have completed your tests, commit and push your changes to GitLab.
## Q4A [20 Marks] Data Structures
Using the incomplete template for [Q4FerrisWheel.java](src/comp1110/exam/Q4FerrisWheel.java),
complete each of the unimplemented methods.
Your solution must implement the data structure from first principles (as was
done in lectures), avoiding use of Java’s collection classes such as
`java.util.List`. *Solutions that ignore this requirement will be penalized
accordingly.*
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
## Q4B [20 Marks] Data Structures
Using the incomplete template for [Q4SushiTrain.java](src/comp1110/exam/Q4SushiTrain.java),
complete each of the unimplemented methods.
Your solution must implement the data structure from first principles (as was
done in lectures), avoiding use of Java’s collection classes such as
`java.util.List`. *Solutions that ignore this requirement will be penalized
accordingly.*
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
## Q5A [5 Marks] Hash Codes
Using the incomplete template for [Q5Address.java](src/comp1110/exam/Q5Address.java),
complete the unimplemented methods `hash()` and `equals()`. You must implement
`hash()` **without using Java’s built-in `hashCode()` method**.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
## Q5B [5 Marks] Hash Codes
Using the incomplete template for [Q5Car.java](src/comp1110/exam/Q5Car.java),
complete the overridden methods `hashCode()` and `equals()` correctly, according
to the contract of these methods. Your hash function should be as uniform as
possible. In implementing your hash code, you may *not* use the default Java
implementations in `Object.hashCode()` or `Objects.hashCode()`.
Use the tests provided to test your solution, and then commit and push your changes to GitLab.
## Q5C [5 Marks] Hashing and Equality
Using the incomplete template for [Q5Actor.java](src/comp1110/exam/Q5Actor.java),
complete the unimplemented methods `hash()` and `equals()`. You must implement
`hash()` **without using Java’s built-in `hashCode()` method**.
Use the tests provided to test your solution, and then commit and push your
changes to GitLab.
## Q6 [20 Marks] Multiple Choice
For each of the following multiple-choice questions, identify the choice that
provides the best answer. Record your choices in the file [q-6.csv](q-6.csv),
one line per question.
For example, to answer “a” to question Q6.1, “d” to question Q6.2, “a” to
question Q6.4, and leave question Q6.3 unanswered, you would record the following
in `q-6.csv`:
Please note that you can only provide **one** answer to any multiple choice
question. Please chose the answer that you think is the best answer. If
you are unsure, leave it out, as in the example above where question 3 is left
Each question that is *correctly* answered **gains you 5 marks**, each question
answered *incorrectly* **loses you 1 mark**, a question left *unanswered*
**neither loses nor gains marks**. The final mark for the question is calculated
by bounding the sum of marks between 0 and 20. For example, if you answered all
questions correctly in the exam you would gain 20. If you answer 1 correctly
and 2 incorrectly you would gain 3/20.
The exam CI will check whether your answer is *correctly formatted*. Note that
the CI won’t tell you whether your answer is *correct*. After you finish your
questions you should **commit** your `q-6.csv` file and **push** it to the
server. You should check the CI for any error messages relating to `Q6` and
fix them if they exist.
### Q6.1A [5 Marks] Threads
Given the following Java class:
public class Thready implements Runnable {
int x = 1;
int y = 1;
public void run() {
if (x == 2) x = 0;
else incX();
if (y == 2) y = 0;
public synchronized void incX() {
x = x + 1;
If two separate threads are created for the same instance of `Thready`, which of
the following combinations of values for the fields `x` and `y` are not possible
after both threads have run to completion?
a) `x` = 0, `y` = 3
b) `x` = 2, `y` = 2
c) `x` = 3, `y` = 0
d) `x` = 0, `y` = 2
e) `x` = 0, `y` = 0
### Q6.1B [5 Marks] Threads
Given the following Java class:
public class ThreadTest implements Runnable {
private int x=0;
private int y=0;
public static void main(String [] args) {
ThreadTest obj = new ThreadTest();
(new Thread(obj)).start();
(new Thread(obj)).start();
public void run() {
for (int i=0; i<10; i++) {
System.out.println("x = " +x+"; y = "+y);
What is the output of `ThreadTest` when run?
a) It prints twenty pairs of consecutive numbers, in each case x and y are the same.
b) It prints ten pairs of consecutive numbers, in each case x and y are the same.
c) It prints pairs of numbers, in each case x and y are the same, but the numbers may not be always be in the correct order.
d) It prints pairs of numbers, but the numbers may not be always be in the correct order, and sometimes x and y may differ.
e) It will not compile due to syntax errors in the `main()` method.
### Q6.2A [5 Marks] JavaFX
This question relates to the following small JavaFX program:
public void start(Stage stage) throws Exception {
stage.setTitle("Square");
Group root = new Group();
Scene scene = new Scene(root, 300, 300);
stage.setScene(scene);
Rectangle r = new Rectangle(100, 100, 100, 100);
r.setFill(Color.RED);
stage.show();
Select the option below which best describes the behavior of the program above:
a) It shows a window titled "Square" containing a red square within a white square.
b) It shows a window titled "Stage" containing a white square.
c) It shows a window titled "Square" containing a white square.
d) It does nothing.
### Q6.2B [5 Marks] JavaFX
Consider the following JavaFX application start method:
public void start(Stage stage) throws Exception {
var root = new Group();
var scene = new Scene(root, 100, 100);
var stack = new StackPane();
root.getChildren().add(stack);
var grid = new GridPane();
stack.getChildren().add(grid);
var left = new Group(new javafx.scene.shape.Rectangle(20, 10), new javafx.scene.shape.Circle(10));
grid.add(left, 0, 0);
var right = new Group(new javafx.scene.shape.Rectangle(10, 20), new javafx.scene.shape.Circle(10));
grid.add(right, 1, 0);
stage.setScene(scene);
stage.show();
How many nodes are in the scene graph of the application?
### Q6.2C [5 Marks] JavaFX
This question relates to the following small JavaFX program:
public void start(Stage stage) throws Exception {
stage.setTitle("Hello");
Group root = new Group();
Scene scene = new Scene(root, 300, 300);
stage.setScene(scene);
Text hi = new Text("Hello World!");
hi.setFont(Font.font("Tahoma", FontWeight.NORMAL, 40));
hi.setFill(Color.RED);
hi.setOpacity(1.0);
stage.setOpacity(.25);
root.getChildren().add(hi);
stage.show();
Select the option below which best describes the behavior of the program above:
a) It shows a window titled "Hello" containing red text that says "Hello World!"
b) It shows a faint window titled "Stage" containing red text that says "Hello World!"
c) It shows a transparent window titled "Hello" containing a faint white square.
d) It does nothing.
### Q6.3A [5 Marks] Complexity
Consider the method `f()` below.
static
boolean s;
s = false;
for (var i = 1; i < in.size() - 1; i += 2) {
if (in.get(i).compareTo(in.get(i + 1)) > 0) {
var temp = in.get(i);
in.set(i, in.get(i + 1));
in.set(i + 1, temp);
for (var i = 0; i < in.size() - 1; i += 2) {
if (in.get(i).compareTo(in.get(i + 1)) > 0) {
var temp = in.get(i);
in.set(i, in.get(i + 1));
in.set(i + 1, temp);
} while (s);
Assuming `in.get()` is *O(1)*, which of the following statements is correct?
a) The best-case time complexity of `f()` with `in` of size n is *O(n)*.
b) The worst-case time complexity of `f()` with `in` of size n is *O(n log n)*.
c) The worst-case time complexity of `f()` with `in` of size n is *O(2 n)*.
d) The best-case time complexity of `f()` with `in` of size n is *O(n^2)*.
### Q6.3B [5 Marks] Complexity
Consider the method `silly()` below.
static
for (int i = 0; i < l.size(); i++) {
T v = l.get(0);
for (int j = 1; j < l.size() - i; j++) {
l.set(j-1, l.get(j));
l.set(l.size() - i - 1, v);
Which of the following statements is correct?
a) The time complexity of `silly()` with `in` of size n is *O(n)*.
b) The time complexity of `silly()` with `in` of size n is *O(n log n)*.
c) The time complexity of `silly()` with `in` of size n is *O(2 n)*.
d) The time complexity of `silly()` with `in` of size n is *O(n^2)*.
### Q6.3C [5 Marks] Complexity
Consider the method `foo()` below.
public void foo(int[] l) {
int n = l.length;
for (int i = 0; i < n/3; i++) {
l[i] *= 2;
for (int j = 0; j < n/2; j++) {
l[i] -= 1;
for(int k = 0; k < n-1; k++) {
l[k] = (l[k] + l[j] + l[i]) %n;
Which of the following statements is correct?
a) The time complexity of `foo()` is *O(3n)*.
b) The time complexity of `foo()` is *O(n log n)*.
c) The time complexity of `foo()` is *O(2 n)*.
d) The time complexity of `foo()` is *O(n^3)*.
### Q6.4A [5 Marks] Grammars
This question relates to sentences (statements) in a language defined by a simple EBNF grammar.
For reference, some symbols of EBNF are as follows:
= defines a production rule
, concatenation
| alternation / choice
[...] optional - zero or one
{...} optional - zero or more
(...) group
