COS2611 Assignment 3 memo 2024
UNISA 2024 COS2611-24-Y Assessment 3
QUIZ
Question 1
Match the following operations on a Binary Search Tree (BST) with their correct descriptions:
InsertionAdding a new node with a given value to the appropriate position in the BST while maintaining t...
Started on Tuesday, 13 August 2024, 8:59 PM
State Finished
Completed on Wednesday, 14 August 2024, 9:20 PM
Time taken 1 day
Grade Not yet graded
Information
This is a compulsory assessment. You have one (1) attempt to complete the assessment. The system will automatically
upload your attempts when the due date and time is reached. The due date is 26 August 2024, 23:00.
Remember, the due date is the last date for submission and not the day on which you should start with the assessment.
There are 12 question in this assessment. Questions 1 - 11 are quiz questions. Question 12 is a practical project that you
have to complete and submit online.
Question 1
Correct
Mark 4.00 out of 4.00
Match the following operations on a Binary Search Tree (BST) with their correct descriptions:
Adding a new node with a given value to the appropriate position in the BST while maintaining the BST properties.
Insertion
Inorder A process of visiting all nodes in a BST in ascending order of their values.
Traversal
Removing a node with a specific value from the BST while ensuring that the tree remains a valid BST.
Deletion
Looking for a node with a specific value in the BST and returning whether it exists or not.
Search
Your answer is correct.
The correct answer is:
Insertion → Adding a new node with a given value to the appropriate position in the BST while maintaining the BST
properties.,
Inorder Traversal → A process of visiting all nodes in a BST in ascending order of their values.,
Deletion → Removing a node with a specific value from the BST while ensuring that the tree remains a valid BST.,
Search → Looking for a node with a specific value in the BST and returning whether it exists or not.
, Question 2
Correct
Mark 1.00 out of 1.00
Given the following sequence of numbers: [15, 7, 23, 4, 10, 18, 28], if you construct a binary search tree by inserting each
number in the given order, what would be the root of the resulting tree?
a. 15
b. 7
c. 23
d. 4
Your answer is correct.
The correct answer is:
15
Question 3
Correct
Mark 2.00 out of 2.00
Consider the BST:
If you perform an inorder traversal on this binary search tree, what would be the correct sequence of visited nodes?
a. 3, 5, 10, 15, 20, 25
b. 10, 5, 3, 20, 15, 25
c. 3, 5, 15, 10, 20, 25
d. 10, 5, 15, 20, 3, 25
Your answer is correct.
The correct answer is:
3, 5, 10, 15, 20, 25
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller CrystalIndigo. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for £4.68. You're not tied to anything after your purchase.
