Are we allowed to create our own functions as well?

Hi, I'm a little bit confused as to how these questions are differemt. Q1 Write a simple description of how you are going to represent the problem as a data structure. Your description should justify how the representation is going to help you solve th...

oooooh thanks for that my dumbass read the literally for some reason. i read it as no Kiktil will be named the string literal "child name" lol

The explanation for the add child method in genealogy.py will probably answer your first question.

Are the expected target complexities given referring to amortized complexity or Worst Case complexity?

I believe the first question is asking is what data structure you are going to use to represent the hierarchical structure family tree of the kiktils, whilst question 6 is asking about all the other data structures you used to implement the other met...

Oh sorry I thought you meant lab2 as in the first assessed lab. As for the second assessed lab I am also a bit confused about what question 6 haha.

Hi bill, question 6 did ask for complexity as well. Question 6 is asking why your solution is correct as well as the time complexity of your solution. Here is my answer that I got full marks for Question 6 (1 mark) Give an argument for the correctn...

Hi there, just wanted to clarify some assumptions about the lab 1. Can we assume that no 2 kiktil will have the same name? I'm assuming this will be the case as if 2 kiktils had the same name, it would make the get cousin dist() function impossible t...

Tree ADT is covered in lecture 15, which I believe will be covered in the wed thurs lectures. Of course you can study the slides yourself and use the internet to study up. The lab becomes pretty self explanatory after you understand the tree ADT.

When will submissions be open for the Second Assessed Lab, I finished the labs and answers and don't want to forget to submit. Thanks, Bill

For question 6, what sort of answer is expected of us? I understand it wants the function and purpose of chosen data structures but the justification for the chosen data structures are also asked for in question 1. Is question 6 just question 1 witho...

There is an explanation under the function in genealogy.py that explains how to calculate it. If you draw a diagram of the test sample genealogy, you can see who is related to who and find their closest shared ancestor. Then, from this shared ancesto...

I found that only the absolutely simplest structure lets me have O(1) so simple data structures built into python are a good start on finding the right one.

Nothing about the algorithm or anything, I'm just genuinely confused at the values I need to return for this function.. can anyone explain what the question meant by "degree and removal of the cousin relation". Reading the expected results of the tes...

I met the same question, I can't decide use which kind of data structures...

Nevermind, I'm overcomplicating this.

Is O(1) achievable? The add child function asks for a target of O(1), a tree data structure wouldn't be able to achieve this, finding from root the parent to link the child would be O(n). A set would meet O(1) but would have trouble with get primogen...

Just had a look over lab four and it seems to cover implementing something like a tree diagram but in python form. Are the lectures still behind on the content for this lab even though its assessed?

Thank you so much Was pretty confused, guess its just how the question is written. Thank you for clarifying