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

Bubble Sort adaptation. Rewrite the following bubblesort algorithm so that in each pass, it “bubbles down” the smallest element to the left end. /*Bubble sort given list into ascending order Input: list a[0...n-1], n: the length of list a Output: list a is rearranged into ascending order BubbleSort (a, n) { //right points to the last element of the "remaining list" //it starts from n-1, after each pass, it decreases by 1 for right=n-1 downto 1: //perform one bubbling pass, bubbling up the largest element to right end for i=0 to right-1: if (a[i]>a[i+1]): swap (a[i], a[i+1]) } Trace the execution of your adapted bubble sort (in Q3) on the following input. Minimally, draw the content of list a after each iteration of the outer-loop. a=[5,3,10,4,2,1] n=6
Python Using recursion only No loops If the list is empty or does not contain any sets, the function should return 0. Using type() function and must be return not print def countSets(lst):
USE PYTHON Create a Linked list and insert following values 50, 30, 8, 65, 89, 85, 7 respectively. Apply Insertion sorting algorithm on this list to sort in Ascending Order. Print Sorting Linked List. Continue from above question create a method that take a key in parameter and find key using binary search approach. Design and implement an experiment that will compare the performance of a Python list with a list implemented as a linked list.
IN PYTHON THANK YOU
Sorting ascends if a list is empty or all items except the last are less than or equal to their successors. Define isSorted to return True if a list is sorted and False otherwise. (Hint: Loop through a list of length 2 or more and compare pairs of items left to right, returning False if the first item is greater.) Main function output: def main(): Print (isSorted(lyst)) lyst = [1] print(isSorted(lyst)) Lyst list(range(10)) print(isSorted(lyst)) lyst[9]=3 print(isSorted(lyst)) %3D True False
Consider the Double Linked List that is given below, where each box represents a ‘node’ type with two fields: integer data and a node type reference ‘next’ that points to the next node in the list. a) Write an algorithm to count all nodes that contain an odd number. b) Write an algorithm to print all nodes that contain an even number in the reverse direction of the list.
Write an algorithm that prints out all the subsets of 3 elements of a set of n elements. Theelements of this set are stored in a list that is the input to the algorithm.
Write a c# program for double linked list sorting algorithm by using below logic If else , while , functions. Output Before list - 42,57, 84,12,90 After list - 12,42,57,84,90
The linked list provided below:2 > 3 > 1 > 7 > 5 > 18 > NULLHere the > symbol means a pointer.Write a complete Python program which deletes the third last node of thelist and returns to you the list as below2 > 3 > 1 > 5 > 18 > NULLThe third last node (with a value 7) has now been dislodged from the list.Here are the few things to consider :(a) We do NOT know the length of the list.(b) Your solution should be in O(n) time and O(1) space having madejust a single pass through the list.
Write a python program for double linked list sorting algorithm by using below logic If else , while , functions. Output Before list - 42,57, 84,12,90 After list - 12,42,57,84,90
Using list comprehensions, define functions smaller :: Int -> [Int] -> [Int] larger :: Int -> [Int] -> [Int] that return the numbers in a list that are strictly smaller and larger than a given number, e.g. smaller 3 [2,4,1,5] should return [2,1].
Write a function that shuffles the rows in a two-dimensional list using the following header:def shuffle(m):Write a test program that shuffles the following matrix:m = [[1, 2], [3, 4], [5, 6], [7, 8], [9, 10]]