My Report

Data Structure I Practice Test 2


Correct Answer: 2 points | Wrong: -1 point
Grades: A* (100% score) | A (80%-99%) | B (60%-80%) | C (40%-60%) | D (0%-40%)
advertisement

1. Making the push operation costly, select the code snippet which implements the pop operation.

2. What would be the solution to the given prefix notation?

/ / / / 16 4 2 1

3. The system throws an error if parentheses are encountered in an infix expression evaluation algorithm.

4. What is the postfix expression for the infix expression?

a-b-c

5. What is not a disadvantage of priority scheduling in operating systems?

6. Making the pop operation costly, select the code snippet which implements the same.

7. Of the following choices, which operator has the lowest precedence?

8. What is the time complexity of enqueue operation?

9. What is the term for inserting into a full queue known as?

10. In case of insertion into a linked queue, a node borrowed from the __________ list is inserted in the queue.


 

Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.