![By Mr.Solomon E.
Linear Data Structures
Array
• A collection of elements stored at contiguous memory
locations.
• store a collection of elements of the same data type
• Accessed using an index.
• Arrays excel at providing fast, direct access to elements
However, their fixed size can be a limitation
Example: An array of integers: [10, 20, 30, 40]](https://image.slidesharecdn.com/dsachapter3-250331191905-1b4d2865/85/Data-Structure-and-Algorithm-Chapter-3-ppsxDSA-Chapter-3-ppsx-4-320.jpg)
Data Structure and Algorithm Chapter 3.ppsxDSA Chapter 3.ppsx
- 1. By Mr.Solomon E. Chapter 3 Data Structure
- 2. By Mr.Solomon E. Data Structure What is a Data Structure? • A data structure is a way of organizing, managing, and storing data so that it can be accessed and modified efficiently. • It provides a systematic way to perform operations on data, such as insertion, deletion, searching, and sorting. • Why Are Data Structures Important? They help in organizing data for better efficiency and performance. They are essential for implementing algorithms.
- 3. By Mr.Solomon E. Types of Data Structures • Linear Data Structures: Data is arranged in a sequential manner. e.g. Array, Stack, Queue, Linked list.. • Non-Linear Data Structures: Data is arranged hierarchically or in a non-sequential manner. e.g. Tree, Graph.. • Hash-Based Data Structures: Data is stored and retrieved using a key- value pair. e.g. Hash table
- 4. By Mr.Solomon E. Linear Data Structures Array • A collection of elements stored at contiguous memory locations. • store a collection of elements of the same data type • Accessed using an index. • Arrays excel at providing fast, direct access to elements However, their fixed size can be a limitation Example: An array of integers: [10, 20, 30, 40]
- 10. By Mr.Solomon E.
- 11. By Mr.Solomon E.
- 12. By Mr.Solomon E.
- 13. By Mr.Solomon E.
- 14. By Mr.Solomon E.
- 15. By Mr.Solomon E.
- 16. By Mr.Solomon E.
- 17. By Mr.Solomon E.
- 18. By Mr.Solomon E.
- 19. By Mr.Solomon E. Use arrow notation (temp->field) to access node fields.
- 20. By Mr.Solomon E.
- 21. By Mr.Solomon E.
- 22. By Mr.Solomon E.
- 23. By Mr.Solomon E.
- 24. By Mr.Solomon E.
- 25. By Mr.Solomon E.
- 26. By Mr.Solomon E.
- 27. By Mr.Solomon E.
- 28. By Mr.Solomon E.
- 29. By Mr.Solomon E.
- 30. By Mr.Solomon E.
- 31. By Mr.Solomon E.
- 32. By Mr.Solomon E.
- 33. By Mr.Solomon E.
- 34. By Mr.Solomon E.
- 35. By Mr.Solomon E.
- 36. By Mr.Solomon E.
- 37. By Mr.Solomon E.
- 38. By Mr.Solomon E.
- 39. By Mr.Solomon E.
- 40. By Mr.Solomon E.
- 41. By Mr.Solomon E.
- 42. By Mr.Solomon E.
- 43. By Mr.Solomon E.
- 44. By Mr.Solomon E.
- 45. By Mr.Solomon E.
- 46. By Mr.Solomon E.
- 47. By Mr.Solomon E.
- 48. By Mr.Solomon E.
- 49. By Mr.Solomon E.
- 50. By Mr.Solomon E. What is the time complexity of the Linear Search algorithm in the worst case? ** a) O(1) b) O(log n) c) O(n) d) O(n²)
- 51. By Mr.Solomon E. Which of the following is a requirement for the Binary Search algorithm to work correctly? a) The array must be unsorted b) The array must be sorted c) The array must contain duplicate elements d) The array must be of size n > 100
- 52. By Mr.Solomon E. In a Binary Search, if the search key is greater than the middle element, what happens next? a) The search continues in the first half of the array b) The search continues in the second half of the array c) The search terminates unsuccessfully d) The middle element is swapped with the key
- 53. By Mr.Solomon E. Which sorting algorithm works by repeatedly finding the smallest element and placing it at the beginning? a) Insertion Sort b) Selection Sort c) Bubble Sort d) Linear Sort
- 54. By Mr.Solomon E. What does O(1) time complexity indicate? a) The runtime grows linearly with the input size b) The runtime is constant regardless of input size c) The runtime grows logarithmically with the input size d) The runtime grows quadratically with the input size
- 55. By Mr.Solomon E.
- 56. By Mr.Solomon E.