C++ :: Increase Sizes Of Queue In A Vector Of Queues And Find Shortest Queue
Feb 20, 2013
I have a paradigm in a loop of queues of a vector,if a condition is true,increase sizes of the queue of that particular queue in the loop of queues, if condition is false, the queuesize is left as such in loop of queues. After this operation i need to search the queue sizes of all queues and enqueue in the shortest queue.
I want to do something like the code given below
#include <vector>
#include <queue>
int min_index = 0;
std::vector<std::queue<int> > q
std::size_t size = q.size();
[Code] ....
How to implement this logic?
will q[i].size=q[i].size+5 increase the queuesize by 5 for the ith queue?
View 12 Replies
ADVERTISEMENT
Feb 15, 2013
I have a paradigm where a integer before gets enqueued to a queue in a vector, the loop of queues is searched and integer is enqueued to a queue which has minimum size among the queues. the following code shows the operation
#include <vector>
#include <queue>
std::vector<std::queue<int> > q
[Code].....
next i am trying to extend my paradigm with the condition, that the integers should be enqueued to the shortest queue until the count of the shortest queue is less than or equal to count of any another queues in the loop of queues.
i want to do something like the code shown below
#include <vector>
#include <queue>
std::vector<std::queue<int> > q
[Code].....
View 4 Replies
View Related
Mar 7, 2013
I am trying to implement a Task scheduler where i have n number of tasks. The Idea behind my task scheduler is that in a loop of queues of a vector, task should get enqueued to the shortest queue among the loop of queues, which is done by the following code.
#include <vector>
#include <queue>
std::vector<std::queue<int> > q
int min_index = 0;
task t // implemented in the other part of the program
[Code] ....
Next i am trying to extend this paradigm to reduce the overhead time of the scheduler, Instead of searching the shortest queue every time, search after some condition ie. search the shortest queue after 5 tasks gets enqueued to the shortest queue.
i need to do something like this
#include <vector>
#include <queue>
std::vector<std::queue<int> > q
task t // implemented in the other part of the program
while(q[min_index].size()!=q[min_index].size()+5) // check whether current min_index queue's size is increased 5 more times if not goto enqueue
[code].....
View 1 Replies
View Related
Mar 1, 2015
There appears to be some kind of error in by removeMin() function. Inserting items seems to work just fine but attempting to remove any items gives me the error "vector subscript out of range".
Here is my SortedPQ class... Below it you will find the quicksort implementation, in case looking at it is necessary.
template <class Type>
class SortedPQ {
private:
int front;
int rear;
vector<Type> V;
public:
SortedPQ(void) : front(-1), rear(-1), V(0){}
[Code] ....
View 1 Replies
View Related
Aug 7, 2014
I'm trying to use a priority queue sorting in reverse order to take a vector or 2d array. The problem is that I want to sort by the vector/array cell value but keep the reference to the vector/array index of the value. I don't know quite howto keep them both related so when I pop. I can find the corresponding cell.
priority_queue<int, vector<int>, greater<int> > Open;
View 2 Replies
View Related
Nov 28, 2014
How to build a FiFO queue without using the STL (done that no problem), get it to dequeue (again, done that no problem). However, to get those extra marks, I need to be able to order it using a priority system.
I've tried ordering the NodeDequeue class that I'll show at the bottom of this post, but I just cannot get it to order appropriately. The closest I have got is everything in order but I lose a Node from the memory completely. So, that's no good.
The most logical idea I have thought of right now is to send the largest number to the back of the queue each time it's iterated, eventually, the largest number will end up at the front.
class PriorityQueue : public Queue {
public:
Node* NodeDequeue(void) {
Node* tmp = front;
Node* seek = tmp->getPrev();
[Code] .....
View 3 Replies
View Related
Jan 20, 2013
I have the following code which will find the minimum size queue among a vector of queues and the minimimum size queue will enqueue(push) the int
std::vector<std::queue<int> > q
void enqueue(){
int min_index = 1;
std::size_t size = q.size();
for( i=2; i<size; i++) //accessing loop of queues
if(q[min_index].size() > q[i].size())
min_index = i; // Now q[min_index] is the shortest queue
q[min_index].push(int)
}
Now my another paradigm is to do the dequeue(pop) operation in another function(shown below), bt i need to access all vector of queues declared in enqueue() function. how can i access the loop of queues given in the enqueue() function?
void dequeue(){
//q.pop operation , access all the queues in the loop of queues
}
willq[i].pop(int);
Access all the queues in the enqueue function and does the pop operation?
View 1 Replies
View Related
Feb 14, 2013
i have a paradigm where a integer before gets enqueued to a queue, the loop of queues in a vector is searched and integer is enqueued to a queue which has minimum size among the queues. the following code shows the operation.
#include <vector>
#include <queue>
std::vector<std::queue<int> > q
int min_index = 0;
std::size_t size = q.size();
for( i=0; i<size; i++){ //accessing loop of queues
if(q[min_index].size() > q[i].size())
min_index = i; // Now q[min_index] is the shortest queue}
q[min_index].push(int)
next i am trying to extend my paradigm with that the condition the integers should be enqueued to the shortest queue until it becomes maximum size among the queues.
do{
q[min_index].push(int)
} while(q[min_index].size > queue sizes in the vector loop except this queue )
how to search the loop of queues of vector in the while ()
View 13 Replies
View Related
Aug 17, 2014
I'm having a problem with removing an item from a queue. At first in the debugger I got SIGTRAP but I don't get it anymore but the problem still exists. When you try to remove an item from the queue the first nothing happens. Here's the code below compile it and you see what I'm talking about.
Code:
#include <stdio.h>
#include <stdlib.h>
struct Node {
char let;
struct Node *nextNode;
};
[code]....
View 12 Replies
View Related
Mar 12, 2014
I have an assignment that needs to display the names of customers to be served according to a sequence. coding to display the names accordingly?
Code:
#include <stdio.h>
#include <stdlib.h>
#define MAXIMUM 20
void create();
[Code].....
This is my output. I have trouble displaying the names of the customers as it outputs null when I try to display my position in queue.
View 4 Replies
View Related
Apr 11, 2013
Why is this code not marking that the queue is full.. I'm just including my Add function that verifies if they want to add another number to the queue. The isFull function works fine, have used it on other programs.
template <class T> //Template currSize function
int Queue<T> :: currSize ()
{
return (rear - front + arraylength) % arraylength; //
[Code].....
The output goes all the way down to 1 spot left, lets the user enter the last element. Then it asks if they want to add another.. At this point, when they hit Y, it lets them add it and it says there are 5 spots left!
View 8 Replies
View Related
Jan 19, 2013
I'm trying to implement Prim's Algorithm and for that I need to have a decreaseKey method for a priority queue (to update the key value in a priority queue). Can I implement this in the STL Priority Queue?
This is the algorithm I'm following:
for each vertex u in graph G
set key of u to INFINITY
set parent of u to NIL
set key of source vertex to 0
en-queue to priority queue Q all vertices in graph
[Code] .....
View 1 Replies
View Related
Nov 4, 2013
I've got a priority queue of items who, from time to time, returns a different comparison result. Any way to re-sort a priority queue who is storing them?
Example:
#include <cstdlib>
struct Random {
bool operator<(const Random&) const { return !(rand()&1); } };
View 10 Replies
View Related
Dec 4, 2013
I've been working on a little project and hit a snag. I'm using nodes for a queue and stack class that were created using an existing list node class. I create an object for a student class and I want to enqueue that object.
int main() {
Queue sLine;
Customer stu;
Queue<Student &>
cLine.enqueue(cust);
}
That's basically the coding of it in main. However when I follow the error which says uninitialized reference member ListNode<Student& info>::data;
#ifndef LISTND_H
#define LISTND_H
template< class T > class List;
template< class NODETYPE >
class ListNode {
friend class List< NODETYPE >;
[Code] .....
What I may have been doing wrong? Trying to work within certain contexts.
View 2 Replies
View Related
Dec 3, 2013
Is there any possible way to create an STL queue of arrays? I tried
queue<int[]>q;
It didn't work?
View 2 Replies
View Related
Feb 18, 2013
what is the empty state of queue?
View 5 Replies
View Related
Nov 30, 2014
Write a program to simulate a printer queue (priority queue or heap – Bentley article has code) where 3 printers are “fed” by this queue. Each print job has an unchanging priority and higher priority jobs go first (although once started, a job isn't stopped to let a higher one go). For each unit of time, there is a 26% probability that a job will be added to the queue and all jobs take 8 time units to complete. Print job priorities are between 5 and 100. The queue opens 20 time units prior to the start of printing for adding print “jobs”. A print “day” is 1000 time units. The output from your program is:
1) A list of jobs completed with their priorities for each printer
2) A list of jobs not completed (if any).
#include <iostream>
#include <cstdio>
#include <cstring>
[Code].....
View 1 Replies
View Related
Dec 6, 2014
while the prog. running compiler say " access violation .. "
this my code ...
solved :just forget to make r=NULL ; rf =NUll ; frontm=NUll; frontf=NULL ;
#include <iostream>
#include<conio>
struct stu{
int id;
float gba ;
char gender ;
stu *next ;
}*r ,*rf ;
stu read()
[code]....
View 2 Replies
View Related
Mar 13, 2014
I have encountered errors when trying to display the customers' names in a priority queue.
#include <stdio.h>
#include <stdlib.h>
#define MAXIMUM 20
void create();
void priority_insert(int data);
void check(int data);
[code]....
I have gotten the following output:
Peter
Peter
<Null>
How do I correct my coding to display like below:
John
Peter
View 1 Replies
View Related
Feb 21, 2014
my code is already finished. im using parallel queues and im having problem in the queue customer name if i dont input space the code is fine but if i input space in the name it skips the bagcode and immediately jump to the number of bags what can i do to include the white spaces in the customer name and push it to the queue?
here's my code
#include <iostream>
#include <string>
#include <queue>
#include<conio.h>
using namespace std;
int main() {
queue<string> customer;
[code].....
View 3 Replies
View Related
Feb 1, 2015
Here is the assignment I get:
Write an email simulator that processes mail at an average of 40 messages per minute. As messages are received, they are placed in a queue.assume that the messages arrive at an average rate of 30 messages per minute.messages must arrive randomly.
Each minute, you can dequeue up to 40 messages and send them. Assume that 25% of the messages in the queue cannot be sent in any processing cycle.use a random number to determine whether a given message can be sent. If it can't be sent, enqueue it.
Run the simulation for 24 hours, At the end of the simulation, print the statistics that show:
-The total messages processed.
-The average arrival rate.
-The average number of messages sent per minute.
-The average number of messages in queue in a minute.
-The number of messages sent on the first attempt, the number sent on the second attempt, and so forth.
-The average number of times messages had to be requeued (do not include the messages sent the first time in this average)
Well, actually I've done a part of the coding. But how to continue it. And here is my code :
#include <iostream>
using namespace std;
#define SIZE 40
class Queue {
int queue[SIZE];
int head, tail;
public:
Queue();
void Enq(int num);
[code]....
View 1 Replies
View Related
Nov 11, 2014
I'm trying to write a code that proves a queue like fifo (first in first out). I have four characters :
p(rint),e(nqueue),d(equeue) and q(uit).
The problem is when I press d a first character must get rid of, but not. When I press d the numbers get double.
Example input:
e 2 3 9 8 7
p
2 3 9 8 7
d
p
3 9 8 7
d
p
9 8 7
#include <stdio.h>
void enqueue(int queue[], int newnum, int *tail_p, int maxsize);
void deque(int queue[], int *tail_p, int *elem);
void printqueue(int queue[],int count);
[Code] ....
View 1 Replies
View Related
Feb 21, 2014
Program requirements: Read two Queues (Male and Female) and pair them up.
Example:
inFile
M Bob
F Mary
outFile
Bob + Mary
Here is what I have so far. Code:
////////////////////////////main.cxx//////////////////////////
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <iomanip>
#include "queue.cxx"
using namespace std;
int main() {
ifstream inFile;
ofstream outFile;
[Code]....
View 4 Replies
View Related
Jun 19, 2013
how double ended priority queue be used to implement external quick sort?
View 8 Replies
View Related
Apr 20, 2013
Code:
#include<stdio.h>
#include<process.h>
struct que
[Code].....
View 1 Replies
View Related
Mar 23, 2013
I am trying to create a code to represent a queue using a linked list but i get the disturbing "Segmentation fault coredumped" after compilation.
Code:
#ifndef QUEUE_H
#define QUEUE_H
#include <stdbool.h>
typedef int Item;
typedef struct queue_type *Queue;
typedef struct node *return_node;
[Code] .....
View 2 Replies
View Related
