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

代做SEHH2239、Python程序語言代寫

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



SEHH2239 Data Structures
SEHH2239 – Assignment 2 Page 1 of 7
Assignment 2 (Individual Assignment)
Due Date
19 April 2024 17:00 (Friday)
Late submission is liable to a penalty of 10% of the available marks for each day late; Saturdays, Sundays
and holidays are counted. Submission after 24 April 2024 17:00 will not be accepted.
Declaration of Original Work
Plagiarism is a serious misconduct. No part of students’ assignment should be taken from other people’s
work without giving them credit. All references must be clearly cited. Any plagiarism found in students’
completed assignments can lead to disciplinary actions such as mark deduction, disqualification or even
expulsion by the College.
In principle, CPCE considers GenAI tools as positive and creative forces in education and encourages their
use in learning, teaching, and assessment. However, extensive copy-pasting from AI-generated content
without citation is considered plagiarism.
By submitting this assignment to the subject lecturer through Blackboard, you hereby declare that the work
in this assignment is completely your own work. No part of this assignment is taken from other people’s
work without giving them credit. All references have been clearly cited.
You understand that an infringement of this declaration leaves you subject to disciplinary actions such as
mark deduction, disqualification or even expulsion by the College.
Plagiarism will be penalized severely. Marks will be deducted for assignments that are plagiarized in whole
or in part, regardless of the sources.
SEHH2239 Data Structures
SEHH2239 – Assignment 2 Page 2 of 7
Instruction
You are required to submit a Python Notebook using the template provided (Assign_2_Template.ipynb)
showing all the answers and programs. Rename the file as instructed below.
Your Python Notebook file should contain your name, your student ID no, and class (201/202/203/204).
All submitted assessments will be evaluated with Python version 3.10 or above (the current python version
used in Google Colab). Your submitted assessments must run without errors on Google Colab. Code that
cannot execute will result in zero or low marks for the respective questions. When you finish the
assignment, you are advised to use the “Restart session and run all” functionality of Colab to check
whether all code can execute successfully.
Unless otherwise instructed, you MUST NOT import any modules in your submitted assessments.
You MUST NOT change the procedure name (include cases) and parameters required.
Items to be Submitted
1. Python Notebook: Rename the notebook to the format <name>_<student ID>_<class>.ipynb, e.g.,
ChanTaiMan_22001234A_201.ipynb.
To download the Python Notebook (.ipynb)
In Google Colab, File → Download → Download .ipynb
To submit the Notebook via Blackboard
Upon uploading the notebook to the submission page in Blackboard, make sure that you click the “Submit”
button, not “Save and Close”.
To validate the submitted file
After you have submitted the notebook to Blackboard, download the submitted notebook from Blackboard
and upload it back onto Colab to check that your submitted file can still run in Colab. To do so, in
Blackboard, go to the assignment submission page, click on “View Submission”, download the ipynb file,
and upload it to Colab for checking. (Some students have done the assignment properly, but submitted some
junk code onto Blackboard, due to mistakes in downloading from Colab and uploading to Blackboard.)
Attention:
While submitting the softcopies via Blackboard, a timestamp will be placed on the softcopies of your
assignment. There will be a sharp cut-off time at Blackboard, so late assignments will be recorded at
Blackboard. Softcopies submitted via email or other means will NOT be accepted unless the Blackboard is
not available. As many students will submit their assignments to Blackboard at around the deadline time, it
normally takes longer for uploading your assignment, so it is strongly suggested that you start submitting
earlier, say at least 45 minutes before the deadline. Marks will be deducted for late submission.
SEHH2239 Data Structures
SEHH2239 – Assignment 2 Page 3 of 7
Question 1
A linear queue is a linear data structures having two ends i.e. the front end and the rear end. The
operations in a queue are carried out in First In, First Out (FIFO) order. This means, we can only
add items to the rear end of the queue and delete items from its front end. Implementing a linear
queue in array brings the drawback of memory wastage. When the rear pointer reaches the end of
a queue, there might be a possibility that after a certain number of dequeue() operations, it will
create an empty space at the start of a queue.
To overcome this limitation, experts introduced the concept of circular queue. A circular queue,
or a Ring Buffer, is an extended version of a linear queue as it follows the FIFO principle with the
exception that it connects the last node of a queue to its first by forming a circular link.
Array implementation of linear queue or circular queue has another limitation that the size of the
queue is bounded by the underlying array. When a queue is full, no additional element can be
added.
In question 1, you are going to implement a circular queue in Python list that will automatically
double its capacity when it is full.
(a) Complete the class AutoGrowthCircularQueue and implement the methods:
isEmpty(), getFrontElement(), getRearElement(), enqueue(), and
dequeue() according to the comment described in the Assignment Template.
(b) Run the testing code provided in the Assignment Template. It should produce the following
outputs (excluding the line numbers). Do not alter the testing code.
SEHH2239 Data Structures
SEHH2239 – Assignment 2 Page 4 of 7
1. Is Empty: True
2. Is Empty: False
3. Get: 2
4. Is Empty: True
5. Front element: 3
6. Rear element: 1
7. Queue size: 5/8
8. 3
9. String node 4
10. 1
11. 5
12. 6
Question 2
In Question 2, you will build a data structure for storing information of a student and learn how to
validate an input data against a predefined pattern.
(a) Write a class Student with the following specification:
1) The constructor takes two inputs: name (type str) and studentid (type str).
Validate their types. Raise an error and stop the program if the input type is invalid.
2) Validate the input studentid using the Boolean value “re.fullmatch('[0-
9]{8}A', studentid) is None” (a True value designates a mismatch). It
checks whether the input has 8 digits followed by the character 'A'. You need to import
the re library. Raise an error and stop the program if the input is invalid.
3) Initialize an instance attribute name to the input name.
4) Initialize an instance attribute studentid to the input studentid.
5) Overload the __str__() method to facilitate the printing with print(). See lines 2
& 3 of the outputs below for the required format.
6) Overload the __eq__() method to facilitate the comparison of Student objects.
Students with the same studentid attributes are deemed equal.
(b) Run the testing code provided in the Assignment Template. It should produce the following
outputs (excluding the line numbers). Do not alter the testing code.
1. Invalid student id 2224564
2. Name: Calvin Weign, ID: 22123456A
3. Name: Cola Coke, ID: 22003276A
4. False
5. True
6. Invalid data type!
SEHH2239 Data Structures
SEHH2239 – Assignment 2 Page 5 of 7
Question 3
In question 3, you will construct a Class Course to hold information about a course, registered
students, and students in waiting queue in case if the course was full. You will need to use the class
constructed in question 1 and 2.
(a) Complete the class constructor with the instructions below:
1) The constructor takes three inputs: code (type str), title (type str), and size
(type int). Validate their types. Raise an error and stop the program if the input type is
invalid.
2) Validate the input code using the Boolean value “re.fullmatch('[A-Z]{4}[0-
9]{4}', code) is None” (a True value designates a mismatch). The code should
starts with 4 upper case letters, then followed by 4 digits. Raise an error and stop the
program if the input type is invalid.
3) Initialize an instance attribute code to the input code.
4) Initialize an instance attribute title to the input title.
5) Initialize an instance attribute maxSize to the input size.
6) Initialize an instance attribute size to 0, i.e. the course contains no students at the
beginning.
7) Initialize an instance attribute BST to None. Binary search tree (BST) is used to stores
the registered students.
8) Initialize an instance attribute queue to an AutoGrowthCircularQueue. This
attribute is used to store students waiting for registration when course is full.
(b) Override __eq__() method to facilitate the comparison of Course objects. Courses with
the same code attributes are deemed equal.
(c) Write a method addStudent() with the specifications below:
1) Take one input student (type Student). Validate its type. Raise an error and stop
the program if the input type is invalid.
2) Print a message if the student was already registered, i.e. the student is in the BST
attribute and end the method. See line 11 below for the required format of the message.
3) If the course is not full, insert the student into the BST as the data field of a
BSTNode (the class BSTNode is provided in the Assignment Template; do not change
the code of the BSTNode class and do not use other implementations of BSTs). The key
field of the BSTNode is the studentid of the student. Increment the size attribute
and print a message for successful registration. See line 8 for the required format of the
message.
4) If the course is full, put the student into the queue attribute and print a message for
putting the student into waiting queue. See line 12 for the required format of the
message.
SEHH2239 Data Structures
SEHH2239 – Assignment 2 Page 6 of 7
(d) Write a method removeStudent() with the specifications below:
1) Take one input student (type Student). Validate its type. Raise an error and stop
the program if the input type is invalid.
2) Check if the student was registered or not. Print a message if the student was not
registered. See line 9 for the required format of the message.
3) If the student was registered, remove the student from the BST by calling
self.BST = self.BST.remove(self.BST, student.studentid).
Decrease the size attribute. Print a message according to line 13 for the required format.
4) If the course is not full and if there is other student waiting in the queue, remove a
student from the queue and add him to the course by calling the addStudent()
method.
(e) Run the testing code provided in the Assignment Template. It should produce the following
outputs (excluding the line numbers). Do not alter the testing code.
1. Invalid input type
2. Invalid course code abc1234
3. False
4. True
5.
6. Invalid input type
7. Invalid input type
8. Register Calvin Weign 22123456A successful.
9. Cola Coke 22003276A was not registered.
10. Register Cola Coke 22003276A successful.
11. Calvin Weign 22123456A has already registered.
12. Course full. Put Rain Man 22435638A in waiting queue.
13. Remove Calvin Weign 22123456A successful.
14. Register Rain Man 22435638A successful.
Question 4
In question 4, you will build a class CourseRegistry that store all the courses in a school. The
class will use hash table (backed by Python list) with separate chaining. Python built-in function
hash() is used to calculate hash code of a course using the course code as key. The calculated
hash code will then map to corresponding index position of the hash table using a modulo operator.
The constructor is provided in the Assignment Template.
(a) Method insert() is used to add a course into course registry. Complete the method with
the specifications below:
1) Take one input course (type Course). Validate its type. Raise an error and stop the
program if the input type is invalid.
2) Create a LLNode object with course.code as key and course as value (the class
LLNode is provided in the Assignment Template; do not change the code of the LLNode
class and do not use other implementations of linked lists).
SEHH2239 Data Structures
SEHH2239 – Assignment 2 Page 7 of 7
3) Determine the hash table index by calling hash(course.code) %
self.capacity and insert the LLNode object to the front of the linked list.
4) Increment the size attribute by 1.
(b) Method search() is used to find and return a course from the course registry. Complete the
method with the specifications below:
1) Take one input code (type str). Validate its type. Raise an error and stop the program
if the input type is invalid.
2) Determine the hash table index by calling hash(code) % self.capacity.
3) Search along the linked list to see if any matching LLNode with key equals to the
inputted code. If found, return the value attribute of the LLNode. Otherwise, return
None.
(c) Run the testing code provided in the Assignment Template. It should produce the following
outputs (excluding the line numbers). Do not alter the testing code.
1. None
2. Data Structures
3.
4. Register Chan TM 22061762A successful.
5. Register CHOW MP 22167034A successful.
6. Register LAM CS 22118617A successful.
7. Register LEUNG WA 22018089A successful.
8. Register LI CC 22134887A successful.
9. Course full. Put LIU MK 22052452A in waiting queue.
10. Course full. Put NG KY 22018110A in waiting queue.
11. Course full. Put SHEK CL 22161668A in waiting queue.
12. Course full. Put TSE David 22158990A in waiting queue.
13. Course full. Put WONG KM 22153656A in waiting queue.
14.
15. Remove CHOW MP 22167034A successful.
16. Register LIU MK 22052452A successful.
17.
18. Course code: SEHH2239
19. Course title: Data Structures
20. Course size: 5/5
21. Registered students:
22. 22018089A Name: LEUNG WA, ID: 22018089A
23. 22052452A Name: LIU MK, ID: 22052452A
24. 22061762A Name: Chan TM, ID: 22061762A
25. 22118617A Name: LAM CS, ID: 22118617A
26. 22134887A Name: LI CC, ID: 22134887A
27. Students in queue:
28. Queue size: 4/8
29. Name: NG KY, ID: 22018110A
30. Name: SHEK CL, ID: 22161668A
31. Name: TSE David, ID: 22158990A
32. Name: WONG KM, ID: 22153656A
- END of Assignment 2 -

