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()

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Create an implementation of singly linked list using classes with minimum 5 nodes (spectre, togusa, yuri, siren, shepherd) in Python with the following capabilities/functions: Traverse - print out all data from the linked list Insert - generate a node and attach to an existing linked list Search - find an item (data) from the linked list and return the node Remove - remove a node from the linked list
Code the following in OCaml. EDIT: Write a function that looks for a pair on elements from two integer lists that sum to a given value. Note: Only use recursion and lists. You may need a auxiliary or helper function. Write the following function sumOfTwo (a, b, v) that returns true if there exists an integer a list that when added to any integer in a different list, equals the sum. Signature: val sumOfTwo : int list * int list * int -> bool = Example output: # sumOfTwo([1;2;3],[10;20;30;40],42);; :bool = true (since 2 + 40 = 42) # sumOfTwo([1;2;3],[10;20;30;40],40);; :bool = false (nothing in list 1 can be added to list 2 to get 40)
20. Consider an algorithm intending to store all prime numbers between 2 and 20 (inclusive) in a list prime_list. There exists a helper function called is_prime(n) which returns True if n is prime and False if n is not prime. i = 1 prime_list = [0| while i <= 10: #missing code Which of the following can be used replace the missing code? (a) if is_prime(2*i): prime_list.append(2*i) i = i+ 1 (b) if is_prime(2*i): prime_list.append(2*i) i = i+ 1 (c) if is_prime(i): prime_list.append(2*i) i = i+ 1 (d) prime_list.append(is_prime(2*i)) i = i+ 1
Write a complete Java program that provides two methods named orderList(list) and lastIndexOf(list, targetValue). The first method should sort the elements ascendingly from a-z using Selection Sort Algorithm. The second method should return the last index at which a predetermined target value occurs in the list using Binary Search Algorithm. The method should return -1 if the target value is not found. List size, elements and target value should be read from the user.
Execute a program that will split a circularly linked list P with n nodes intotwo circularly linked lists P1, P2 with the first n/2 and the last n – n/2 nodes ofthe list P in them.
Write a function in python, build_list(), to read words from standard input and store them in a list. You may assume that there will be fewer than 100 words. If the string "STOP" is given as input before 100 words have been added to the list, stop the for loop and return the accumulated list of strings. Hints: - Use the accumulate-a-list pattern, with acc_list initialized to the empty list, [] - Use a for loop to iterate i over range(100) - When STOP is read from input, break from the for loop; otherwise, append the new word to acc_list before reading the next input - Return acc_list For example: Test Input Result L = build_list() print(L) C = ["April", "showers", "bring", "May", "flowers"] if L != C: print("error") April showers bring May flowers STOP ['April', 'showers', 'bring', 'May', 'flowers']
Implement a function to insert a node at the end of a doubly linked list. Explain the steps involved and analyze the time complexity of your implementation.
Java Design and draw a method called check() to check if characters in a linked list is a palindrome or not e.g "mom" or "radar" or "racecar. spaces are ignored, we can call the spaces the “separator”. The method should receive the separator as a variable which should be equal to “null” when no separator is used.
Write a java function to find minimum moves required for making 2 List<Integer> equal. public int minimumOps(List<Integer> S, List<Integer> T){} The two possible moves are: shift(list) returns a new list after moving the front number to the back—i.e., [1, 2, 3 ,4 ] -----> [2, 3, 4, 1] reverse(list) returns the reverse of the list—i.e., [1, 2, 3, 4] -------> [4, 3, 2, 1] for example: consider S = {1, 2, 3, 4} and T = {2, 1, 4, 3}, we can see that T = shift ( shift( reverse( S ))) S = [1, 2 , 3 ,4] -----> [4, 3, 2, 1] ------>[3, 2, 1, 4] -------->[2, 1, 4, 3] = T = 3 moves total. But this is not the only way to transform S to T. To illustrate, here are some other sequence of operations : T = reverse(shift(shift(S))) T = shift(reverse(shift(S))) T = reverse(shift(shift(reverse(reverse(S)))))) Goal is to find the minimum moves on S list to form T list. Some more input/ output examples of length 5 minimumOps(List.of(1,2,3,4,5),…
Write a function with the signature below that returns the sum of the last k elements of a singly linked list that contains integers. int returnSumOfLastKNodes(Node* head, int k) Example: 10 -> 5->8->15->11->9->23 10 represents the head node, returnSumOfLastKNodes(Node* head, 4) will return 58.
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