QUESTION 1 2 points Save Answer n an insertion sort using a vector data structur

Question

QUESTION 1 2 points Save Answer n an insertion sort using a vector data structure, the new data is always added to the end of the vector. True O False QUESTION 2 2 points Save Answer Since the size of dynamic arrays are known when allocated, C++ can automatically check for out-of-bounds references. True False QUESTION 3 2 points Save Answer finst is a pointer to an instance, the expression inst- method is equivalent to (*inst). method True False QUESTION 4 2 points Save Answer The const keyword is not used in the signature of a set accessor. True False QUESTION 5 2 points Save Answer A for index array) for loop cannot be used if array is dynamic. True False QUESTION 6 2 points Save Answer If the variable ap is declared as int ap;, the expression ap[5] is not valid. True False QUESTION 7 2 points Saved Given the following code int pa, pb pb pa delete pa the value of pb will be 0. True False

Explanation / Answer

1qn) false

2nd) false

3qn) true

4qn) true

5qn) false

6qn) true

7qn) false

8qn) true

9qn) false

10qn) true

11qn)    true

12qn)the new operator always returns a pointer to the allocated type.

13qn) type of the variable np is array pointer

14qn) then name of the standard namespace is std

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---