Which of the following statements is true about linear and non-linear data structures in java? a. Array and LinkedList are non-linear data structures, while Graph and Tree are linear data structures. b. Array and LinkedList are linear data structures, while Graph and Tree are non-linear data structures. c. Array and Graph are linear data structures, while LinkedList and Tree are non-linear data structures. d. Array and Tree are linear data structures, while LinkedList and Graph are non-linear data structures.

Select the correct answerWhat is a linked list?OptionsA linear data structure in which the elements are stored at contiguous memory locations.A non-linear data structure in which the elements are stored at contiguous memory locations.A non-linear data structure in which the elements are not stored at contiguous memory locations.A linear data structure in which the elements are not stored at contiguous memory locations.

Which of the following data structure is not linear data structure?Select one:a.Arraysb.Linked listc.Both of aboved.None of aboveClear my choice

Which of the following statements about arrays and linked lists in Java is/are Incorrect ? a. Arrays are always faster than linked lists. b. Linked lists are always faster than arrays. c. Arrays are better for random access, while linked lists are better for sequential access. d. Arrays and linked lists have the same performance for both random and sequential access.

. Each data item in a record may be a group item composed of sub-items; those items which areindecomposable are calleda) elementary itemsb) atomsc) scalars#d) all of the abovee) none of the above98. The difference between linear array and a record isa) An array is suitable for homogeneous data but the data items in a record mayhave different data typeb) In a record, there may not be a natural ordering in opposed to linear array.c) A record form a hierarchical structure but a linear array does not#d) All of abovee) none of the above99. Binary search algorithm cannot be applied to#a) sorted linked listb) sorted binary treesc) sorted linear arrayd) pointer arraye) all of the above100. When new data are to be inserted into a data structure, but there is no available space; thissituation is usually calleda) underflow#b) overflowc) housefulld) saturatede) out of bounds101. The situation when in a linked list START=NULL is

Which of the following statements accurately describes the differences between arrays and linked lists? a. Arrays store elements in contiguous memory locations, are static data structures, and are generally faster for random access. Linked lists store elements in non-contiguous memory locations, are dynamic data structures, and are better for operations like insertion and deletion. b. Arrays and linked lists both store elements in contiguous memory locations but differ in that arrays are dynamic while linked lists are static. c. Arrays and linked lists are both dynamic data structures and store elements in non-contiguous memory locations, but arrays are faster for insertion and deletion operations. d. Arrays are dynamic and store elements in non-contiguous memory locations, while linked lists are static and store elements in contiguous memory locations.