Suppose that a shopkeeper decided that customers who come first will be served first. A list of customers must be maintained so that anyone can be accessed randomly. Your program must remember operations it performed in opposite order. The entries should be managed based on order of arrival and also be deleted when no longer needed. The size of a file is unknown. A list must be maintained so that elements can be added to the beginning or end in O (1). Based on above scenario you have list of different data structures, choose appropriate among them and implement using java. It is important that structure has flexible memory management (Note : The code should be implemented in java programming)

Suppose that a shopkeeper decided that customers who come first will be served first. A list of customers must be maintained so that anyone can be accessed randomly. Your program must remember operations it performed in opposite order. The entries should be managed based on order of arrival and also be deleted when no longer needed. The size of a file is unknown. A list must be maintained so that elements can be added to the beginning or end in O (1). Based on above scenario you have list of different data structures, choose appropriate among them and implement using java. It is important that structure has flexible memory management (Note : The code should be implemented in java programming)

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 6PE

See similar textbooks

Similar questions

Suppose that a shopkeeper decided that customers who come first will be served first. A list of customers must be maintained so that anyone can be accessed randomly. Your program must remember operations it performed in opposite order. The entries should be managed based on order of arrival and also be deleted when no longer needed. The size of a file is unknown. A list must be maintained so that elements can be added to the beginning or end in O (1).Based on above scenario you have list of different data structures, choose appropriate among them and implement using java. It is important that structure has flexible memory management. NOTE: Answer must be in Java Eclipse
An “inverted file” is a critical data structure for implementing applications like the index of a book, or a web search engine. Given a document D (which can be viewed as an unordered, numbered list of words), an inverted file is an ordered list of words L such that for each word W in L, we store the indices of the places in D where W appears. Write a C# program (from scratch please, written by yourself (ask instructor if you are stuck), not borrowed from any other sources) that reads in a list of words separated by spaces from a text file, then uses an efficient O(N) algorithm to create the inverted file index (hint: consider the topic of this chapter, consider using a Dictionary/hashtable to help you), and writes this index out to another file or prints it to the screen. Each line of the output file should start with the next word (the words should be listed in alphabetical order, and this sorting does not have to be part of the O(N) runtime complexity, e.g. you can use regular…
sing good OOP, write a C++ program that will read an input file to manage a list of students waiting to register for a ourse using a linked list. The input file name is WaitList.txt and is located in the current directory of the project. The file layout is as follows: action student name Actions are defined as follows: 1 - add student name to the end of the linked list2 - add student name to the beginning of the linked list3 - delete the student at the beginning of the linked list4 - delete the student at the end of the linked list Actions #1 and #2 require student names. Actions #3 and #4 do not. For example, if the input file contents contained: 1 Sally Sue Student1 Peter Pupil1 Sam Scholar42 Terri Tutor1 Abby Achiever32 Bill Brain The program would display the wait list as follows: The Wait List: 1. Bill Brain2. Sally Sue Student3. Peter Pupil4. Abby Achiever End of List. Then the program will prompt the user if they wish to delete a student by name. If…
Write a program that copies a source file of integers to a destination file, using stream iterators. The user should supply both source and destination filenames to the program. You can use a while loop approach and a list container with integer data type. Within the loop, read each integer value from the input iterator and add the value to the list container by using push_back() function, then increment the input iterator.Finally, use an output iterator to write the list to the destination file
Write a program to process stock data. The stock data should be read from a text file containing the following data: stock code, stock name, amount invested (XXX.XX), shares held, and current price. Sue the internet or your local paper to gather data on at least 20 stocks. As each stock is read, insert it into a doubly linked list. The first logical list should be ordered on the stock code. The second should be ordered on the gain or loss for the stock. Gain or loss is calculated as the current value of the stock (shares held times current price) minus the amount invested. Include at least one loss in your test data. After building the lists, display a menu that allows the user to display either logical list forward or backward (a total of four options). Each display should contain an appropriate heading and column caption. Run your program and submit a list of your input data and a print out of each display option.
Write a python hangman program Modify your program so that the following functionality is added:1. Instead of selecting the word from a hard coded list, incorporate problem2 so that thelist is read from a file, then a word is randomly selected from this list.2. when the game ends, the following information should be outputted to a new file:● the word● the state of the hangman● if the user won or lostExample outputs:quokkaO\||You won!kangarooO\|/|/ \You lost
you will be identifying which organisms are the tastiest. The tastiest organisms are the ones that appear the most times as a food source. For example if aquatic.txt was the input file, file_list will be: ["Bird,Prawn,Mussels,Crab,Limpets,Whelk\n", "Crab,Mussels,Limpets\n", "Fish,Prawn\n", "Limpets,Seaweed\n", "Lobster,Crab,Mussels,Limpets,Whelk\n", "Mussels,Phytoplankton,Zooplankton\n", "Prawn,Zooplankton\n", "Whelk,Limpets,Mussels\n", "Zooplankton,Phytoplankton"] Limpets and mussels appear the most times as a food source, making them the tastiest organisms. Here is a sample output using aquatic.txt: Enter the food web file name: aquatic.txt Predators and Prey: Bird eats Crab, Limpets, Mussels, Prawn, and Whelk Crab eats Limpets and Mussels Fish eats Prawn Limpets eats Seaweed Lobster eats Crab, Limpets, Mussels, and Whelk Mussels eats Phytoplankton and Zooplankton Prawn eats Zooplankton Whelk eats Limpets and Mussels Zooplankton eats Phytoplankton Apex Predators:…
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.
In C++, you are going to write a program that implements a doubly linked list. The data must be read from the files and you can put the file names in your program. With a NEW solution for a like! Letters.txt contains 26 English Letters: Copy the following exactly as it is into own .txt file to test: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Sequence.txt contains a list of numbers. Copy the following exactly as is into another .txt file 3,-3,19,-19,18,1,-2,3,-18,17,1,-3,-13,14 You need to 1. Create a doubly linked list by reading the 26 letters from Letters.txt. 2. Sequence.txt file contains a sequence of relative letter positions. The initial position is at the beginning of the list which is ‘A’. The first number in the sequence is ‘3’. So the currentp osition will move forward for three steps. Then the first letter to output is ‘D’ and now the current position is at ‘D’ as well. The second number in the sequence is ‘-3’. Then the second letter to output is the third…
write a c++ program that implements a doubly linked list. The data must be read from the files and you can put the file names in your program. Letters.txt contains 26 English Letters: A B C D ... Z Sequence.txt contains a list of numbers. 3,-3,19,-19,18,1,-2,3,-18,17,1,-3,-13,14 You need to 1. Create a doubly linked list by reading the 26 letters from Letters.txt. 2. Sequence.txt file contains a sequence of relative letter positions. The initial position is at the beginning of the list which is ‘A’. The first number in the sequence is ‘3’. So the current position will move forward for three steps. Then the first letter to output is ‘D’ and now the current position is at ‘D’ as well. The second number in the sequence is ‘-3’. Then the second letter to output is the third element backward from the current position which is ‘A’. You need to output all letters indicated in sequence.txt Your need to 1. Create a doubly linked list 2. Implement putItem() method and use this method to create…
Write a c++ program that reads in input commands related to a queue with no more than ten elements and performs the specified operations. Note that you should create three files, one for the main, one for Queue.h, and one for Queue.cpp. Those commands are: 'E', which will be followed by a number. You should enqueue that number 'D', which will dequeue the value from the front of the queue and print it, followed by a new line 'K'. which will peek at the value at the front of the queue and print it, followed by a new line 'Q', which will quit the program You can assume that all the input is valid.
Write a C program mexp that multiplies a square matrix by itself a specified number of times. mexp takes a single argument, which is the path to a file containing a square (k × k) matrix M and a non-negative exponent n. It computes Mn and prints the result. Note that the size of the matrix is not known statically. You must use malloc to allocate space for the matrix once you obtain its size from the input file.To compute Mn , it is sufficient to multiply M by itself n −1 times. That is, M3 = M ×M ×M . Naturally, a different strategy is needed for M0 .Input format The first line of the input file contains an integer k. This indicates the size of the matrix M , which has k rows and k columns.The next k lines in the input file contain k integers. These indicate the content of M. Each line corresponds to a row, beginning with the first (top) row.The final line contains an integer n. This indicates the number of times M will be multiplied by itself. n is guaranteed to be non-negative, but…