605 Topics
 | |
| | Hello everybody I'm a student and having problems with an assignment - I have at the moment no idea how to achieve an appropriate solution. I'm aware that you shouldn't help me by showing some code. That's okay for me since I want to solve it by myself but I … |
 | Hello all. I'm relatively new to libcurl C++, and I have been hopelessly stuck. Bit of a background for this app. It is very legacy, having been made in the early 2000s. LPSTRs abound. It looks in FTPs for files from suppliers (who have an SFTP they interact with and …  |
| | We are tasked to simulate a simple printing queue, where users take turn at printing their files/documents. We just need to put each of user's name, ID, and number of pages and then output the queue in the program. We need to do it by using Queue with Array. So …  |
| | this is my sample code to create a student record using singly linked list queue. my problem is that I want to insert a student number in the struct but it doesn't repeat when I input the same student number. #include <stdio.h> #include <stdlib.h> struct node { char No[12],Name[24],crsysr[10]; float …  |
| | Help, how can I create a MULTILEVEL QUEUE ALGORITHM program? I tried it but it crashes, does not build... It would be okay if its in other language. HERE IS THE SNIPPET CODE SAMPLE (c++): --------------------------------------------- //Enter Number of Process cout<<"\nEnter the number of Processes:"; cin>>n; //INPUT Arrival, Burst, and … |
| | Hi all pls help me with the soln to this probelm, the catch is the interface (menu) needs to be Built in C++ as well. any suggestions would be of great help as well. thanks It is a system written using a structured programming language (e.g. C, Turbo C) that … |
| | I am supposed to sort an array in ascending order..I have tried but then i cant get the results i want.I also tried to look it up in this forum but i still can't get it...Here is part of the code:[ICODE]void sort() { int size=10; int j,temp,i; for(i=0;i<(size-1);i++) { for(j=i+1;j<size;j++) … |
 | Hi, I have a C++ program : // ConsoleApplication14.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <iostream> #include <list> #include <queue> #include <vector> #include <string> using namespace std; class RectangularVectors { public: static std::vector<std::vector<int>> ReturnRectangularIntVector(int size1, int size2) { std::vector<std::vector<int>> newVector(size1); for (int vector1 …  |
 | Algorithm 1) Choose the time quantum and assign it for each process. 2) Allocate the CPU to the process according to the FCFS scheduling. 3) If (burst time of the process < time quantum).{Allocate the CPU to that process till it terminates.}Else {The process will occupy the CPU till the … |
 | Hi yall! I have to create a priority queue with out using built in librarys. I have tried to write a bit of code so far, however I dont know if it works and am a little confused on a few things. What follows this line is the main cpp … |
 | long waitingTime(vector<int> tickets, int p) { // bool flag indicates whether it's Jesse or not queue<pair<int, bool> > aQueue; for(int i = 0; i < tickets.size(); i++) { aQueue.push(make_pair(tickets[i], i == p)); } long long nTime = 1; while(!aQueue.empty()) { pair<int, bool> aItem = aQueue.front(); aQueue.pop(); nTime++; if(aItem.first == 1 … |
 | Hi fellas I'm reading "Teach yourself C++" book by Herbert Schildt to learn C++. there is an example in chapter 10 which is tough to me. this is the code I'm talking about: #include <iostream> #include <cstdlib> #include <cctype> using namespace std; class list { public: list *head; // pointer …  |
| | #include <iostream> #include <iomanip> #include <stack> #include <queue> #include <vector> #include <fstream> using namespace std; class graph { public: graph(); graph(int); //graph(int, int); void setEdge(int src, int dst); void printGraph();//print graph void bfs(int);//Breadth First Search void dfs(int);//Depth First Search void bfsSpan(int);//Breadth First Search Spanning Tree void dfsSpan(int);//DepthFirt Search Spanning Tree … |
| | Hi, I needed some assistance on this program I am working on. First its about putting airplanes into gates, if no gates are open the print airport full. Right now mine simulates all the arrivals and departures. I show it put it will change when I implement the Stack. The … |
 | I'm looking for an algorithm, pseudocode or any langauge, to generate random numbers with the following characteristics: integer values in the range 0-n lower values much more likely to happen than higher values, eg prob of 0 is n/(n(n-1)), prob of n is 1/(n(n-1)) - linear relationship between value and …  |
| | Hi, I would like to learn dbus as i encounter it more in my daily work.The problem is that the applications already using it are very complex and there is very less scope to understand exact use of DBus communication. I know other IPCs like message queue, socket etc, the … |
 | this code is correct expect that part which calculate the waiting time .. it should be 0 in first process but in output it equals the burst time of 1st process. how can i fix it ? #include <iostream> #include<iomanip> #include<queue> using namespace std; int main(){ queue<int> sc; float tat …  |
| | i know it's too much long but i really need some help to fix the program errors , am stuck within whole code lines and ma mind went confused .. it's airport simulation program the airport has one runway .. one plane can land and one plane can fly but … |
 | C++ HELP: hello i made a program where user enter any message then fing its frequency and push it on the queue and sort it i want to sort it again by which element in the same piority entered please anyone can help>? for example for this message: "Eerie eyes … |
| | 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:) |
| | Hello guys, I have a problem with Win32 C++ GUI. I'm creating a program and as one of the steps, I want to: 1. Let the user type somthing in the textbox, 2. Show it in another box/area, 3. Clear the typed text from the textbox. It would be something … |
 | 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 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 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 …  |
| | Hello, I have been learning SDL through a set of tutorials [here](http://lazyfoo.net/tutorials/SDL/index.php). The program was able to bring up the image for each key that I had added. After adding code to omptimize the images the window pops up but shows no image and if I press a key it …  |
 | 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.  |
 | So I've built a Queue data sructure(all the needed methods) and I just wanted to know how can I use my Queue objects in different project ? |
| | 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 …  |
 | [ATTACH=RIGHT]17428[/ATTACH]Almost every programmer knows his name. He's a living legend in computers. His name is Bjarne Stroustrup, and he created the world's most popular programming language, C++. I had a chance to ask him a few questions. The first three of the questions I came up with, and the remainder … |
| | 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. I'm getting the following message when I try to overload operator= here in line 830-833. I have also included the error messages. Thanks #include <iostream> #include <string> #include <limits> #include <vector> #include <iomanip> #include <cstdlib> using namespace std; /** * Global Variables */ string k; int pmem, plen; int …  |
| | 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 … |
 | 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 …  |
The End.