請加QQ:99515681  郵箱:99515681@qq.com   WX:codinghelp
















 

標簽:

掃一掃在手機打開當前頁
  • 上一篇:CS 211編程代做、代寫c/c++,Java程序
  • 下一篇:MANA 420代做、代寫Java/Python編程語言
  • 無相關信息
    昆明生活資訊

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

    關于我們 | 打賞支持 | 廣告服務 | 聯系我們 | 網站地圖 | 免責聲明 | 幫助中心 | 友情鏈接 |

    Copyright © 2025 kmw.cc Inc. All Rights Reserved. 昆明網 版權所有
    ICP備06013414號-3 公安備 42010502001045

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

              欧美精品一区三区| 国产欧美日韩亚州综合| 欧美日韩福利在线观看| 欧美精品久久天天躁| 欧美成人福利视频| 欧美成人精品高清在线播放| 欧美激情乱人伦| 欧美婷婷久久| 国产精品美女黄网| 狠狠网亚洲精品| 亚洲电影第三页| 一区二区高清在线观看| 亚洲欧美国产高清va在线播| 午夜一区二区三区在线观看| 久久成人一区| 欧美成人一二三| 欧美日韩综合视频| 国产日韩精品一区| 在线视频国产日韩| 一区二区三区导航| 欧美影院午夜播放| 欧美久久在线| 国产字幕视频一区二区| 亚洲免费观看高清在线观看 | 亚洲永久在线| 久久亚洲精选| 国产精品九色蝌蚪自拍| 黄色欧美成人| 亚洲欧美变态国产另类| 免费国产一区二区| 国产欧美成人| 亚洲免费福利视频| 久久久久亚洲综合| 国产精品欧美精品| 亚洲免费观看在线视频| 久久久久久综合| 国产精品成人aaaaa网站| 亚洲第一精品福利| 欧美一级视频精品观看| 欧美色区777第一页| 亚洲成色精品| 欧美有码在线视频| 国产精品久久久久999| 在线精品视频一区二区| 性欧美video另类hd性玩具| 欧美日韩精品伦理作品在线免费观看| 国产亚洲免费的视频看| 亚洲一区二区欧美| 欧美日韩精品一区二区天天拍小说| 韩国av一区二区| 欧美中文字幕视频在线观看| 国产精品极品美女粉嫩高清在线 | 亚洲欧美一区二区三区久久| 欧美岛国在线观看| 亚洲第一福利社区| 久久久视频精品| 国产情人综合久久777777| 亚洲一区二区在线| 国产精品白丝av嫩草影院| 一区二区三区免费看| 欧美视频不卡| 亚洲视频精品| 欧美系列电影免费观看| 一区二区成人精品| 欧美色大人视频| 一区二区福利| 国产精品久久久久一区二区三区 | 久久久一本精品99久久精品66| 国产婷婷97碰碰久久人人蜜臀| 欧美一进一出视频| 精品88久久久久88久久久| 看片网站欧美日韩| 亚洲国产高潮在线观看| 欧美激情一区二区三区| 一区二区三区四区五区视频 | 亚洲欧洲日韩综合二区| 欧美激情精品久久久久久黑人 | 国产精品永久入口久久久| 亚洲男人av电影| 国产精品天天摸av网| 久久久精品网| 日韩五码在线| 国产精品视频第一区| 久久国产精品网站| 亚洲国产老妈| 欧美午夜免费电影| 久久九九精品| 亚洲精品精选| 国产精品欧美风情| 久久久夜夜夜| 一二三区精品福利视频| 国产欧美一区二区三区久久| 免费成人在线观看视频| 亚洲午夜视频| 激情av一区| 国产精品99一区二区| 久久精品99国产精品| 亚洲九九九在线观看| 国产精品视频一区二区高潮| 久久久五月天| 亚洲一区二区三区国产| 亚洲大胆av| 国产精品视频xxx| 欧美精品激情| 久久久精品五月天| 亚洲一区精品电影| 亚洲国产精品国自产拍av秋霞| 国产精品高潮呻吟久久| 欧美v亚洲v综合ⅴ国产v| 亚洲欧美资源在线| 一本色道久久综合亚洲精品高清| 国产一区在线观看视频| 国产精品久久久久免费a∨| 老司机久久99久久精品播放免费| 亚洲摸下面视频| 亚洲精品在线视频观看| 狠狠久久五月精品中文字幕| 国产精品久久一区主播| 欧美激情第4页| 猫咪成人在线观看| 欧美一区二区三区四区在线| 亚洲性视频网站| 99在线热播精品免费99热| 一区福利视频| 国内精品久久国产| 国产日韩欧美一二三区| 国产精品网站在线播放| 欧美日韩亚洲一区二区三区| 欧美激情91| 欧美成人免费在线| 久热这里只精品99re8久| 久久久久成人精品| 久久aⅴ国产紧身牛仔裤| 亚洲欧美国产高清| 亚洲欧美日韩视频一区| 亚洲女人小视频在线观看| 亚洲在线免费观看| 亚洲婷婷综合色高清在线| 一道本一区二区| 日韩一级在线观看| 国产精品久久久爽爽爽麻豆色哟哟| 亚洲人成亚洲人成在线观看| 国产精品亚洲人在线观看| 国产一区二区三区在线观看网站| 午夜精品久久99蜜桃的功能介绍| 韩国美女久久| 国产一区二区主播在线| 狠狠色综合一区二区| 激情久久久久| 亚洲人成人77777线观看| 最新亚洲视频| 99视频热这里只有精品免费| aaa亚洲精品一二三区| 9久草视频在线视频精品| 亚洲小说欧美另类社区| 欧美一区国产二区| 榴莲视频成人在线观看| 欧美77777| 国产精品ⅴa在线观看h| 国产偷国产偷亚洲高清97cao| 韩国一区二区三区美女美女秀| 亚洲第一视频| 亚洲素人在线| 欧美在线视频导航| 欧美精品一区在线播放| 国产精品乱码久久久久久| 国产欧美综合一区二区三区| 亚洲高清视频在线| 亚洲一区在线观看视频| 久久精品成人一区二区三区| 男女激情久久| 国产精品第十页| 在线播放国产一区中文字幕剧情欧美| 最新国产の精品合集bt伙计| 亚洲一区二区日本| 久久综合999| 欧美日韩日本国产亚洲在线| 国产亚洲精品v| 一区二区欧美日韩| 久久久久久久97| 欧美三级在线视频| 在线日韩一区二区| 午夜精品久久久久久久99黑人| 欧美成人午夜77777| 国产精品一区二区久久久| 1204国产成人精品视频| 亚洲欧美日韩直播| 欧美日韩精品伦理作品在线免费观看| 国产视频精品va久久久久久| 99精品视频一区二区三区| 久久久噜噜噜| 国产日韩欧美高清免费| 99精品欧美一区| 免费亚洲电影| 国产一区二区三区久久悠悠色av| 一本一本久久| 欧美第十八页| 在线观看日韩av先锋影音电影院| 午夜精品久久久久| 国产精品多人|