________ is a list in which the order of the items is significant, and the items are not necessarily sorted.

Related MCQs

• You want to check whether a given set of items is sorted. Which of the following sorting methods will be most efficient if it is already in sorted order?
• Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the end node of the linked list
• Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked list
• A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is?
• A sorting technique that guarantees that records with the same primary key occurs in the same order in the sorted list as in the original unsorted list is said to be
• Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked lis
• Which of the following sorting methods would be most suitable for sorting a list which is almost sorted
• Which sorting algorithm can exploit the partially sorted data in a list?
• Time required to search an element in a sorted linked list is______
• A sorted file contains 16 items. Using binary search, the maximum number of comparisons to search for an item in this file is