1,051 Topics
Everytime I try to start a new topic at programmingforums.org I see this message: Xandy, you do not have permission to access this page. This could be due to one of several reasons: Your user account may not have sufficient privileges to access this page. Are you trying to edit …
i am working on an infix to postfix project and have reached a troubling point. one by one i must extract a string token from the string being inputted to the method infixtopostfix and one by one input them to the front of the deque named postfix. i dont understand …
how can I implement stack with one queue? the queue only can enqueue and dequeue
This is my last question over my current running project. For some reason, when i call my object in my main program it gives me errors. If I try to call it as: Checkout_Simulation sim_obj; Then I get errors: Checkout_Simulation.cpp:16: error: missing template arguments before ‘sim_obj’ Checkout_Simulation.cpp:16: error: expected `;' …
Hi I am wondering how you would create a program for the knight tour instead of using recursion using a stack. I just want the ideal behind using a stack/queue instead of recursion please no code:)
A freight train has n railroad cars, each of which is going to be left at a di erent station. Assume that the stations are numbered 0 through n
write a c++ program that will do the . Enter 10 integer . Pushing on stack and poping on user choice . pushing on queue and poping form queue . Bring the integer in order. Display the calculator selecting oprtion by user choice (+,-,*,%)
PLease write a better code which is rather advance form using #include<queue> && #include<list> #include<iostream> #include<conio.h> #include <iomanip.h> using namespace std; const int size=20; // Patient Class class Patient { int age; char name[30],phy; public: Patient() { age=0; strcpy(name,""); phy=NULL; } void SetName(char* P_name) { strcpy(name,P_name); } void SetAge(int P_age) …
I can't get it to compile. I've tried so many things. The errors |29|error: expected unqualified-id before '{' token| |266|error: expected '}' at end of input| |266|error: expected unqualified-id at end of input| ||=== Build failed: 3 error(s), 0 warning(s) (0 minute(s), 0 second(s)) ===| Here is the code` #include …
Hey everyone, I have an assignment for tomorrow and I don't have any clue about this last question. "Q5- Consider a waiting queue in a bank with customers who are issued direction slips. They are asked to move to following service terminals depending on their customer numbers being divided by …
Simulate a patient’s lines using queues with enqueue ( ), dequeue ( ) and printQueue ( ) operations. Define a queue node in the following manner: typedef struct queueNode { int patientID; // Unique identifier; starts at 1; after 24 hours should be reset to 1 int checkupTime; // Random …
I need a maze solver that uses queue type breadth first search to find a way out of the maze and print it out. I already made a dfs one but i cant seem to figure out how to make a bfs one. Here it is: #include <stdio.h> #define red …
//I need help on where to go from here, mostly in the main. //The instructions and requirements can be found in the attachment. /********************************* Queue header file ********************************/ #ifndef QUEUE_H #define QUEUE_H #include <iostream> using namespace std; class Queue { private: class QueueNode { friend class Queue; int value; QueueNode …
//Hi all,can someone help with this problem //I am stack,need to output all functions in main,with user input for queue and stack,but first queue //This is my .h and .cpp of queue #include "stdafx.h" template <class ItemType> struct NodeType; template <class ItemType> class QueType { public: QueType(); // Class constructor. …
I am writing code to simulate a queue at a bank, which calculates the average wait time of all customers that enter the queue. I'm getting a STATUS_ACCESS_VIOLATION at line 56 of program3.cpp. I've had this error before and I'm pretty sure it happens because of an attempt to act …
The simulator will simulate one or more line-ups for customer service at a business. In the default setup, it will take between 1 and 6 minutes for a customer service request to be handled (random) once a customer reaches the front of the queue, after which the customer will leave. …
Hello All, I want to write a c++ code to sort a queue with the help of another queue and a non array element. Please help me getting the code.
#include<iostream> #include<conio.h> #include<string> using namespace std; struct node{ char data; node * next; }; void queue1(); void queue2(); void queue3(); void queue4(); void concatenate(); node * firstnodeptr1=NULL; node * lastnodeptr=NULL; node * firstnodeptr2=NULL; node * firstnodeptr3=NULL; node * firstnodeptr4=NULL; node *finalfirstnodeptr=NULL; int counter1=1,counter2=1,counter3=1,counter4=1; void main(){ char ch; do{ cout<<"enter the …
prog6.h #include "340.h" #include "binTree.h" #ifndef H_PROG6 #define H_PROG6 const vector < int > A{ 1, -2, 3, -4, 5, -6, 7, -8, 9, -10, 11, -12, 13, -14, 15 }; const vector < float > B{ 0.5, 1.75, -3, 4.25, 5.50, -6.75, 8, 9.25, -10.5 }; const vector < …
I am using a priority queue with a double as the priority. I am guessing this is cause so issues. I used these numbers first with no issues. 34.365681 34.481879 34.539832 36.715120 I then used these numbers and had a segmentation fault. 45.411042 40.481879 37.702110 38.951187 struct PRIORITYQUEUE { int …
I was reading this example of Priority queues and have several questions. http://matrixsust.blogspot.com/2011/11/basic-priority-queue-in-c.html #include<stdio.h> #include<malloc.h> void insert(); void del(); void display(); //How exactly do structs in structs work? Do you need to do anything special with them? Is this a //form of a linked list? Which part of this is …
I need a C++ program to implement a heap based priority queue which accepts job ID, priority number and submitter name as inputs. the program should heap sort whenever a new job ID or priority or submitter name is entered. The jobs that have maximum priority should be extracted (along …
Below is my queue code. Whenever I enter nos. 1 to 8, it will print 1-7 then replace 8 with 0. If there are any other mistakes in my code please let me know. import java.util.Arrays; import java.util.Scanner; public class Queue { private int[] elements; //integer values from scanner private …
Write a program that reads a line of text, changes each uppercase letter to the lowercase, and places in a queue and onto a stack. The program should then verify whether the line of text is a palindrome.
Hi guys, Got a bit of a dilemma, I just recently discovered my VPS was sending spam, this was brought to my attention by my hosting company. And sure enough I went to check the mail queue log in my control panel, I'm using plesk btw, and it failed to …
Hi, I want to disable other textboxes, which is related to single (i.e.connection type) texbox and the textbox are assigned in array[] row wise manner. This is working for sinle row but when I add multiple it's not working. Please help to resolve this issue. <button type="button" class="btn btn-info" id="delete">- …
This program hangs when I enter the number of vertices only..It does nothing..I am not able to figure out what's wrong with this.Please help #include<iostream> #include <list> using namespace std; // This class represents a directed graph using adjacency list representation class Graph { int V; // No. of vertices …
Supposed I want to build a Queue using a LinkedList structure how would I go about doing this. I'm only allowed to use offer(), remove() or poll(), isEmpty() and size() methods, how do I implement a method to add items onto the queue?
Hi Friends! I have tried to find all possible paths between two nodes; #include <iostream> #include <vector> #include <queue> #include <map> #include "fstream" #define max_edges 16 #define MAX_NODES 5 using namespace std; bool isadjacency_node_not_present_in_current_path(int node,vector<int>pathway); int findpaths(int source ,int target ); void display_all_paths_map(); vector<vector<int> >GRAPH(100); vector<int>pathway; map<int,vector<int>> allpathsmap; map<int,vector<int>>:: iterator …
Hi. Can someone tell me how to output a two-dimensional priority queue please? In particular I am using an array of priority queues. The method I use to output an array of vectors is not working. I will show the one that is working (array of vectors): if(!diskQueues[i].empty()) { for …
|29|error: expected unqualified-id before ‘{’ token| |27|error: new types may not be defined in a return type| |27|note: (perhaps a semicolon is missing after the definition of ‘DynStack<T>::StackNode’)| 46|error: ‘StackNode’ does not name a type| ||In member function ‘DynStack<T>::StackNode DynStack<T>::StackNode(T, DynStack<T>::StackNode*)’:| |40|error: ‘value’ was not declared in this scope| ||In …
i am working in a bank and am working on project to write a program that will work on touch screen kiosk and make customer flow management easier but i don know what programing language i can you and how can i do it , and what algorithm to use …
My data is going in to the queue just fine, but when I go to print the data nothing happens. How do I pull the data from the priority queue heap to print? NOTE: The heap implementation cannot be altered. /** ADT priority queue: Heap-based implementation. Listing 17-3. @file Heap_PriorityQueue.h …
Hi. I want to output all of the processes in the printer queue here, and I'm not able to figure out quite how to do that. The only process that shows up is the last one I entered. For instance, if I put a process into printer queue 1 and …
Hello all, I just want to make sure if my answer to this question is right or no. If no please help me solve it. Thanks in advance. Here is the problem: What is the output of the following psuedocode num1 = 5 num2 = 1 num3 = 4 aQueue.enqueue(num2) …
Hi. I'm having a problem accessing a function of an object which I put into a vector. When I try to read the vector at lines 503-506 , I get an output of whatever number I set my setTau() function, instead of the correct number. The beginning value for the …
Question:write a function append that takes as input two queues Q1 and Q2, appends the content of Q2 to Q1 and returns Q1. The protoype of the function is: queue<float> append(queue<float> Q1, queue<float> Q2); My problem here im completly stuck i do not understand how to work it. here are …
Is there a way to sort a vector with a class that has an int variable? I want to have my vector sorted and printed in console. I want to be able to sort the vectors. Say i create a bunch of vectors here on user input `vector<PCB> Disks2[DiskDevices];` Basically …
Is there a way to mimic creating multiple queues like this but with priority queue? This is what i have but i want to now use a priority queue. queue<PCB> Disks[DiskDevices]; I tried this but it doesnt work. priority_queue<PCB> DisksTest[DiskDevices]; It wont compile? What am i doing wrong?
Here is the question: Write a program that creates a queue of Strings and allows the input of an integer value n, followed by n names to be placed in the queue. Then the program should execute a loop that performs the following: 1 It displays the name in the …
please give me a code of multiple linked queue in data structure using c++
// This program uses the a queue template to create a queue of strings. #include <iomanip> #include <iostream> #include <cstdlib> using namespace std; // // TO CREATE A "template" class named "T" template <class T> // // TO CREATE A CLASS NAMED "Dynque" class Dynque { private: struct QueueNode { …
hi so why isnt queue printing anything where it should? #include<iostream> #include<string> using namespace std; template<class ItemType> struct NodeType { ItemType info; NodeType* next; }; template<class ItemType> class Queue { private: int size; NodeType<ItemType>* front; // It points to the front of a singly-linked list NodeType<ItemType>* rear; // It points …
Hi. Why am I getting different output when I call the calculate() function? The output on line 184 gives 1.0001, while the output from line 433 gives 1. Thanks. #include <iostream> #include <string> #include <limits> #include <vector> #include <iomanip> using namespace std; /** * Global Variables */ string k; int …
Suppose I have the following generic classes; Queue<T> KellysCoffee CheckOut and the following generic interfaces QueueInterface OrderLineInterface Suppose I want `KellysCoffee` to extend Queue class and implement `OrderLineInterface` This is how I've done it private class KellyCoffee<Order extends Queue<Order>> implements OrderLineInterface{} Now when I try to implement `CheckOut` public class …
program that implements an event-driven simulation of a line of customers at a bank.Each customer enters a queue, waits until reaching the front of the queue, performs a transaction with a teller (bank employee), and then leaves the bank. You may assume that the bank has only one queue and …
I need a help in generating ideas to create a program using stack+queue. Real life example of stack+queue is needed. Pleaseeeee?
I'm having trouble displying the contents of a queue. When I pop the queue here: for( int i = 0; i < diskQueue.size() + 1; i++ ) { cout << left << setw(0) << "--d" << i+1 << left << setw(4) << " " << left << setw(14) << diskQueue.front().getFilename() …
Hi. I'm trying to access some data in a List using an Iterator, but I'm getting an error message: #include <iostream> #include <list> #include <string> #include <iomanip> using namespace std; /** * Global Variables */ int printer; int disk; int cd; int num; string k; int pmem, plen; int dmem, …
Hi. Can someone tell me why the following code is giving me an error message? Thank you. #include <iostream> #include <list> #include <string> #include <iomanip> using namespace std; /** * Global Variables */ int printer; int disk; int cd; int num; string k; int pmem, plen; int dmem, dlen; int …
The End.