Task 1: Creating a Circular Linked List In the circular linked list the previous element stores...

Transcribed Image Text:

Task 1: Creating a Circular Linked List In the circular linked list the previous element stores the address of the next element and the last element stores the address of the starting element. The elements points to each other in a circular way which forms a circular chain. The circular linked list has a dynamic size which means the memory can be allocated when it is required. data next 3 HEAD data next data next 10 2 Last Element points back to First Circular Linked List is a variation of Linked list in which the first element points to the last element and the last element points to the first element. Both Singly Linked List and Doubly Linked List can be made into a circular linked list. Singly Linked List as Circular In singly linked list, the next pointer of the last node points to the first node. NODE NODE NODE Head Next Next Next Data Items. Data Items Data Items Question: Implement the following basic operations Basic Operations Following are the important operations supported by a circular list. insert - Inserts an element at the start of the list. delete - Deletes an element from the start of the list. display Displays the list. Task 2: Write a java program to convert the postfix express to infix expression using stack. Algorithm: 1.While there are input symbol left ...1.1 Read the next symbol from the input. 2.If the symbol is an operand ...2.1 Push it onto the stack. 3.Otherwise, ...3.1 the symbol is an operator. ...3.2 Pop the top 2 values from the stack. ...3.3 Put the operator, with the values as arguments and form a string. ...3.4 Push the resulted string back to stack. 4.If there is only one value in the stack ...4.1 That value in the stack is the desired infix string. Input abc++ Output (a + (b + c)) Input : ab*c+ Output ((a*b)+c) Note: Try to implement a code which works only for these inputs. Task 3: Create a random queue using Java array. For example, the queued items are 44, 122,-4, 10,0,99. Now, by using only the queue operations such as enqueue and dequeue, do you think sorting is possible? The output should be -4, 0, 10, 44, 99, 122. Note: You could use another queue to copy the ordered elements Task 1: Creating a Circular Linked List In the circular linked list the previous element stores the address of the next element and the last element stores the address of the starting element. The elements points to each other in a circular way which forms a circular chain. The circular linked list has a dynamic size which means the memory can be allocated when it is required. data next 3 HEAD data next data next 10 2 Last Element points back to First Circular Linked List is a variation of Linked list in which the first element points to the last element and the last element points to the first element. Both Singly Linked List and Doubly Linked List can be made into a circular linked list. Singly Linked List as Circular In singly linked list, the next pointer of the last node points to the first node. NODE NODE NODE Head Next Next Next Data Items. Data Items Data Items Question: Implement the following basic operations Basic Operations Following are the important operations supported by a circular list. insert - Inserts an element at the start of the list. delete - Deletes an element from the start of the list. display Displays the list. Task 2: Write a java program to convert the postfix express to infix expression using stack. Algorithm: 1.While there are input symbol left ...1.1 Read the next symbol from the input. 2.If the symbol is an operand ...2.1 Push it onto the stack. 3.Otherwise, ...3.1 the symbol is an operator. ...3.2 Pop the top 2 values from the stack. ...3.3 Put the operator, with the values as arguments and form a string. ...3.4 Push the resulted string back to stack. 4.If there is only one value in the stack ...4.1 That value in the stack is the desired infix string. Input abc++ Output (a + (b + c)) Input : ab*c+ Output ((a*b)+c) Note: Try to implement a code which works only for these inputs. Task 3: Create a random queue using Java array. For example, the queued items are 44, 122,-4, 10,0,99. Now, by using only the queue operations such as enqueue and dequeue, do you think sorting is possible? The output should be -4, 0, 10, 44, 99, 122. Note: You could use another queue to copy the ordered elements