Write a program that opens two text files and reads their contents into two separate queues. The program should then determine whether the files are identical by comparing the characters in the queues. When two nonidentical characters are encountered, the program should display a message indicating that the files are not the same. If both queues contain the same set of characters, a message should be displayed indicating that the files are identical. Sample Run Suppose we have two files with the smae text: This is my text file. The output is: The files are identical. file1.txt: This is my text file. file2.txt: This is another text file. The output is: The files are not identical.

Write a program that opens two text files and reads their contents into two separate queues. The program should then determine whether the files are identical by comparing the characters in the queues. When two nonidentical characters are encountered, the program should display a message indicating that the files are not the same. If both queues contain the same set of characters, a message should be displayed indicating that the files are identical. Sample Run Suppose we have two files with the smae text: This is my text file. The output is: The files are identical. file1.txt: This is my text file. file2.txt: This is another text file. The output is: The files are not identical.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Write a program that opens a text file (name the textfile “problem4.txt”) and reads its contents into a queue of characters. The user must then enter a character they are looking for. The program should then dequeue each character and count the number of characters that are equal to what the user is looking for. Output the count of the character or lack thereof in a second file (name the textfile “resultsp4.txt”). in C++
In this lab the task is to write a program that maintains a personal phone book. The program allows to: ▪ Add and Delete entries from the phone book, ▪ Search the phone book for a specific entry by last name or by phone number, and ▪ Print out the entire entries in the phone book. The data in the phone book is maintained by storing in memory with the use of a singly linked list, with one list node per entry. Each node contains members for storing a person’s family name, first name, address, and the phone number. Use strings to store this information. The linked list must be kept in increasing alphabetical order, sorted by family name. There are no duplicate entries with the same family name allowed in the phone book. This program should be menu driven, with the user being offered a choice of the following commands described below: ▪ Insert a new entry into the phone book. The program should prompt the user for a new family name and first name, an address and a phone number. This…
Given the queue myData 12, 24, 36 (front is 12), what is the result of the following operations? Enqueue(myData, 48)Enqueue(myData, 60)Dequeue(myData)print(Peek(myData))print(IsEmpty(myData))
Implement the Round Robin Scheduler as described in attached notes “Round Robin SchedulerExample.pdf” using queue (you can use either ArrayQueue or LinkedQueue), based on theprovided starter Python code “robin_scheduler.py”. In the starter file, three tasks have alreadybeen set in a tasks list according to the example in the attached document. You are only asked tocomplete the method “scheduling”. Once you finish your code based on the starter code and runit, the output should be same as bellow. You should test your code using more examples.
Write a function to remove the item that immediately comes before in item X from an integer queue if the item X is repeated then you should remove all the items immediately comes before it don't use different data structures this is the code and its output, is there a way to rephrase this code please ? ( #include<iostream>#include<queue>using namespace std;void fill(queue<int>&q,int z){for(int i=0; i<z; i++)q.push(rand()% 20+1);}void print(queue<int> q){int item;while(!q.empty()){item =q.front();cout<<item<<"\t";q.pop();}cout<<endl<<endl;}void removeBefore(queue<int> &q, int x){queue<int>temp;int item ,prev;while(!q.empty()){prev =q.front();q.pop();int c= q.size();if(q.empty()){q.push(prev);break;}item =q.front();if(item != x)temp.push(prev);if(c == 1){q.pop();temp.push(item);}}while(!temp.empty()){item = temp.front();q.push(item);temp.pop();}}main(){queue<int>q;fill(q, 10);print(q);int x;cout<<"please…
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 user can select which operation want to perform.…
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Write a program that reads 10 integers anddisplays them in the reverse of the order in which they were read. If two consecutivenumbers are identical, then only display one of them. Implement yourprogram using only stack and not arrays or queues.
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…
Write a program that takes as input an arithmetic expression. The program outputs whether the expression contains matching grouping symbols (brackets and parentheses). For example, the arithmetic expressions {25 + (3 – 6) * 8} and 7 + 8 * 2 contains matching grouping symbols. However, the expression 5 + {(13 + 7) / 8 - 2 * 9 does not contain matching grouping symbols. You must use a stack and/or queue. USE THE FOLLOWING DATA FILE //Header file: stackADT.h #ifndef H_StackADT#define H_StackADT template <class Type>class stackADT{public:virtual void initializeStack() = 0;//Method to initialize the stack to an empty state.//Postcondition: Stack is emptyvirtual bool isEmptyStack() const = 0;//Function to determine whether the stack is empty.//Postcondition: Returns true if the stack is empty,// otherwise returns false.virtual bool isFullStack() const = 0;//Function to determine whether the stack is full.//Postcondition: Returns true if the stack is full,// otherwise returns…
Write a stack client Parentheses that reads in a text stream from standard inputand uses a stack to determine whether its parentheses are properly balanced. For example, your program should print true for [()]{}{[()()]()} and false for [(]).
in JAVA write an ADT for a library management system which stores the title (string), author (string), ISBN (string), list price (positive integers), edition (numbers), and publisher (string). Then implement the method swap but remove the assumption that the ith and jth items in the list exist. Throw an exception ListindexoutOfBoundsException ifiorj isoutofrange