Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

12. represent quantities, amounts or measurements a) value b) variables c) a and

ID: 3731158 • Letter: 1

Question

12. represent quantities, amounts or measurements a) value b) variables c) a and b both d) none 3.- represents a guarantee for performance on any possible input a) Worst-case performance b) Average-case performance c) Best case 14. A pointer variable which contains the location at the top element of the stack is called A. Top B. Last C. Final D. End 5. A variable is a variable whose value is the address of a location in memory a) Reference b) pointer c] both 16. Algorithms must be and a) short efficient b) long correct c) correct efficient dj none 17 form of access is used to add and remove nodes from a queue. al b) FIFO, First In First Out LIFO, Last In First Out d) None of these c) Both a and b form of access is used to add remove nodes from a stack. b)FIFO 18, a) LIFO c) Both A and 8 d) None of these is the term used to insert an element into stack. c) Pop 19, a) Push b) Pull d) Pump Deletion operation is done using a) Front 20. in queue. c top d) list

Explanation / Answer

If you post morw than 1 question, as per chegg guidelines I have to solve only 1 question, but I solved 3.

Ques 12. (C)

We can represent any of the mentioned with the variables and value.

Ques 12. (A) Worst-Case performance

Worst case is the maximum time am algorithm can take to complete a task. Hence, we can gaurantee that the algorithm would not take more time then the worst case.

Ques 14. (a) Top

Top points to the top of the stack

Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at drjack9650@gmail.com
Chat Now And Get Quote