Review: Searching Techniques 1. Sequential search can be applied to any data str

Question

Review: Searching Techniques 1. Sequential search can be applied to any data structure (true talse 2. The average case Big o run time of sequential search is he worst case Bigo run-time of sequential search is 4. The data must be sorted in order to use sequential search true false 5. Sequential search executes faster when the data is sorted truealse ) 6. The average case Big-o tun-time of binary search is 7. The HoEst case Big-o run-time of binary search 8. Binary search can be executed on a linked-list 9. Binary search can be executed on a binary file true false true false 1 10. The average case Big-o run-time of binary search tree is 11. The worst case Big-o run-time of binary search tree is 12. Direct addressing will not be feasible for any applications until the main menory of computers gets larger ( true / false 13. When direct 'addressing is used, the component number (logical address) assigned to a record is equal to the key of the record ( true false). 14. Direct addressing requires random access true false 15. The set of possible values for the key is called 16. The set of possible logical addresses that will be assigned to the records is called .

Explanation / Answer

Ans - 1 true

Ans - 2 O(n/2)

Ans - 3 O(n)

Ans -4 false

Ans - 5 true

Ans -6 O(log n)

Ans -7 O(log n)

Ans -8 true

Ans -9 true

Ans -11 O(n)

Ans -10 O(h)

Ans -12 false

Ans - 13 true

Ans -14 true

Ans -16 page table

Related Questions

Navigate

• Browse (All)
• Browse R
• Subjects

---

---

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