日本欧洲视频一区_国模极品一区二区三区_国产熟女一区二区三区五月婷_亚洲AV成人精品日韩一区18p

COMP2003J代寫、代做Python/Java編程語言

時間:2024-04-17  來源:  作者: 我要糾錯



Assignment 1: AVL & Splay Trees
COMP2003J: Data Structures and Algorithms 2
Weight: 10% of final grade
Document Version: 1.0
Introduction
This assignment is intended to give you experience implementing AVL and
Splay trees. It is also a good exercise to gain experience about how generics,
inheritance and object references work in Java.
Source code that you can start from has been posted to BrightSpace in the file
Assignment1-Source.zip. This also contains the Javadoc API documentation for
the classes that have been provided (in the “doc” folder). Import this project into
Eclipse in the usual way.
Tasks
The main tasks for this assignment are:
• Implement the key methods for an AVL Tree.
• Implement the key methods for a Splay Tree.
• Develop a strategy to test if your implementations are correct.
Implementation of AVL Tree Methods
The source code contains a partial implementation of an AVL Tree in a file
called AVLTree.java in the dsa.impl package. Your work in this section must be
in this class and it must use the interfaces that are provided.
You must implement the following methods:
• public void insert( T value ) – insert a value into the AVL tree.
• public void remove( T value ) – remove a value from the AVL tree.
• public boolean contains(T value) – check to see if a value is contained in
the AVL tree. Returns true if the value is in the tree, or false if not.
• private void restructure( IPosition<T> x ) – trinode restructuring (the three
nodes are x, its parent and its grandparent).
If you wish, you may create other methods that help you to complete the task
(e.g. rightRotate(IPosition<T> n), leftRotate(IPosition<T> n), etc.).
Some hints and tips:
- Remember your AVLTree extends several other classes, so you can
use some of their helpful methods (e.g. expandExternal(…)).
- The expandExternal(…) method uses newPosition(…) to create all
position objects, so all the positions in the tree will be AVLPosition
instances.
- You can cast an IPosition<T> to an AVLPosition in the same way as you
did in previous worksheets.
- Remember every parent/child relationship works in two directions.
Every time you change one of these references, you must change both.
- In the lectures we talk about attaching subtrees. BUT when we program
this, we notice that the subtree structure does not change at all. We just
need to put the root of the subtree in the right place.
- An AVLPosition object has a height attribute. You will need to efficiently
calculate the height of the positions in the tree when the tree changes.
Calculating the heights of all positions every time the tree changes will
be at best O(n). An efficient implementation would be at worst O(h) when
an insert(…) or remove(…) operation is called.
- The TreePrinter class has been provided, so you can print the contents
of your tree and see what it contains.
Implementation of Splay Tree Methods
The source code contains a partial implementation of a Splay Tree in a file
called SplayTree.java in the dsa.impl package. Your work in this section must be
in this class and it must use the interfaces that are provided.
You must implement the following methods:
• private void splay( IPosition<T> p ) – splay a position in the tree.
• public void insert( T value ) – insert a value into the splay tree.
• public void remove( T value ) – remove a value from the splay tree.
• public boolean contains( T value ) – check to see if a value is contained
in the splay tree. Returns true if the value is in the tree, or false if not.
Remember, this method also causes a splay(…) operation.
Testing the Tree Implementations
It is important to check whether your implementations are correct. A good way
to do this is to use your tree to perform some operations, and then check if the
outcome is correct. This is best done using a program, rather than doing it
manually every time.
An example is given in the AVLTreeStructureTest class in the dsa.example
package. This performs some operations (only insert) on an AVL tree. To check
if the final AVL tree is correct, it compares it with a Binary Search Tree that has
the final expected shape (I worked this out manually).
Another example is shown in the AVLTreeSpeedTest class. This performs several
operations on an AVL Tree and measures how quickly it runs. This is a good
way to test the efficiency of your implementation.
Create some test classes for your implementation (called Test1, Test2, etc.).
You can follow these examples or have your own ideas.
In your tests, you should test all the different types of restructuring that are
possible (e.g. for a Splay Tree they should cause zig, zig-zig and zig-zag splays
to both sides, and at the root and deeper in the tree).
Each test class must have a comment to explain the purpose of the test and
what the outcome was.
Submission
• This is an individual programming assignment. Therefore, all code
must be written by yourself. There is some advice below about avoiding
plagiarism in programming assignments.
• All code should be well-formatted and well-commented to describe what
it is trying to do.
• If you write code outside the SplayTree.java, AVLTree.java and test files
(Test1.java, Test2.java, etc.), it will not be noticed when grading. Write
code only in these files.
• Submit a single .zip file to Brightspace.
o This should Include only the files you have written code in. It is
not necessary to submit your entire Eclipse project.
Assignment 1 Grading Rubric
This document shows the grading guidelines for Assignment 1 (implementation of AVL
Trees and Splay Trees). Below are the main criteria that will be applied for the major grades
(A, B, C, etc.). Other aspects will also be taken into account to decide minor grades (i.e.
the difference between B+, B, B-, etc.).
- Readability and organisation of code (including use of appropriate functions,
variable names, helpful comments, etc.).
- Quality of solution (including code efficiency, minor bugs, etc.).
Passing Grades
D Grade
Good implementation of an AVL Tree or Splay Tree, plus some basic testing.
A "good" implementation is one where all the key methods work correctly in the vast
majority of cases (i.e. some occasional bugs will be tolerated).
C Grade
Good implementation of an AVL Tree and a Splay Tree, plus some basic testing of both;
OR
Good implementation of an AVL Tree or a Splay Tree, plus comprehensive testing of the
tree in question.
"Comprehensive" testing should make sure that the different operations of the tree(s) are
all tested (e.g. for a Splay Tree "Zig" operation, it would check both situations where the
node is a left child and where the node is a right child. For a "Zig-Zig" operation, this
should also be tested for both sides, as well as being tested where the splay operation
happens at the root and where it happens deeper in the tree).
B Grade
Excellent implementation of an AVL Tree and a Splay Tree, plus comprehensive testing
of both; OR
Excellent implementation of an AVL Tree and a Splay Tree, with some basic testing and
an efficient approach to height calculation for AVL trees.
A Grade
Excellent implementations of AVL Tree and Splay Tree, with comprehensive testing of
both and an efficient approach to height calculation in AVL Trees.
Failing Grades
ABS/NM Grade
No submission received/no relevant work attempted.
G Grade
Code does not compile; OR
Little or no evidence of meaningful work attempted.
F Grade
Some evidence of work attempted, but few (if any) methods operate in the correct
manner.
E Grade
AVL Tree and/or Splay Tree have been attempted, but there are too many
implementation errors for the implementation to be useful in practice.
Plagiarism in Programming Assignments
• This is an individual assignment, not a group assignment.
• This means that you must submit your own work only.
If you submit somebody else's work and pretend that you wrote it, this
is plagiarism.
• Plagiarism is a very serious academic offence.
Why should you not plagiarise?
• You don't learn anything!
• It is unfair to other students who work hard to write their own solutions.
• It's cheating! There are very serious punishments for students who
plagiarise. The UCD policy on plagiarism can be found online1.
- A student found to have plagiarised can be exclude from their
programme and not allowed to graduate.
Asking for Help
If you find things difficult, help is available.
• TAs are available during lab times.
• You can post questions in the Brightspace discussion forum or our
Wechat group.
• You can email the head TA (dairui.liu@ucdconnect.ie).
• You can get help from your classmates.
**Getting help to understand something is not the same as copying a
solution! **
The best way to get useful answers is to ask good questions.
Don't just send a photo of your computer screen and ask "Why does this not
work?".
Do:
• Send your Java file(s) as an attachment. We can't run code that's in a
photograph to test it out!
• Say what error message you got when you tried to run the code (if
any).
• Say what the code did that you did not expect.
• Say what the code did not do that you did expect.
1 https://www.ucd.ie/t4cms/UCD%20Plagiarism%20Policy%20and%20Procedures.pdf
How to avoid plagiarism: Helping without copying.
If you are trying to help a classmate with a programming assignment, there
are two golden rules:
Never, ever give your code to somebody else.
• You don't know what they will do with it or who they will give it to.
• If somebody else submits code that is the same as yours, you will be
in trouble too.
Don't touch their keyboard (this advice is more relevant when we are in labs together)
• Don't type solutions for them! It will end up looking a lot like your code.
Also, they don't learn anything.
Here are some other ways you can help a friend with an assignment, without
risking plagiarism:
• If their code doesn't work, it's OK to explain what is wrong with it.
• If they don't understand a concept, draw a diagram to explain.
• Tell them about useful methods that I have provided that can help
achieve their goals.
• Describe an algorithm that will help.
• Describe it in words or diagrams, not in code!
• E.g. "You could try saving the node's right child as a variable.
Then you could use a loop to keep getting that node's left child
until you reach the bottom of the tree". 
請加QQ:99515681  郵箱:99515681@qq.com   WX:codinghelp













 

