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

2022
Views:

180

Pages:

8
Author:

NyiH

Quiz 3: Queue A+Due Sep 23 at 11:59pmPoints 30Questions 15Available Sep 17 at 12am - Sep 23 at 11:59pmTime Limit 60 minsAttempt HistoryAttemptTimeScoreLATESTAttempt 145 minutes30 out of 30Correct answers will be available on Sep 24 at 12am.Score for this quiz: 30 out of 30Submitted Sep 22 at 1:13pmQuestion 12 ptsThe data structure required for Breadth First Traversal on a graph is?StackArrayQueueTree Question 22 ptsA queue followsFIFO (First In First Out) principleLIFO (Last In First Out) principleOrdered arrayLinear treeQuestion 32 ptsIf the elements "A", "B", "C" and "D" are placed in a queue and aredeleted one at a time, in what order will they be removed?ABCDDCBADCABABDC Question 52 ptsA normal queue, if implemented using an array of size MAX_SIZE,gets full when?Rear = MAX_SIZE - 1Front = (rear + 1)mod MAX_SIZEFront = rear + 1Rear = frontQuestion 62 ptsWhat is the time complexity to insert a node based on key in apriority queue?O(nlogn)O(logn)O(n)O(n2) Question 72 ptsWhat is not a disadvantage of priority scheduling in operatingsystems?A low priority process might have to wait indefinitely forthe CPUIf the system crashes, the low priority systems may belost permanentlyInterrupt handlingIndefinite blockingQuestion 82 ptsIn linked list implementation of a queue, from where is the itemdeleted?At the head of link listAt the centre position in the link listAt the tail of the link listNode before the tail Question 92 ptsIn linked list implementation of a queue, where does a new elementbe inserted?At the head of link listAt the centre position in the link listAt the tail of the link listAt any position in the linked listQuestion 102 ptsWhat is the space complexity of a linear queue having n elements?O(n)O(nlogn)O(logn)O(1) Question 112 ptsWhat is the need for a circular queue?eeffective usage of memoryeasier computationsto delete elements based on priorityimplement LIFO principle in queuesQuestion 122 ptsWhat is the term for inserting into a full queue known as?overflowunderflownull pointer exceptionprogram won't be compiled Question 132 ptsWhat is the time complexity to insert a node based on position in apriority queue?O(nlogn)O(logn)OO(n)O(n2)Question 142 ptsWith what data structure can a priority queue be implemented?ArrayListHeapTree Question 152 ptsWhich of the following is not the type of queue?Ordinary queueSingle ended queueCircular queuePriority queue