In conclusion there are many different data structures. Each data structure has strengths and weaknesses which affect performance depending on the task. Today, we explored two data structures: arrays and linked lists. Arrays allow random access and require less memory per element (do not need space for pointers) while lacking efficiency for insertion/deletion operations and memory allocation. On the contrary, linked lists are dynamic and have faster insertion/deletion time complexities. However, linked list have a slower search time and pointers require additional memory per element in the list. Figure 10 below summarizes the strength and weakness of arrays and linked lists.
Hi, you haven't provided the programing language, therefore, we will use python but you can extend it to any programing language by reading the code and the explanation.
Answer:
n1 = int(input("First numeber: "))
n2 = int(input("Second numeber: "))
for i in range(5):
r1 = n1%10
r2 = n2%10
print(r1+r2)
n1 = n1//10
n2 = n2//10
Explanation:
- First, we ask for the user input n1 and n2
- We create a for-loop to calculate the sum of each place-value of two numbers
- We obtain the last number in n1 by using the mod operator (%) an the number ten this way we can always take the last value, we make the same for n2
- Then we print the result of adding the last two numbers (place value)
- Finally, we get rid of the last value and overwrite n1 and n2 to continue with the process
Answer: Author
Explanation: self explanatory
Answer:
The correct answer is A.
Explanation:
B is true if the two nodes are descending from the same parent node, they are called sibling nodes.
C is true, the nodes which do not have any nodes branching from them are called leaf nodes and mark the end of that specific branch.
D is true, a node tree is defined as nonlinear set of nodes growing downwards which are linked together.
The false option is A, a node in a node tree does not have to contain at least two links, it can be a leaf node.
I hope this answer helps.
Answer:
havent watched it and thanks for this
Explanation:
