Problem: AA class octopus has a dummy head which has four pointers – left, right, top and bottom. You have tobuild link list in these 4 directions depending on the input commands. There will be four types of commands- L, R, T and B. Their specifications are given below:Lx: insert x in the left link listRx: insert x in the right link listT x: insert x in the top link list// Where x is an integer number.Bx: insert x in the bottom link listInput: Test case will start with a number n indicating the number of lines following it.Output: you have to give output that which link list (Left, Right, Top and Bottom) has maximum sum ofvalues. See the sampland output.Нead17313Sample inputSample outputRight Link List Has Maximum Sum 3214L 3L 15L 1R 17T 9T 10В 13T 5R 3В 2В ЗВ 4∞31 N34H H M H LR R BBB

Problem: A A class octopus has a dummy head which has four pointers left, right, top and bottom. You have to build link list in these 4 directions depending on the input commands. There will be four types of commands -L, R, T and B. Their specifications are given below: L x: insert x in the left link list Rx: insert x in the right link list Tx: insert x in the top link list Bx: insert x in the bottom link list // Where x is an integer number. Input: Test case will start with a number n indicating the number of lines following it. Output: you have to give output that which link list (Left, Right, Top and Bottom) has maximum sum of values. See the sample input and output.

Problem: A A class octopus has a dummy head which has four pointers left, right, top and bottom. You have to build link list in these 4 directions depending on the input commands. There will be four types of commands -L, R, T and B. Their specifications are given below: L x: insert x in the left link list Rx: insert x in the right link list Tx: insert x in the top link list Bx: insert x in the bottom link list // Where x is an integer number. Input: Test case will start with a number n indicating the number of lines following it. Output: you have to give output that which link list (Left, Right, Top and Bottom) has maximum sum of values. See the sample input and output.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

