1. How many pointer fields are contained (at least) in the node of a doubly link

Question

1. How many pointer fields are contained (at least) in the node of a doubly linked list. (5 points) TWo Pointers 2. Convert the infix expression ((2+(57-3) to postfix. (10 points) 2573 3. Consider the implementation of queues by using arrays. Assuming we initialize the pointers FRONT and REAR as below, FRONT= 0, REAR =-1 and answer the following questions. 3a. Consider the implementation of queues by using arrays with the size of 6. After you add and remove items couple of times, the current content in the queue shown as below, what is FRONT+ each) .--and REAR- 15 points Ans 3b. Consider the implementation of queues by using arrays with the size of 6. After you add and remove items couple of times, the current content in the queue shown as below, what is FRONT # a each) nd REAR . *. ' (5 points 4. Read the following code. Fill in each blank. (3 points each)

Explanation / Answer

2. Convert infix to postfix

----------------------------------------------------------------------------------------------------------------------------------------

so our answer is 2,5,7,*,+,3,-

---------------------------------------------------------------------------------------------------------------------------------------------------------

((2+(5*7))-3) Reading character Stack Postfix expression Initially empty empty ( ( empty ( (,( empty 2 (,( 2 + (,(,+ 2 ( (,(,+,( 2 5 (,(,+,( 2,5 * (,(,+,(,* 2,5 7 (,(,+,(,* 2,5,7 ) pop from stack until we get matching bracket. (,(,+ 2,5,7,* ) pop from stack until we get matching bracket. ( 2,5,7,*,+ - (,- 2,5,7,*,+ 3 (,- 2,5,7,*,+,3 ) pop from stack until we get matching bracket. Stack become empty 2,5,7,*,+,3,-

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.