COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Insertion
|
|
|
Traversal
|
|
|
Sorting
|
|
|
None of the above
|
Detailed explanation-1: -Traversal: Access each data item exactly once so that it can be processed. Searching: Find out the location of the data item if it exists in the given collection of data items.
Detailed explanation-2: -Traversing: accessing each record/node exactly once so that certain items in the record may be processed.
Detailed explanation-3: -The linear data structure’s elements can all be accessed in one run. There are four primary types of linear data structures: Queue, Linked Lists, Stack, and Arrays.
Detailed explanation-4: -Traversing is a process in which each element of a data structure is accessed. Accessing an element of data structure means visiting every element at least once. Traversing is performed to display every element of data structure or to perform any operation on its element.
Detailed explanation-5: -Explanation: The answer is Queue. Queue is a data structure in which insertion takes place from one end, and deletion takes place from one end.