a. Write a method boolean Replace(int item, int new_item) that replaces all occurrences of item in a list with new_item and return false if new_item is not found. For example, if item is "3" new_item is 5, then the method should replace all nodes that contain 3 with 5. b. [s] Write a method void merge(Linked List LL, boolean append) that takes another linked list as a parameter, merges it with current linked list adding it after the original linked list if append is true, else the new list should be added before the original linked list. The below figures demonstrates the concept: Append is the Append is false Original new Last First First new Original

a. Write a method boolean Replace(int item, int new_item) that replaces all occurrences of item in a list with new_item and return false if new_item is not found. For example, if item is "3" new_item is 5, then the method should replace all nodes that contain 3 with 5. b. [s] Write a method void merge(Linked List LL, boolean append) that takes another linked list as a parameter, merges it with current linked list adding it after the original linked list if append is true, else the new list should be added before the original linked list. The below figures demonstrates the concept: Append is the Append is false Original new Last First First new Original

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

Write a Python code using the given function and conditions. Do not use Numpy. Use LinkedList Manipulation. Given function: def insert(self, newElement, index) Pre-condition: The list is not empty. Post-condition: This method inserts newElement at the given index of the list. If an element with the same key as newElement value already exists in the list, then it concludes the key already exists and does not insert the key. [You must also check the validity of the index].
Java - Mileage for a Runner
Given below is a function to delete the last element of a single linked list. Fill in the blanks. void removelast(){ if(head==null) return null; else if(head.nextNode==null){ } else{ Node temp=head; while(temp.nextNode.nextNode!=null){ temp=temp.nextNode; } } }
1- A new static method with one parameter which is a head node for a linked list of integers, the method should create a new linked list which is equivalent to the original list of integers but with all repetitions removed, the method's return value is a head reference for the new list. this is what I have but it's not removing repetitions. public static IntLinkedBag removeRepetition (IntLinkedBag b1) { IntNode next; IntNode head = null; LinkedList<Integer> s = new LinkedList<>(); IntNode new_list = new IntNode(0, null); IntNode now = head; IntNode prev = new_list; while (now!= null) { int x = now.data; if (s.contains(x)) { new_list = new_list.next; } else { s.add(x); new_list.next = new IntNode(x, now); new_list = new_list.next; } now = now.next; } return b1; } }…
0101?
Suppose that you have a singly linked list with five nodes and with head reference. Then the statement head = head.next will remove the first node of the linked list? a) true b) false
/ This method takes as parameters a reference to the head of a linked list, a // position specified by n, and a key. It returns the number of occurrences // of the key in the linked list beginning at the n-th node. If n = 0, it means // you should search in the entire linked list. If n = 1, then you should skip // the first node in the list. public int numOccurrencesRec(LNode node, int n, int key) { // TODO: implement this method return 0; // replace this statement with your own return } } LNode Below: public class LNode{ // instance variables private int m_info; private LNode m_link; // constructor public LNode(int info) { m_info = info; m_link = null; } // member methods public void setLink(LNode link) { m_link = link; } public LNode getLink() { return m_link; } public int getInfo() { return m_info; } }
Assuming the node class has already been created, start your code from the method: def swapReplaceMidOdd(head, element): #write your code here
Write the following method that partitions the list using thefirst element, called a pivot:public static int partition(int[] list)After the partition, the elements in the list are rearranged so all the elements beforethe pivot are less than or equal to the pivot, and the elements after the pivot aregreater than the pivot. The method returns the index where the pivot is located inthe new list. For example, suppose the list is {5, 2, 9, 3, 6, 8}. After the partition,the list becomes {3, 2, 5, 9, 6, 8}. Implement the method in a way that takes atmost list.length comparisons. See liveexample.pearsoncmg.com/dsanimation/QuickSortNeweBook.html for an animation of the implementation. Write atest program that prompts the user to enter the size of the list and the contents ofthe list and displays the list after the partition. Here is a sample run. Enter list size: 8 ↵EnterEnter list content: 10 1 5 16 61 9 11 1 ↵EnterAfter the partition, the list is 9 1 5 1 10 61 11 16
Write a method to insert an item in a sorted list where the items are kept in a linked list named (first address of the list) "greenlist" and the method has the signature: void InsertItem(ItemType green)only the method using C++
int F(node<int>&p){int c=0; while(p!=0){p=p->next; c++; } return c;} This function is a. return the number of items in the linked list b. return the number of items in a linked list and destroy the linked list c. None of these d. destroy the list and free all allocated nodes
Please answer