日本欧洲视频一区_国模极品一区二区三区_国产熟女一区二区三区五月婷_亚洲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

              欧美日韩一区二区在线视频| 欧美日本一道本在线视频| 亚洲男人av电影| 一区二区三区久久| 夜夜嗨av一区二区三区| 亚洲精品小视频在线观看| 亚洲精品午夜| 亚洲免费福利视频| 在线综合亚洲欧美在线视频| 99国产精品久久久久久久久久| 亚洲乱码久久| 亚洲在线中文字幕| 欧美影院在线| 久久久一区二区三区| 欧美国产日韩一区二区在线观看| 国产精品高清网站| 国产亚洲欧洲997久久综合| 亚洲国产精品一区制服丝袜| 日韩视频永久免费观看| 亚洲综合日韩在线| 欧美成人首页| 国产精品入口福利| 亚洲黄色三级| 欧美一级大片在线观看| 欧美精品一区二区三区一线天视频 | 亚洲午夜电影网| 久久亚洲高清| 国产精品你懂的在线欣赏| 1024欧美极品| 欧美一二三区精品| 欧美女同在线视频| 国产一区二区三区在线播放免费观看| 亚洲黄色一区二区三区| 午夜精品影院| 欧美四级剧情无删版影片| 伊人久久av导航| 亚洲欧美日韩成人高清在线一区| 免费观看日韩| 精品51国产黑色丝袜高跟鞋| 亚洲永久网站| 欧美三区美女| 亚洲片在线观看| 久久久久一区二区三区| 国产精品视频xxx| 一区二区不卡在线视频 午夜欧美不卡'| 久久精品视频在线| 国产日韩av高清| 亚洲免费中文| 国产精品国产三级国产普通话99| 亚洲伦理在线| 欧美好吊妞视频| 亚洲国产欧美一区| 欧美a级片一区| 亚洲风情亚aⅴ在线发布| 久久精品人人做人人综合| 国产伦精品一区二区三| 亚洲欧美日韩国产综合精品二区| 欧美日韩在线精品| 亚洲一区欧美二区| 国产精品久久久999| 亚洲午夜视频在线观看| 国产精品分类| 午夜精品美女自拍福到在线 | 欧美日韩不卡在线| 亚洲美女黄网| 欧美人成在线视频| 中文久久精品| 国产精品一区二区三区四区 | 国产精品蜜臀在线观看| 亚洲欧美国产va在线影院| 国产精品久久久久久影院8一贰佰| 日韩一级片网址| 欧美体内she精视频| 亚洲自拍另类| 国产日韩欧美成人| 久久精品亚洲一区二区| 亚洲国产精品v| 欧美日韩一区二区三区视频| 午夜精品福利视频| 黑人巨大精品欧美一区二区小视频 | 国产午夜亚洲精品理论片色戒| 欧美在线亚洲在线| 狠狠爱成人网| 欧美激情综合五月色丁香| 亚洲视频网在线直播| 国产欧美一区二区精品婷婷| 久久蜜桃精品| 日韩视频一区二区三区在线播放| 欧美午夜精品久久久久免费视| 欧美一区二区三区视频免费播放 | 在线看片日韩| 国产精品黄视频| 欧美一区=区| 亚洲日韩第九十九页| 国产精品久久国产三级国电话系列 | 亚洲日韩视频| 国产精品久久久久一区二区三区 | 亚洲自拍偷拍麻豆| 亚洲黄色在线观看| 国产精品大全| 欧美精品xxxxbbbb| 久久国产精品99国产精| 一本色道久久88综合亚洲精品ⅰ| 国产日产亚洲精品系列| 欧美激情综合五月色丁香| 久久久国产精品亚洲一区| 一区二区av在线| 又紧又大又爽精品一区二区| 国产精品久久久久久久app| 蜜桃av综合| 欧美影院成年免费版| 亚洲最黄网站| 91久久精品日日躁夜夜躁国产| 国产精品视频免费一区| 欧美啪啪一区| 欧美成黄导航| 久久久久五月天| 午夜精品久久久99热福利| 亚洲经典自拍| 在线观看成人av| 国产欧美在线观看一区| 欧美视频中文一区二区三区在线观看 | 欧美日韩不卡| 女主播福利一区| 久久综合激情| 久久精品人人做人人爽| 亚洲欧美日韩区| 亚洲女女做受ⅹxx高潮| 在线亚洲+欧美+日本专区| 亚洲精品美女91| 亚洲精品永久免费精品| 亚洲激情偷拍| 亚洲高清在线播放| 亚洲国产你懂的| 亚洲人在线视频| 夜夜嗨一区二区| 一本色道久久88综合亚洲精品ⅰ| 亚洲美女毛片| 亚洲天堂av图片| 亚洲一二三四区| 欧美一区二区三区四区在线观看| 午夜欧美大尺度福利影院在线看 | 亚洲精品网址在线观看| 亚洲精品1区| 99视频一区二区| 亚洲一区二区三| 欧美一区国产一区| 久久av资源网| 女女同性精品视频| 欧美精品一区在线播放| 欧美精品18+| 国产精品爱啪在线线免费观看| 国产精品久久97| 国产亚洲免费的视频看| 亚洲电影免费观看高清完整版在线| 在线观看欧美| 99精品欧美一区二区三区综合在线| 99精品视频免费观看视频| 亚洲尤物精选| 久久久久天天天天| 欧美日韩伦理在线| 国产日韩精品综合网站| 精品动漫一区| 宅男66日本亚洲欧美视频| 午夜在线a亚洲v天堂网2018| 久久久久久网址| 欧美日韩a区| 国产日产欧产精品推荐色 | 国产精品一区=区| 亚洲国产成人av| 亚洲一区二区三区精品在线观看 | 欧美日韩高清一区| 国产欧美一区二区精品性色| 亚洲国产精品传媒在线观看 | 久久精品久久99精品久久| 欧美凹凸一区二区三区视频| 国产精品高清网站| 永久免费毛片在线播放不卡| 9l国产精品久久久久麻豆| 久久久久欧美精品| 国产精品久久久99| 亚洲国产欧美日韩另类综合| 亚洲欧美激情视频| 欧美激情第9页| 黑丝一区二区| 午夜视频久久久久久| 欧美日韩国产限制| 在线免费观看一区二区三区| 午夜精品久久久久久久久| 欧美精品在线看| 在线观看亚洲| 欧美亚洲视频| 国产精品高清网站| 亚洲激情视频网| 久久精品视频在线播放| 国产精品久久久久9999| 亚洲激情视频在线| 久久久久一区| 好吊妞这里只有精品| 小处雏高清一区二区三区|