Answer Key
University
California State UniversityCourse
COMP 182 | Data Structures and Program Design and LabPages
8
Academic year
2022
NyiH
Views
12
A linear collection of data elements where the linear node is given by means of pointer is called? Linked list,
Linked lists are not suitable for the implementation of Binary search,
Linked list is considered as an example of type of memory allocation, Dynamic,
In Linked List implementation, a node carries information regarding Data and Link,
Linked list data structure offers considerable saving in Space Utilization and Computational Time,
Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity? Merge Sort,
Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list? Possible if X is not last node,
You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list? Delete the last element of the list,
Which of the following is not a disadvantage to the usage of array? Accessing elements at specified positions,
What is the time complexity of inserting at the end in dynamic arrays? Either O(1) or O(n),
What is the time complexity to count the number of elements in the linked list? O(n),
What is the space complexity for deleting a linked list? O(1),
Which of these is not an application of a linked list? Random Access of elements,
Which of the following is false about a doubly linked list? Implementing a doubly linked list is easier than singly linked list,
What differentiates a circular linked list froma normal linked list? You may or may not have the 'next' pointer point to null in a circular linked list
COMP 182: Quiz 1 - Linked-List
Please or to post comments