Category: Writing

CS143 – Lab 1
Sorted Set
Introduction
A set is an unordered collection of data that contains no duplicates. A sorted list is an ordered collection
of data that is always sorted using the elements’ natural order. A sorted set is a combination of the
above two ADTs having the following attributes:
• The collection is ordered, meaning it maintains the relative order of the elements, and
elements can be accessed by position.
• The collection is sorted, meaning that the order in which the elements are placed is based on a
comparison of the relative value of adjacent elements.
• The elements of the collection are all unique, meaning that no duplicates can be added.
A sorted set contains the following functions:
• add(value) – adds the value to the properly sorted place in the collection and returns the index
where it was added, or returns -1 if not added.
• remove(value) – deletes the value from the collection and returns true if successful, false if not.
• find(value) – reports the current index of a value in the collection, or -1 if not found.
• get(index) – returns the value at the given index
• size() – returns the number of elements currently stored in the collection.
Lab Overview
In the Lab 1 module you are given a NetBeans project that contains the following classes:
• A domain class called Player that represents a single player of an online game and their
personal high score. The class implements Comparable in order to help sort players from
highest score to lowest. It also contains an equals method based on player names to help
prevent duplicate players from being added.
• A data-management class called SortedSet that models the sorted set ADT described above.
(This class currently contains only stubs of methods.)
• A main class called Lab1 used to test the SortedSet.
Your job is to complete the SortedSet class. The following requirements and limitations apply:
• You must use a partially-filled array of Player objects as your underlying data storage.
• You must double the size of the array whenever it becomes too full to add another player, but
not before then.
• You may not use any methods in the Array, Arrays, or System classes to aid in array handling or
convert the array to another type of collection. Instead, write the necessary code based on
simple selection and repetition structures and good computer science logic.
• You must implement the variation of the insertion sort described in the lectures when adding a
value, as this is a very efficient algorithm when adding a single value to an already sorted list.
Attachments:
4084661_1_Lab1Requirements.pdf
4084661_2_Lab1.zip

Write programs with iterators that computes:
• The sum of all even numbers between 2 and 100 (inclusive).
• The sum of all squares between 1 and 100 (inclusive).
• The product of all powers of 2 from 20 up to 220
.
• The product of all odd numbers between a and b (inclusive), where a and
b are inputs. (example, if a = 3, b = 7 then the product of odd numbers
between 3 and 7 is 3 * 5 * 7)
2. Write a program that allows you to play rock, paper, scissors against the computer.
Import the random module to select the computer’s choice.
3. A simple random generator is obtained by the formula rnew = (a×rold+b)%m and
then setting rold to rnew. Write a program that asks the user to enter an initial
value for rold. (Such a value is often called a seed). Then print the first 100 random
integers generated by this formula, using a = 32310901, b = 1729, and m = 224
.
4. In a predator-prey simulation, you compute the populations of predators and prey,
using the following equations:
preyn+1 = preyn × (1 + A – B × predn) (1)
predn+1 = predn × (1 – C + D × preyn) (2)
Here, A is the rate at which prey birth exceeds natural death, B is the rate of
predation, C is the rate at which predator deaths exceed births without food,
and D represents predator increase in the presence of food. Write a program
that prompts users for these rates, the initial population sizes, and the number of
Attachments:
3951600_1_Homework-2.pdf

Assignment Part C: Game Prototype
Overview
For this assessment task you are expected to construct a prototype level/area as a “proof of concept” for the game
that you have designed in Assignment Part B. The prototype should function with proper game logic utilizing selfcreated
and pre-made artistic and programming assets.
Timelines and Expectations
Percentage Value of Task: 25%
Due: 11pm Sunday of Week 11
Minimum time expectation: 25 hours
Learning Outcomes Assessed
The following course learning outcomes are assessed by completing this assessment:
• K5.Identify the appropriate and correct syntax and programming constructs for different game
development requirements.
• S1. Select and apply appropriate games development approaches to solve a real world game design;
• S2. Create a range of assets for a game’s project;
• S4. Use programming constructs to respond to user input and to create object and character behaviours;
• S5. Analyse, design and implement game concepts using structured and basic object orientated
programming concepts;
• S6. Test and debug code to correctly meet game design requirements.
• A1. Operate appropriate software packages to design and build games and interactive media products
that align with client and project expectations;
• A2. Utilise appropriate software environments to develop and integrate code implementations with game
assets.
Attachments:
4072304_1_Game-Design-Document-Bishnu-Kaini-30349769–2-.pdf
4072304_2_ITECH2001-PartC-GamePrototype–2-.pdf