4. Consider the following piece of pseudocode: new DynamicArray d d[1] 1 for 2 ≤ i ≤ 4 do d[i] ix (i-1) end for xd[2] +

[answerhappygod]

4 Consider The Following Piece Of Pseudocode New Dynamicarray D D 1 1 For 2 I 4 Do D I Ix I 1 End For Xd 2 1 (65.34 KiB) Viewed 41 times

4. Consider the following piece of pseudocode: new DynamicArray d d[1] 1 for 2 ≤ i ≤ 4 do d ix (i-1) end for xd[2] + d[3] What is the final value of x? Enter answer here 5. Consider the following piece of pseudocode: new DynamicArray d d[1] 1 d[2] 2 d[3] +3 d[4] ←d[3] d[3] +0 Which of the following describes a linked list implementation of this pseudocode? O Create a new empty linked list, insert a node (with value 1) with next pointer to null, insert a node (with value 2) at the end of list, insert a node (with value 3) at the end of list, insert a node (with value 3) at the end of list, remove third node Create a new empty linked list, insert a node (with value 1) with next pointer to null, insert a node (with value 2) at the end of list, insert a node (with value 3) at the end of list, remove first node Create a new empty linked list, insert a node (with value 1) with next pointer to null, insert a node (with value 2) at the end of list, insert a node (with value 3) at the end of list, insert a node (with value 3) at the end of list, remove end node 1 point 1 point