Please solve the question in java programming language Consider the doubly linked list below to answer the following:A) Write Java statements to delete the node with info 30 using the reference variable last.B) Write a single Java statement to change the value of the node containing 4 to be 14 using a reference variable first.C) Write Java statements to create a new node called newNode with a value of 70 in its info, and then add it to the lastof the List.D) Write Java statements to print out the doubly linked list from the occurrence of info 32 to the end of the list inreverse order.firstlast174321930

NOTE: Answering only the first 3 subparts as per the guidelines. First, we will create the doubly…

Answered: Consider the doubly linked list below…

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

Order check [15 points]. Write a program OrderCheck.java that takes four int command-line arguments w, x, y, and z. Define a boolean variable whose value is true if the four values are either in strictly ascending order (w < x < y < z) or strictly descending order (w > x > y > z), and false otherwise. Then, display the boolean variable value.NOTE 1: Do not use if statements on this program.NOTE 2: Assume that the inputs will always be integers.
Write Java Program Mr. Patrick is fond of reading books he is looking for a computerized way to keep record of his book collection, you have been given the responsibility to meet up his following requirements. (Use appropriate data structure to accomplish your task), develop following methods: 1. Add(): adds a new book to the list ( A book contains name of the book, author name) NOTE: every new book will have access to its neighboring books (previous and next) 2. Remove():in case any book is removed from the pile update your list 3. countBooks(): displays the total number of books 4. search(): returns true if the given book is present in the list else returns false 5. display(): shows the book collection
Assume you are writing code to maintain a linked list. You are to use a variable named head to always point to the first node in the list and the variable named tail to always point to the last node in the list. Write the Java statements required to accomplish each of the following actions given the Node definition above. For the following questions, provide both the lines of code to accomplish the required task (given the restrictions above), and a diagram showing the state of the linked list after all your lines of code (in each question) have been executed. (a) Create a linked list with just a single node that has the value 5 in it. (b) Create and append a node with the value 10 to the end of the list in la above. (c) Using a loop construct of your choice, provide the lines of code required to add nodes with the values 15, 20, 25, 30, 35 and 40 in that order to the end of the list in 1b above. (d) Add a node with the value 12 to the list in 1c in its proper position assuming the…
Assume you are writing code to maintain a linked list. You are to usea variable named head to always point to the first node in the list and the variable named tail to always point to the last node in the list. Write the Java statements required to accomplish each of the following actions given the Node definition above. For the following questions, provide both the lines of code to accomplish the required task (given the restrictions above), and a diagram showing the state of the linked list after all your lines of code (in each question) have been executed. (a) Create a linked list with just a single node that has the value 5 in it. (b) Create and append a node with the value 10 to the end of the list in 1aabove.(c) Using a loop construct of your choice, provide the lines of code requiredto add nodes with the values 15, 20, 25, 30, 35 and 40 in that order to the end of the list in 1b above. (d) Add a node with the value 12 to the list in 1c in its proper positionassuming the list…
Write a program in C that performs the following tasks: Store the information about books in the library using a linked list structure. Each book should have the following information: book name, author name, ISBN, and publication year. Allow the user to add a new book to the linked list. Allow the user to delete a book from the linked list based on ISBN. Allow the user to search for a book in the linked list based on book name, author name, ISBN or publication year. Display the list of all books in the library. Note: The program should use the linked list implementation for storing the books and should not use any built-in library functions for linked lists.
Exercise 1: Write a program using the java.util.Stack data structure that prompts for an integer and reverses it: 7359 becomes 9537. Hints: Think of how base-10 works: A base-10 number is a sum of digit * 100 + digit * 101 + digit * 102, etc., where each digit in your number is that digit times a power of 10. Using that understanding, you can use modulo and integer arithemetic to get each digit and add it to a stack. Algorithm: Your number % 10 will give you the rightmost number. Example: 7359 % 10 = 9. Put the 9 on the stack. Now substract the 9 from original number: 7359 - 9 = 7350. Now take the 7350/10 to remove the zero. That is 7350 /10 = 735. Repeat the process, that is 735 % 10 = 5, put the 5 on the stack, substract the 5 and divide by 10. 730/10 = 73, use 73 % 10 to get the 3. Keep going, adding digits to the stack until you run out of numbers. When you pop the numbers off your stack, they will come off teh stack reversed. Note…
C++ A robot is initially located at position (0; 0) in a grid [?5; 5] [?5; 5]. The robot can move randomly in any of the directions: up, down, left, right. The robot can only move one step at a time. For each move, print the direction of the move and the current position of the robot. If the robot makes a circle, which means it moves back to the original place, print "Back to the origin!" to the console and stop the program. If it reaches the boundary of the grid, print \Hit the boundary!" to the console and stop the program. A successful run of your code may look like:Down (0,-1)Down (0,-2)Up (0,-1)Left (-1,-1)Left (-2,-1)Up (-2,0)Left (-3,0)Left (-4,0)Left (-5,0)Hit the boundary! or Left (-1,0)Down (-1,-1)Right (0,-1)Up (0,0)Back to the origin! About: This program is to give you practice using the control ow, the random number generator, and output formatting. You may use <iomanip> to format your output. You may NOT use #include "stdafx.h".
1. Using the singly-linked list shown below, and assuming that head references the first Node and tail references the last Node, write statements to do each of the following: a. Insert "Bill" before "Tom". b. Insert "Sue" before "Sam" c. Remove "Bill" d. Remove "Sam" KWSinglelinkedList Node Node Node Node head = size = 4 next = null data = next = next = next = data = data = data = String String String String value = "Tom" value = "Dick" value = "Harry" value = "Sam"
Write a C++ program to create a queue. The size of the queue will be dependent on the user. Insert the numbers in the queue till the queue reaches the size. Create a menu and perform the following function on that queue. Enqueue: Add an element to the end of the queue. Dequeue: Remove an element from the front of the queue. IsEmpty: Check if the queue is empty. IsFull: Check if the queue is full. Peek: Get the value of the front of the queue without removing it.
Write C++ Code to design the GIKI Hostel Registration System. The Registration is only for Mechanical, Electrical and Engineering Sciences Department. The program displays a menu with the following options: Add Department, Delete Department, Allocate Room to New Student if department is added, delete allocation of Student, display the Registration/Allocation of Student with department name, Search if Room is already allocated to any Student. This information is stored in a linked list of names arranged alphabetically. Create a linked list of registration, where each node points to a pointer to the linked list of Student.
1. Write a program that will initially create an UNSORTED list containing the following and then run the program: Mitch Diane Jack Robbie Katherine Answer and explain the following questions below: a) If we check the memory location of each element in the list, what would it be? What index represent each element? b) What happens if we add Morrie in the list? What will be its index value? c) What does the new list look like? Where do you think Morrie should be placed and why? With the same list above (with Morrie added), delete/remove Jack. Answer and explain the following questions below: a) What is the new list? Identify the elements of the list and its index. b) What happened to the former location occupied by Jack?
Write C++ statements for the following tasks: i. Create X point to the link(node) that stores data 21.ii. Create list point to the link containing data14.iii. Create Y point to the last link in the list.iv. Create list point to an empty list.v. Set the value of the link containing 23 to 33.vi. Create and insert the link with data 8 after the link pointed to by X.vii. Delete the link with data 21. Also, deallocate the memory occupied by this link.

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS