University:
California State University, Northridge
Course:
COMP 182 | Data Structures and Program Design and Lab
Academic year:

2022
Views:

285

Pages:

8
Author:

NyiH

Question 12 ptsA linear collection of data elements where the linear node is given bymeans of pointer is called?OLinked listNode listPrimitive listUnordered listQuestion 22 ptsLinked lists are not suitable for the implementation ofInsertion sortRadix sortPolynomial manipulationBinary search Question 32 ptsLinked list is considered as an example oftype of memoryallocation.DynamicStaticCompile timeHeapQuestion 42 ptsIn Linked List implementation, a node carries information regardingDataLinkData and LinkNode Question 52 ptsLinked list data structure offers considerable saving inComputational TimeSpace UtilizationSpace Utilization and Computational TimeSpeed UtilizationQuestion 62 ptsWhich of the following sorting algorithms can be used to sort arandom linked list with minimum time complexity?Insertion SortQuick SortHeap SortMerge Sort Question 72 ptsGiven pointer to a node X in a singly linked list. Only one pointer isgiven, pointer to head node is not given, can we delete the node Xfrom given linked list?OPossible if X is not last nodePossible if size of linked list is evenPossible if size of linked list is oddPossible if X is not first nodeQuestion 82 ptsYou are given pointers to first and last nodes of a singly linked list,which of the following operations are dependent on the length of thelinked list?Delete the first elementInsert a new element as a first elementDelete the last element of the listAdd a new element at the end of the list Question 92 ptsWhich of the following is not a disadvantage to the usage of array?Fixed sizeThere are chances of wastage of memory space ifelements inserted in an array are lesser than the allocatedsizeInsertion based on positionAccessing elements at specified positionsQuestion 102 ptsWhat is the time complexity of inserting at the end in dynamicarrays?O(1)O(n)O(logn)Either O(1) or O(n) Question 112 ptsWhat is the time complexity to count the number of elements in thelinked list?O(1)OO(n)O(logn)O(n^2)Question 122 ptsWhat is the space complexity for deleting a linked list?OO(1)O(n)O(logn)Either O(1) or O(n) Question 132 ptsWhich of these is not an application of a linked list?To implement file systemsFor separate chaining in hash-tablesTo implement non-binary treesRandom Access of elementsQuestion 142 ptsWhich of the following is false about a doubly linked list?We can navigate in both the directionsIt requires more space than a singly linked listThe insertion and deletion of a node take a bit longerImplementing a doubly linked list is easier than singlylinked list Question 152 ptsWhat differentiates a circular linked list from a normal linked list?You cannot have the 'next' pointer point to null in acircular linked listIt is faster to traverse the circular linked listYou may or may not have the 'next' pointer point to nullin a circular linked listHead node is known in circular linked list