Suoritettu

data structure ''IntArrayBag''+linked list implementation +A decision tree+graphical user interface

**Task 1 An AWT in Java (10 marks)**

Create an abstract data structure called IntArrayBag, closely following the B242 lecture

notes and specification given for the said data type.

Create a test program that will test your IntArrayBag properly and according to the

discussion conducted in the lectures.

Properly comment your program with Javadoc comments and generate associated

Javadoc HTML files.

**Task 2 A linked list implementation (10 marks)**

Create a program that will generate a linked list of objects in Java. Your program must

allow for the creation, deletion of the list, insertion and deletion of elements in the list.

A program that will allow the testing of your linked list implementation must be created.

Your code must me again properly documented as to produce Javadoc HTML pages.

**Task 3 A decision tree (50 marks)**

**Task 3a.**

Write the core of a Java program that plays a guessing game, which uses a binary tree

that stores information about a collection of places. Each leaf in the binary tree contains

the name of a monument/attraction/museum etc and each non-leaf node contains a

question about the place. You start at the root and ask the question that is written there. If

the answer is “Yes??, you move to the left child, and if the answer is “No??, you move to

the right child. Eventually, you will reach a leaf, and the name at the leaf tells you the

place you have been guessing ??" or at least it does if the place is one of the places the tree

knows about. If it isn’t, then the program could ask the player to enter a question, which

will help to distinguish the place he/she was thinking about from the one that is currently

in the leaf node. As you keep playing, your tree grows and you end up with a large binary

tree.

See attached file please

## Deliverables

**Task 1 An AWT in Java (10 marks)**

Create an abstract data structure called IntArrayBag, closely following the B242 lecture

notes and specification given for the said data type.

Create a test program that will test your IntArrayBag properly and according to the

discussion conducted in the lectures.

Properly comment your program with Javadoc comments and generate associated

Javadoc HTML files.

**Task 2 A linked list implementation (10 marks)**

Create a program that will generate a linked list of objects in Java. Your program must

allow for the creation, deletion of the list, insertion and deletion of elements in the list.

A program that will allow the testing of your linked list implementation must be created.

Your code must me again properly documented as to produce Javadoc HTML pages.

**Task 3 A decision tree (50 marks)**

**Task 3a.**

Write the core of a Java program that plays a guessing game, which uses a binary tree

that stores information about a collection of places. Each leaf in the binary tree contains

the name of a monument/attraction/museum etc and each non-leaf node contains a

question about the place. You start at the root and ask the question that is written there. If

the answer is “Yes??, you move to the left child, and if the answer is “No??, you move to

the right child. Eventually, you will reach a leaf, and the name at the leaf tells you the

place you have been guessing ??" or at least it does if the place is one of the places the tree

knows about. If it isn’t, then the program could ask the player to enter a question, which

will help to distinguish the place he/she was thinking about from the one that is currently

in the leaf node. As you keep playing, your tree grows and you end up with a large binary

tree.

Additionally, your initial knowledge tree can be obtained by reading information from a

file. When the program ends, the knowledge tree at that point is written to the same file.

**Task 3b.**

The program should be bound with a graphical user interface that will allow the user /

player to view the tree unfold as the game is being played. The nodes and the leaf nodes

should be clearly drawn and lines connecting the nodes should be generated.

The program should be able to accommodate trees that extend further than the available

space on the screen.**This will carry additional marks.**

**Again you must produce proper documentation for your program, so that javadoc**

**HTML files can be created and produced with this work.**

**You DO NOT have to produce a logbook for this assignment.**

Your report should include,

Printouts of your programs

A printout of any test data, and clear mention of your reasons for choosing the particular

test data.

Printouts of screen captures showing the graphical user interface for Task3.

The report should also include an electronic version of your code in un-compiled form,

along with particular instructions of how to compile it.

Pre-compiled versions may be included but in a different directory.

## Platform

Windows XP,Linux

Taidot: tekniikka, Java, Javascript, MySQL, PHP, tietojärjestelmäarkkitehtuuri, Ohjelmistojen testaus

Näytä lisää: yes in binary, windows 7 knowledge test, uses of tree data structure, uses of data structure, uses of binary trees, uses of binary, user specification, user interface specification, type of data structure in c, type of data structure, type of binary tree, tree structure in c, trees structure, trees in java data structure, trees in data structure notes, trees in data structure in c, trees in data structure, trees data structure in c, trees data structure, tree program in data structure

Tietoa työnantajasta:
( 4 arvostelua ) United Kingdom

Projektin tunnus: #3668048

Myönnetty käyttäjälle:

bogdanstan

See private message.

$85 USD 30 päivässä
(193 Arvostelua)
5.7

15 freelanceria on tarjonnut keskimäärin 69$ tähän työhön

ibapi

See private message.

$85 USD 30 päivässä
(104 arvostelua)
6.5
eothman

See private message.

$85 USD 30 päivässä
(76 arvostelua)
5.8
cata77

See private message.

$51 USD 30 päivässä
(123 arvostelua)
5.1
VetradSystems

See private message.

$76.5 USD 30 päivässä
(29 arvostelua)
4.5
usmannaveedvw

See private message.

$21.25 USD 30 päivässä
(46 arvostelua)
4.1
hazzzard

See private message.

$17 USD 30 päivässä
(7 arvostelua)
3.2
momer

See private message.

$51 USD 30 päivässä
(15 arvostelua)
3.2
mikevandelay

See private message.

$340 USD 30 päivässä
(6 arvostelua)
2.5
i3brainsvw

See private message.

$68 USD 30 päivässä
(1 arvostelu)
1.9
cetcoder

See private message.

$25.5 USD 30 päivässä
(10 arvostelua)
1.7
vw1212371vw

See private message.

$40.8 USD 30 päivässä
(4 arvostelua)
1.5
lana777vw

See private message.

$34 USD 30 päivässä
(3 arvostelua)
0.5
aesthetevw

See private message.

$8.5 USD 30 päivässä
(2 arvostelua)
0.4
umer2007

See private message.

$42.5 USD 30 päivässä
(0 arvostelua)
0.0