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

              欧美精品一区在线发布| 亚洲精品在线一区二区| 日韩一区二区精品葵司在线| 久久久久成人网| 亚洲乱码久久| 精品二区视频| 国产精品久久97| 欧美三级不卡| 美女国产一区| 久久久精彩视频| 国产欧美日韩在线| 欧美日韩在线播| 欧美激情亚洲自拍| 免费成年人欧美视频| 国产嫩草一区二区三区在线观看 | 欧美日韩视频免费播放| 亚洲免费观看在线视频| 欧美日韩国产色视频| 一本色道久久加勒比88综合| 欧美午夜不卡| 欧美日韩久久精品| 欧美黄色aa电影| 老司机成人在线视频| 国产精品推荐精品| 午夜一区不卡| 午夜国产精品影院在线观看| 韩国三级电影一区二区| 欧美肥婆bbw| 欧美大片91| 欧美激情91| 欧美国产日产韩国视频| 亚洲午夜久久久久久尤物 | 欧美性事在线| 欧美日韩黄色大片| 欧美日韩国产色视频| 久久精品99国产精品酒店日本| 1024欧美极品| 亚洲精品欧美精品| 99视频一区二区三区| 激情久久久久久久久久久久久久久久 | 欧美破处大片在线视频| 翔田千里一区二区| 欧美在线free| 欧美不卡激情三级在线观看| 亚洲免费视频中文字幕| 亚洲国产精品国自产拍av秋霞| 国产精品v片在线观看不卡| 久久久久高清| 欧美极品一区二区三区| 久久国产精品黑丝| 欧美成黄导航| 欧美视频日韩视频在线观看| 麻豆精品视频在线| 欧美日韩午夜激情| 国内久久婷婷综合| 亚洲国产视频直播| 亚洲自拍16p| 免费不卡在线观看av| 久久五月天婷婷| 欧美日韩一区二区精品| 欧美国产日韩一区| 国产精品一区二区在线观看| 欧美日韩精品欧美日韩精品一| 狂野欧美激情性xxxx欧美| 小嫩嫩精品导航| 欧美电影免费观看高清| 久久久久久网| 久久久国产精品一区二区三区| 亚洲欧美视频一区二区三区| 亚洲精品久久| 欧美在线观看一二区| 欧美一区二区三区在线播放| 亚洲神马久久| 欧美成人精品在线| 国产欧美视频一区二区三区| 国产精品网红福利| 99视频一区二区| 你懂的视频欧美| 国产综合视频| 欧美有码视频| 国产精品视频免费观看www| 国产精品乱子乱xxxx| 国产精品一区在线观看你懂的| 国产精品试看| 一本高清dvd不卡在线观看| 99国产精品久久久久久久| 亚洲调教视频在线观看| 国内精品嫩模av私拍在线观看| 国产综合久久| 欧美自拍偷拍| 国产中文一区二区| 午夜精品美女自拍福到在线 | 久久全国免费视频| 国产一在线精品一区在线观看| 在线成人av.com| 久久gogo国模裸体人体| 久久国产视频网站| 国产一区二区三区精品欧美日韩一区二区三区 | 久久久久综合| 国产一区二区三区在线观看网站 | 国产精品日韩欧美大师| 国产精品欧美日韩一区二区| 激情综合激情| 嫩草影视亚洲| 一区二区欧美国产| 国产精品va在线| 亚洲女人天堂成人av在线| 久久人人超碰| 亚洲国产成人精品久久久国产成人一区| 久久激情久久| 亚洲黄色免费电影| 欧美日韩不卡视频| 亚洲深夜激情| 国产一区二区电影在线观看| 日韩系列在线| 国产伦精品一区二区三区视频黑人| 在线欧美小视频| 欧美激情亚洲综合一区| 国模套图日韩精品一区二区| 99国产精品久久| 国产精品久久久久久一区二区三区| 在线观看欧美亚洲| 欧美日韩亚洲精品内裤| 影音先锋成人资源站| 一区二区三区精品国产| 亚洲欧美99| 一区二区三区亚洲| 欧美日韩精品中文字幕| 亚洲国产日韩欧美综合久久 | 亚洲欧洲偷拍精品| 欧美视频一区二| 久久亚洲精品视频| 在线一区二区三区做爰视频网站| 欧美成人免费va影院高清| 狠狠综合久久av一区二区小说| 国产精品99久久久久久久女警| 欧美成人亚洲成人| 香蕉亚洲视频| 亚洲图片欧美日产| 亚洲日本激情| 国内精品视频一区| 国产精品v欧美精品v日韩| 在线视频欧美一区| 亚洲二区在线视频| 国产日韩综合一区二区性色av| 久久成人综合视频| 99精品视频一区| 亚洲国产成人在线播放| 麻豆乱码国产一区二区三区| 国产噜噜噜噜噜久久久久久久久| 欧美一区二区成人| 亚洲视频精品在线| 国产欧美日韩综合| 国产精品99免视看9| 亚洲一区美女视频在线观看免费| 欧美日韩伦理在线| 欧美国产亚洲视频| 久久在线免费观看| 欧美资源在线| 久久精品视频在线| 欧美一区日韩一区| 午夜精品久久久久久久白皮肤| 国产精品免费网站| 国产精品黄视频| 欧美亚男人的天堂| 久久精品人人爽| 久久久久国产精品麻豆ai换脸| 亚洲电影中文字幕| 亚洲第一精品久久忘忧草社区| 欧美日韩成人综合天天影院| 亚洲欧美日本伦理| 亚洲欧美日韩另类精品一区二区三区| 中日韩美女免费视频网址在线观看| 国产精品最新自拍| 国产精品日韩欧美一区二区| 久久久久亚洲综合| 免费影视亚洲| 欧美日本久久| 国产精品久久久久久久久婷婷 | 欧美美女福利视频| 欧美午夜精品久久久久免费视| 新狼窝色av性久久久久久| 亚洲精美视频| 9色精品在线| 亚洲欧美激情视频| 久久精品国产综合精品| 国产精品99久久久久久久久| 国产一区在线免费观看| 欧美激情中文字幕在线| 亚洲精品一区二区三区福利| 国产日韩精品一区| 亚洲福利免费| 亚洲一区日韩在线| 久久久噜噜噜久久久| 亚洲欧美在线另类| 久久久综合免费视频| 午夜一区二区三区不卡视频| 一区二区三区欧美在线| 亚洲国产一二三| 亚洲欧美中文日韩v在线观看|