what is turnaround time for a process what is turnaround time for a process what
ID: 3606175 • Letter: W
Question
what is turnaround time for a process what is turnaround time for a process what is turnaround time for a process what is turnaround time for a process Multiple choice questions. Choose one best answer for each question. Answe from this section [15 points) Q1: A stack is a container of objects that are inserted and removed in: a. In priority order b. First in first out order c. Random order d. Last in first out order. Q2: Recursive functions must have a: a. b. c. d. Print statement Exception handling routine Variable declaration. Base case Q3: AN array based stack has the following properties a. Fixed size. b. Data that can be accessed in LIFO order. Push and Pop operation All of the above c. d. Q4: When implemented as a linked list, a Stack data structure a. has a limited size b. becomes a random access data structure. c. is able to act as a queue as well as a stack. d. None of the above Q5: An application where a Stack data structures can be used is: a. b. c. d. Process jobs in a printer queue Performing matrix multiplications Sort and search objects Reversing the content of a vector Q6: In a Queue data structure, the function front does the following: a. Insert at the front of the queue b. Remove the front element c. Return and remove the front element d. Return, but do not remove, a reference to the front element in the queue a. The dequeue function b. Use the front () function to remove the element firts c. Should call enqueue first to make sure there is something in the queue d. The Q7: Before removing an element in a Queue, one should call: to make sure that the queue is not empty function emptyExplanation / Answer
The answers for the following questions is as follows:
1.The answer for first question is option D.Because a stack is a container of objects that are inserted and removed in last in first out order.
2.The answer for the second question is option D.Because a recursive function must have a base case or a stopping condition.
3.The answer for the third question is option D.Because all are the qualities match for an array based stack as we have to keep checking the the size of stack using an integer named top.
4.The answer for the fourth question is option B.Because when stack is implemented as a linked list it provides an easy access of elements from the top of the stack.
5.The answer for the fifth question is option A,as we can process the jobs in printer because of the LIFO technique.
6.The answer for the sixth question is option D,as it returns the element without removing the reference from the queue.
7.The answer for the seventh question is option D,because we should make sure whether the stack is full or not by calling isEmpty().
8.In computing, turnaround time is the total time taken between the submission of a program/process/thread/task for execution and the return of the complete output to the customer/user.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.