TRUE FALSE circle only one answer 2 points each 11) TRUE FALSE For an array name
ID: 3726586 • Letter: T
Question
TRUE FALSE circle only one answer 2 points each 11) TRUE FALSE For an array named A of size 100 to go to A[5] requires one multiplication and one addition. 12) TRUE FALSE For an array named A of size 100 to go to Al80] requires one multiplication and one addition. 13) TRUE FALSE For linked list with 100 nodes, to go to the node which is 80 nodes from the head requires one multiplication and one addition. 14) TRUE FALSE For a linked list with 100 nodes, to go to the node 3 nodes from the head requires one multiplication and one addition 15) TRUE FALSE In an overloaded function, we must specify the argument data types (int float, double, char) for each version of the function. 16) TR UE FALSE In a function template we can use arguments of type int, float, double char as long as they can be processed by the defined function template. 17) TRUE FALSE In a linked list we can insert a new node between the second and third nodes without reordering the rest of the nodes. 18) TRUE FALSE In a static array we can insert a new element with a new index between the second and third elements without reordering or changing the indices of the rest of the elements.Explanation / Answer
11. false ---only addition in index is needed as it is one dimensional array
12. false--only addition in index is needed as it is one dimensional array
13. false -- linked list only need next address to traverse
14. false -- we can traverse the linked list using next address
15. true-- overloaded function are recognised by compiler with the number ,type anf order of arguments
16. true --- function template can be used to define function of any datatype
17. true --- reordering is not needed in linked list
18. false --- for inserting in a static array , the elements from position third to last need to be shifted to the right
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.