2. Write an iterative algorithm which takes an input a singly linked list and reverse it. Java code Input: List A: 1->2->40->20->Null Output: List A: 20->40->2->1->Null Show the time complexity of your algorithm? Algorithm ReverseList(A) // operations on list // 1. Check if A is empty by comparing A = Null // 2. Next element of the list by A.next()

2. Write an iterative algorithm which takes an input a singly linked list and reverse it. Java code Input: List A: 1->2->40->20->Null Output: List A: 20->40->2->1->Null Show the time complexity of your algorithm? Algorithm ReverseList(A) // operations on list // 1. Check if A is empty by comparing A = Null // 2. Next element of the list by A.next()

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

For this problem you can use the singly linked list code implemented in lab class. Take an integer N (0<N<1000) as input from user. Generate N random values (range: 1-100) and store/deletethem sequentially by implementing the following function: node* notMoreThanTwo(node *head, int value)This function will add the number in head if this is first appearance, insert in tail if it is a duplicate value, and delete the first value if it is in list twice already. For each insertion print %dinserted and for deletion print %d deleted, where %d is the randomly generated value
2. Write an iterative algorithm which takes an input a singly linked list and reverse it. Java code Input: List A: 1->2->40->20->Null Output: List A: 20->40->2->1->Null Show the time complexity of your algorithm? Algorithm ReverseList(A) // operations on list // 1. Check if A is empty by comparing A = Null // 2. Next element of the list by A.next()
Directed Graph G=(V,E), where: v={1,2,3,4} E={{1,2},{2,4},{4,1},{2,3},{3,1},{4,3}}| Which of the following adjacency matrices represents digraph G? Select one: O a {{0,1,0,0},{0,0,11},{1,0,0,0},(1,0,1,0}} b. {{0,1,0,0),(1,0,11}, {1,0,0,0} {0,0,1,0}}| c. {{0,1,0,0},(0,0,1},10.0.1) (1,0,0,0}} d. {{0.10,1},(0.0,1L1).{1,0.10} (1,010}}
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Implement the following two methods in O(n) time. // Reverse the list and return it in O(n) time public static <E> ArrayList<E> reverse(ArrayList<E> list) // Reverse the list and return it in O(n) time public static <E> LinkedList<E> reverse(LinkedList<E> list) Use the following code to test these methods: public static void main(String[] args) { Scanner input = new Scanner(System.in); System.out.print("Enter 10 numbers: "); ArrayList<Integer> list = new ArrayList<>(); for (int i = 0; i < 10; i++) { list.add(input.nextInt()); } reverse(list); for (int i: list) { System.out.print(i + " "); } System.out.println(); LinkedList<Integer> list1 = new LinkedList<>(list); reverse(list1); for (int i: list1) { System.out.print(i + " "); } System.out.println(); }
The function interleave_lists in python takes two parameters, L1 and L2, both lists. Notice that the lists may have different lengths. The function accumulates a new list by appending alternating items from L1 and L2 until one list has been exhausted. The remaining items from the other list are then appended to the end of the new list, and the new list is returned. For example, if L1 = ["hop", "skip", "jump", "rest"] and L2 = ["up", "down"], then the function would return the list: ["hop", "up", "skip", "down", "jump", "rest"]. HINT: Python has a built-in function min() which is helpful here. Initialize accumulator variable newlist to be an empty list Set min_length = min(len(L1), len(L2)), the smaller of the two list lengths Use a for loop to iterate k over range(min_length) to do the first part of this function's work. On each iteration, append to newlist the item from index k in L1, and then append the item from index k in L2 (two appends on each iteration). AFTER the loop…
Write a program in Java to manipulate a Double Linked List: Count the number of nodes Insert a new node before the value 7 of Double Linked List Search an existing element in a Double linked list (the element of search is given by the user) Suppose List contained the following Test Data: Input the number of nodes : 4Input data for node 1 : 5Input data for node 2 : 6 Input data for node 3 : 7 Input data for node 4: 9
Python Implement a singly linked list with the following functions: - add_head(e) - add_tail(e) - find_3rd_to_last() - returns element located at third-to-last in the list - reverse() - reveres the linked list, note, this is not just printing elements in reverse order, this is actually reversing the list
Student should be able to develop the programs for queue using arrays and linked list Exercise 1: Implementation of Queue using Array or Linked list Real life situation. Design a simulation that can help to answer it. Customers at a grocery store want to check-out The grocery have 3 counter and the costumer must choose one of the counter Counter 1:3 people assembly Counter 2: 2 people assembly Counter 3: 3 people assembly The costumer should choose the fastest way to check out
How can I create a list by asking for input (x) and create a list from 1 to x using recursion? Example: Input: 12 Output: [1,2,3,4,5,6,7,8,9,10,11,12] def newlist(n): #Base Case/s #Add conditions here for your base case/s #if <condition> : #return <value> #Recursive Case/s #Add conditions here for your recursive case/s #else: #return <operation and recursive call> function return []
java Write a program that implements the methods of a list using LINKED LISTS. Send source code END(L) PRINT_LIST(L) INSERT(x,p,L) LOCATE(x, L) RECOVER(p,L) DELETE(p, L) NEXT(p,L) PREVIOUS(p,L) DESTROY(L) FIRST(L) EMPTY(L ) * This is a function that returns true if the list is empty and false if the list is not empty. Create a menu with an option for each of the list methods. Validate p(position) between 1 and the size of the list.
What the code is about: Implement a recursive algorithm to add all the elements of a non-dummy headed singly linked linear list. Only head of the list will be given as parameter where you may assume every node can contain only integer as its element.Note: you’ll need a Singly Node class for this code. **PLEASE EXPLAIN HOW THE NODE CLASS AND THE CONSTRUCTOR OF THE NODE CLASS IS WORKING IN THIS CODE** #singlty node class for single linked listclass node: def __init__(self, value = None, next=None): self.value = value self.next = nextdef AddAll(head):#takes head of single linked list head if head==None: return 0#if reached end of the linked list return AddAll(head.next) + head.value #each node's next pointer is passed in recursive call #and value of each node is added while returning from recursive call