An actual working program in C that transfers contents of a file into a linked list and then performs insertion, updation, deletion and search operation on the contents of the file through a linked list. The contents of the file should be treated as a string. And all operations performed on the linked list should reflect on the file. The format of the file is: 112.22.33.44 Baker 101.32.11.23 Parson and so on.. and each line in the file should be treated as a string.
I need answer question pls Project Operations Write a JAVA program that will maintain a phone directory using a Linked-List. The program should be able to perform the following operations: 1) Add persons details (first name, last name, phone number, city, address, sex and email) to the phone directory, where phone numbers in the directory have to be unique. (Note: each person record will store in one node in the linked-list and insert each person to the last) 2) Delete any person details by a given phone number. 3) Update telephone number by providing person first name. 4) Display all details of persons from a phone directory. 5) Search telephone number based on person first name. (Note: use sequential search to find all telephones for the given first name) 6) Sort all persons in the phone directory ascending based on person first name. (Note: use bubble or selection sort to arrange the entire phone directory) Project Outputs The output has to display a menu of choices. Then the…
Write down a C++ program to implement the link list in the following way. a) Create an array taking 10 values from the user.b) Create a link list and fill it (insert nodes) with the array values.c) Display the link listd) Run the 9 commands given in the table on slide 9.e) Create functions for the following and implement these in order(i) Insert a new node in front of the list and display the list.(ii) Insert a new node at the end of the list and display the list(iii) Delete the first node from the list and display the list.(iv) Search for a value in the list (user entered). Note: The program must be well structured and properly commented.
Create a complete linked list program using C++ and create the following following list: The required output:Name: CloudAge: 19Gender: MaleName: AerisAge: 18Gender: FemaleName: BarretAge: 24Gender: MaleName: YuffieAge: 17Gender: FemaleName: TifaAge: 19Gender: Female
Assume that, you have a Linked List class "LL" with a function named "fun1". You can assume that "value" is the value of the nodes and "Next" is the next pointer of the node. You created an instance of the LL class, named "L1", where "head" is the head node. And you inserted the following numbers: 31 -> 32 -> 43 -> 17 -> 34 -> 57 ->91. What will be the output of the linked list L1 after the "fun1" operation to it?* 31 -> 32 -> 43 -> 17 -> 34 -> 57 ->91 31 -> 32 -> 17 -> 34 -> 57 ->91 31 -> 32 -> 43 -> 17 -> 57 ->91 31 -> 32 -> 43 -> 17 -> 34 -> 57 31 -> 32 -> 43 -> 57 ->91 31 -> 32 -> 43 -> 34 -> 57 ->91
Write a script using PHP that takes a link from the user and parses through its associated web page to print a list of every link embedded on that site. This program must work recursively, so for each link that gets printed, the program should automatically take each of those links as a new input and do the same for them until there are no more links left. If the same link exists twice on the same page, or if it exists on more than one page, the program should ignore all duplicate instances of the link.
Question : Write a c++ program which creates a Linked List having maximum sum out of two Sorted Linked Lists. Use this : LinkedList finalMaxSumList(LinkedList List1, LinkedList List2); For eg: You have two sorted linked lists, create a linked list that contains data with maximum sum. The resulting list with maximum sum will contain nodes with data from both input sorted lists. While creating the resulting list with maximum sum, we may switch to the other input list only at the point of intersection (which mean the two nodes with the same value in the lists). You are only allowed to use O(1) extra space. Note: You have to returned Linked List which contain finalMaxSumList and you are not allowed to change in data type and prototype of the Function. Input:List1 = 1->3->30->90->120->240->511List2 = 0->3->12->32->90->125->240->249 Returned LinkedList: Following is resulting linked list out of two sorted listsResultingList =…
For the following problems, you need to submit a python code that performs the required functions. Q1: (Stack & Queue) 1. Write a program that utilizes the LinkedStack class and LinkedQueue class to perform the following function. Input :empty stack and a Queue Required: reverse the order of the queue. // you must use the methods of the stack and queue class // Q2) Write a member functions to the class ( CircularQueue ) that performs the followings: 1. Sum-even(CQ) : Print the sum of all even numbers stored in CircularQueue. 2. Perform the followings: a. Create two circular linked lists ( CQ1, CQ2). b. Merge the two circular linked lists in one →CQ1. //Remember: you need to use the class ( CircularQueue ) methods.//
C PROGRAMMING. using the following program as a start point: /* * NetworkServer.c * ProgrammingPortfolio Skeleton * */ /* You will need to include these header files to be able to implement the TCP/IP functions */#include <stdio.h>#include <stdlib.h>#include <string.h>#include <sys/types.h>#include <netinet/in.h>#include <netdb.h>#include <fcntl.h>#include <unistd.h>#include <errno.h>#include <sys/socket.h> /* You will also need to add #include for your graph library header files */ int main(int argc, const char * argv[]){ int serverSocket = -1; printf("Programming Portfolio 2022 Implementation\n"); printf("=========================================\n\n"); /* Insert your code here to create, and the TCP/IP socket for the Network Server * * Then once a connection has been accepted implement protocol */ TASK: you are to write a TCP/IP server that can build up a graph of a network ofnetworks…
Question : Write a c++ program which creates a Linked List having maximum sum out of two Sorted Linked Lists.For eg: You have two sorted linked lists, create a linked list that contains data with maximum sum. The resulting list with maximum sum will contain nodes with data from both input sorted lists. While creating the resulting list with maximum sum, we may switch to the other input list only at the point of intersection (which mean the two nodes with the same value in the lists). You are only allowed to use O(1) extra space. Input:List1 = 1->3->30->90->120->240->511List2 = 0->3->12->32->90->125->240->249 Output: Following is resulting linked list out of two sorted listsResultingList = 1->3->12->32->90->125->240->511
6.Need ri Write a JAVA program that will maintain a phone directory using a Linked-List. The program should be able to perform the following operations: Add persons details (first name, last name, phone number, city, address, sex and email) to the phone directory, where phone numbers in the directory have to be unique. (Note: each person record will store in one node in the linked-list and insert each person to the last) Delete any person details by a given phone number. Update telephone number by providing person first name. Display all details of persons from a phone directory. Search telephone number based on person first name. (Note: use sequential search to find all telephones for the given first name) Sort all persons in the phone directory ascending based on person first name. (Note: use bubble or selection sort to arrange the entire phone directory.
Computer Science Describe a situation where you may wish to create a link list of ITERATORS. Is it possible to create a link list of various types of iterators? For example a list with list iterators, map iterators, and set iterators?