My Report

Data Structure I Mock 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
 10%

Question 1 of 10

1. Which of the following can be used to delete an element from the front end of the queue?

Question 1 of 10

Question 2 of 10

2. Evaluate and write the result for the following postfix expression
abc*+de*f+g*+ where a=1, b=2, c=3, d=4, e=5, f=6, g=2.

Question 2 of 10

Question 3 of 10

3. After performing these set of operations, what does the final list look contain?

InsertFront(10);
InsertFront(20);
InsertRear(30);
DeleteFront();
InsertRear(40);
InsertRear(10);
DeleteRear();
InsertRear(15);
display();

Question 3 of 10

Question 4 of 10

4. What is the time complexity to insert a node based on position in a priority queue?

Question 4 of 10

Question 5 of 10

5. What is the time complexity to insert a node based on key in a priority queue?

Question 5 of 10

Question 6 of 10

6. Using the evaluation of prefix algorithm, evaluate +-9 2 7.

Question 6 of 10

Question 7 of 10

7. Evaluate the following infix expression using algorithm and choose the correct answer. a+b*c-d/e^f where a=1, b=2, c=3, d=4, e=2, f=2.

Question 7 of 10

Question 8 of 10

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

Question 8 of 10

Question 9 of 10

9. What is the result of the given postfix expression? abc*+ where a=1, b=2, c=3.

Question 9 of 10

Question 10 of 10

10. What is the time complexity of evaluation of postfix expression algorithm?

Question 10 of 10


 

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.