1)A drawback of linked lists is that they must be processed___________? 2)The be

Question

1)A drawback of linked lists is that they must be processed___________?

2)The best-case search time for a perfect hash mapping algorithm is_________?
3) The worst-case search time for a perfect hash mapping algorithm is_________?

4)The average case search time for a perfect hash mapping algorithm is______?

5)A recursive algorithm cannot be contructed for a linked-based sequence search?T/F

6)Recursive solutions always utilize fewer resources over non-recursive solutions? T/F

7)Deleting from an array-based sorted list requires that each element after the element being deleted to be moved up one slot? T/F

8)Passing a pointer by _____allows the function to change what the caller's pointer points to, while passing a pointer by ____ allows the function to change the caller's point.

9)With the help of the _____ two values can be combined into a single unit and, therefore can be treated as one unit.

10) Every object of type pair has two data members, first and second, and these two data members are private. T/F

Explanation / Answer

1) Main Drawback is to access the individual elements in Linked List Elements , Complexity is O(n),where as in array its O(1). // Out ofOrder

2) Best is O(1)

3) Worst is O(n)

4)Average is O(1)

5) False

6) False

7) True

8) Address,Value

9) class tuple

10)False

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.