INFO1113留学生代做、Java设计代做、代写store database、Java程序语言调试

日期：2019-09-15 10:25

INFO1113 Assignment 1

Due: September 22nd, 11:59PM AEST

This assignment is worth 6% of your final assessment

Task Description

In this assignment we will develop a key value store database called CrunchDB in the Java programming

language using dynamic data structures. All entries to the database contain a unique key which

will map to a set of values. Each entry of the database is identified by a unique key string and contains

a dynamically sized list of integer values.

You are encouraged to ask questions on Ed using the assignments category. As with any assignment,

make sure that your work is your own, and you do not share your code or solutions with other students.

Working on your assignment

You can work on this assignment on your own computer or the lab machines. It is important that you

continually back up your assignment files onto your own machine, external drives, and in the cloud.

You are encouraged to submit your assignment on Ed while you are in the process of completing it.

By submitting you will obtain some feedback of your progress on the sample test cases provided.

1

INFO1113

Implementation details

Write a program in Java that implements CrunchDB as shown in the examples below. You can assume

that our test cases will contain only valid input commands and not cause any integer overflows. Keys

are case sensitive and do not contain spaces. Commands are case insensitive.

Entry values are indexed from 1. Snapshots are indexed from 1 and are unique for the lifetime of the

program. Keys, entries and snapshots are to be outputted in the order from most recently added to

least recently added. Snapshots can be archived in a human-readable text file, storing all entries in the

following form

<entry_key>|[<entries>,...]}

Example

a|1,2,3,4

b|3,4,5

c|9,6,1,2,0,3

Archived snapshots can be restored by CrunchDB, resetting the data to the archived snapshot’s state.

Your program can be contained in the provided scaffold of CrunchDB.java, Snapshot.java

and Entry.java. Do not modify any of the existing method signatures in these files. Your program

must produce no errors when built and run on the lab machines and Ed. Your program will read from

standard input and write to standard output.

Your program output must match the exact output format shown in the examples and on Ed. You

are encouraged to submit your assignment while you are working on it, so you can obtain some

feedback. You have been provided simple skeleton classes and hints on how to implement your

snapshot database.

In order to obtain full marks, your program will be checked against automatic test cases, manually

inspected by your tutors and you must submit a set of test cases that ensure you have implemented

functionality correctly.

Page 2 of 10

INFO1113

Commands

Your program should implement the following commands, look at the examples to see how they work.

? If a <key> does not exist in the current state, output: no such key

? If a <snapshot> does not exist in the database, output: no such snapshot

? If an <index> does not exist in an entry, output: index out of range

BYE clear database and exit

HELP display this help message

LIST KEYS displays all keys in current state

LIST ENTRIES displays all entries in current state

LIST SNAPSHOTS displays all snapshots in the database

GET <key> displays entry values

DEL <key> deletes entry from current state

PURGE <key> deletes entry from current state and snapshots

SET <key> <value ...> sets entry values

PUSH <key> <value ...> pushes values to the front

APPEND <key> <value ...> appends values to the back

PICK <key> <index> displays value at index

PLUCK <key> <index> displays and removes value at index

POP <key> displays and removes the front value

DROP <id> deletes snapshot

ROLLBACK <id> restores to snapshot and deletes newer snapshots

CHECKOUT <id> replaces current state with a copy of snapshot

SNAPSHOT saves the current state as a snapshot

ARCHIVE <id> <filename> saves snapshot to file

RESTORE <filename> loads and restores snapshot from file

MIN <key> displays minimum value

MAX <key> displays maximum value

SUM <key> displays sum of values

LEN <key> displays number of values

REV <key> reverses order of values

UNIQ <key> removes repeated adjacent values

SORT <key> sorts values in ascending order

DIFF <key> <key ...> displays set difference of values in keys

INTER <key> <key ...> displays set intersection of values in keys

UNION <key> <key ...> displays set union of values in keys

CARTPROD <key> <key ...> displays cartesian product of sets

> BYE

Writing your own testcases

We have provided you with some test cases but these do not not test all the functionality described in

the assignment. It is important that you thoroughly test your code by writing your own test cases.

You should place all of your test cases in the tests/ directory. Ensure that each test case has the .in

input file along with a corresponding .out output file. We require that the names of your test cases are

descriptive so that you know what each is testing, e.g. get-set.in and sort-uniq.in and we

can accurately and quickly assess your test cases.

Submission Details

Final deliverable for the correctness and manual inspection will be due on the 22nd of September

2019.

You must submit your code and tests using the assignment page on Ed. To submit, simply place your

files and folders into the workspace, click run to check your program works and then click submit.

You are encouraged to submit multiple times, but only your last submission will be considered.

Marking

You will only be given valid inputs as part of the automatic test suite. Your program will be checked

for errors that a user can possibly make. In addition, we will mark your program against a substantial

collection of hidden test cases.

3 marks are assigned based on automatic tests for the correctness of your program. This component

will use hidden test cases that cover every aspect of the specification. Your program must match the

exact output in the examples and the test cases on Ed. Test cases will be released progressively, the

final set of public test cases will be released prior to 17th of September.

3 marks are assigned based on a manual inspection of the style (1 mark) and tests cases (2 marks).

Make sure that you carefully follow the assignment specifications and thoroughly test your code,

optimising for coverage and testing for a variety of input ranges.

Page 9 of 10

INFO1113

Academic declaration

By submitting this assignment you declare the following:

I declare that I have read and understood the University of Sydney Student Plagiarism: Coursework Policy and Procedure, and except where specifically

acknowledged, the work contained in this assignment/project is my own work, and has not been copied from other sources or been previously submitted

for award or assessment.

I understand that failure to comply with the Student Plagiarism: Coursework Policy and Procedure can lead to severe penalties as outlined under

Chapter 8 of the University of Sydney By-Law 1999 (as amended). These penalties may be imposed in cases where any significant portion of my

submitted work has been copied without proper acknowledgment from other sources, including published works, the Internet, existing programs, the

work of other students, or work previously submitted for other awards or assessments.

I realise that I may be asked to identify those portions of the work contributed by me and required to demonstrate my knowledge of the relevant material

by answering oral questions or by undertaking supplementary work, either written or in the laboratory, in order to arrive at the final assessment mark.

I acknowledge that the School of Computer Science, in assessing this assignment, may reproduce it entirely, may provide a copy to another member of

faculty, and/or communicate a copy of this assignment to a plagiarism checking service or in-house computer program, and that a copy of the assignment

may be maintained by the service or the School of Computer Science for the purpose of future plagiarism checking.

Page 10 of 10