標簽:

掃一掃在手機打開當前頁
  • 上一篇:CIT 594代做、代寫Python設(shè)計編程
  • 下一篇:CS 2550代做、SQL程序語言代寫
  • 無相關(guān)信息
    昆明生活資訊

    昆明圖文信息
    蝴蝶泉(4A)-大理旅游
    蝴蝶泉(4A)-大理旅游
    油炸竹蟲
    油炸竹蟲
    酸筍煮魚(雞)
    酸筍煮魚(雞)
    竹筒飯
    竹筒飯
    香茅草烤魚
    香茅草烤魚
    檸檬烤魚
    檸檬烤魚
    昆明西山國家級風(fēng)景名勝區(qū)
    昆明西山國家級風(fēng)景名勝區(qū)
    昆明旅游索道攻略
    昆明旅游索道攻略
  • NBA直播 短信驗證碼平臺 幣安官網(wǎng)下載 歐冠直播 WPS下載

    關(guān)于我們 | 打賞支持 | 廣告服務(wù) | 聯(lián)系我們 | 網(wǎng)站地圖 | 免責(zé)聲明 | 幫助中心 | 友情鏈接 |

    Copyright © 2025 kmw.cc Inc. All Rights Reserved. 昆明網(wǎng) 版權(quán)所有
    ICP備06013414號-3 公安備 42010502001045

    日本欧洲视频一区_国模极品一区二区三区_国产熟女一区二区三区五月婷_亚洲AV成人精品日韩一区18p

              亚洲人在线视频| 一区二区三区欧美成人| 久久精品91| 在线观看欧美一区| 欧美激情va永久在线播放| 在线一区欧美| 国产永久精品大片wwwapp| 快播亚洲色图| 亚洲欧美日韩国产综合| 在线成人激情| 国产精品久久9| 欧美高清视频www夜色资源网| 日韩一本二本av| 在线观看一区二区精品视频| 久久久水蜜桃| 午夜在线视频一区二区区别| 亚洲精品欧美日韩| 黄色欧美成人| 国内精品久久久久久影视8| 欧美日韩视频不卡| 蜜臀av性久久久久蜜臀aⅴ四虎| 亚洲男人第一网站| 亚洲图片自拍偷拍| 一区二区三区四区五区在线| 亚洲精品一级| 99精品国产在热久久下载| 亚洲国产成人久久| 亚洲国产另类久久久精品极度| 国内偷自视频区视频综合| 国产精品久久久久久久免费软件| 欧美激情精品久久久久久久变态 | 久久久噜久噜久久综合| 午夜欧美理论片| 久久aⅴ国产紧身牛仔裤| 欧美一级免费视频| 久久亚洲综合色一区二区三区| 欧美在线一区二区三区| 久久人人九九| 欧美日韩国产精品成人| 欧美日韩国产成人精品| 国产美女精品| 亚洲精品日产精品乱码不卡| 亚洲一区3d动漫同人无遮挡| 亚洲欧美一区二区三区极速播放 | 国产精品亚洲а∨天堂免在线| 国产精品盗摄久久久| 精品不卡一区| 一区二区三区日韩精品| 久久婷婷丁香| 国产精品乱码| 中国女人久久久| 久久偷看各类wc女厕嘘嘘偷窃| 国产精品播放| 一区二区三区日韩| 欧美成人午夜激情| 黄色亚洲精品| 久久人人爽人人爽爽久久| 国产精品久久国产精麻豆99网站| 亚洲国产精品一区制服丝袜| 欧美在线免费观看视频| 欧美人与禽猛交乱配视频| 亚洲欧洲精品一区二区三区波多野1战4| 亚洲影院色无极综合| 国产精品高清免费在线观看| 日韩亚洲欧美成人| 欧美视频一区二区三区…| 一区二区三区www| 国产精品一区二区视频| 欧美一区二区三区电影在线观看 | 性色av一区二区三区在线观看| 欧美日韩精品一区二区在线播放| 在线中文字幕一区| 欧美视频一区| 免费看亚洲片| 亚洲午夜一级| 最新高清无码专区| 欧美性开放视频| 免费成人网www| 亚洲欧美三级伦理| 亚洲精品国产精品国自产观看浪潮| 久久婷婷影院| 性做久久久久久久免费看| 亚洲第一在线视频| 国产精品实拍| 欧美日韩三级| 欧美电影免费观看高清完整版| 亚洲午夜未删减在线观看| 亚洲第一黄网| 国产亚洲福利社区一区| 欧美极品欧美精品欧美视频| 久久免费观看视频| 午夜精品久久久久久久蜜桃app| 亚洲国产精彩中文乱码av在线播放| 欧美性大战久久久久久久蜜臀| 国产精品成人一区二区艾草| 亚洲男女自偷自拍| 亚洲一区二区三区精品在线观看| 亚洲电影激情视频网站| 亚洲国产高清视频| 亚洲电影在线| 日韩午夜av在线| 亚洲在线网站| 久久久国产午夜精品| 久久久综合精品| 欧美国产精品人人做人人爱| 欧美极品在线观看| 国产精品久久久久久久电影| 国产精品入口66mio| 国产综合视频在线观看| 在线精品视频免费观看 | 欧美一区二区三区四区在线观看| 亚洲婷婷综合色高清在线| 日韩视频一区二区在线观看| 亚洲一区免费| 狂野欧美性猛交xxxx巴西| 欧美成人a视频| 欧美日韩亚洲一区三区| 国产亚洲视频在线观看| 一区二区日韩欧美| 欧美在线精品免播放器视频| 欧美日韩免费高清一区色橹橹| 国产视频在线观看一区| 亚洲欧洲日本mm| 亚洲欧美国产另类| 一本色道久久综合狠狠躁篇的优点 | 欧美激情一区二区三区在线视频观看 | 欧美人牲a欧美精品| 欧美在线观看视频在线| 一本色道久久综合亚洲二区三区| 国产日韩精品一区二区浪潮av| 久久资源在线| 久久九九热免费视频| 亚洲免费人成在线视频观看| 亚洲精品乱码久久久久久| 韩国一区电影| 国产欧美日韩亚洲精品| 国产精品久久看| 欧美午夜在线视频| 国产精品大片| 国产精品毛片a∨一区二区三区|国| 另类欧美日韩国产在线| 美日韩在线观看| 欧美日韩精品免费看 | 欧美69视频| 欧美国产视频日韩| 欧美日韩亚洲高清| 国产精品卡一卡二| 韩国一区二区三区在线观看 | 国产精品爱久久久久久久| 欧美视频一区二区| 国产网站欧美日韩免费精品在线观看 | 一区二区欧美日韩| 亚洲综合国产激情另类一区| 欧美亚洲免费高清在线观看| 久久黄金**| 欧美区一区二| 欧美日韩国产成人在线91| 日韩视频在线永久播放| 亚洲日韩欧美视频| 亚洲一级黄色片| 欧美一区二区三区视频免费| 久久久噜噜噜久久中文字幕色伊伊| 久久精品国产成人| 国产精品久久久久久久久免费樱桃| 国产午夜精品理论片a级探花| 在线免费观看欧美| 久久福利影视| 欧美日韩国产首页在线观看| 国产欧美在线播放| 在线观看日韩av电影| 亚洲欧美精品| 可以看av的网站久久看| 国产欧美日韩一区二区三区在线| 亚洲精品欧洲| 欧美激情精品久久久| 亚洲电影在线看| 久久综合给合久久狠狠色| 国产精品久久网站| 亚洲一区二区三区国产| 欧美精品日韩一区| 亚洲一区三区视频在线观看| 欧美日韩黄色大片| 日韩视频一区二区三区在线播放 | 精品二区视频| 欧美在线999| 国外成人免费视频| 欧美fxxxxxx另类| 激情五月综合色婷婷一区二区| 久久99在线观看| 国内精品视频666| 欧美电影免费观看| 亚洲美女av网站| 国产欧美精品va在线观看| 中国成人在线视频| 在线日韩欧美视频| 美女性感视频久久久| 亚洲视频 欧洲视频| 国产欧美日韩不卡| 欧美成人蜜桃| 亚洲一区3d动漫同人无遮挡|