1,306 Topics
 | |
| | Hey again, I'm having another problem unfortunately. We were asked to create a tree that has binary tree properties as well as max heap property. (take A(7),C(8) and B(3) ; the tree should be so that the it should alphabetically represent a binary tree and numerically represent a heap) I … |
| | A friend of mine just purchased a brand-new Dell computer with an HP 1012 Laserjet printer. The printer installs with no problems, but only prints a blank page. I have tried all of the drivers on the printer CD to no avail. He somehow ended up installing 3 copies of … |
| | Hi there, Does anyone know of any systems or potential methods or hazards to implementing an access queue on a website. Basically we have a client whos a major fashion retailer doing a big sale and MAgento can't cope. I need to limit the amount of online users to 100 … |
 | Write a queue-handling program that asks each customer for their names as they place orders at a fast food restaurant. Each record in the queue should consists of a name field with of 20 characters and an integer field, which keeps track of the total number of customer served. The … |
| | Hello, Assume we have one button that fires ajax request, ajax call will talk 15 seconds to load the results. Assume the user clicked on that button first time and waited for 5 seconds, then he/she clicked again. In this case the page will be loaded two times. i.e. first … |
| | Hi guys, I have been away from programming for a while and i started back today now that i have some time again. However i have run into a bit of a brick wall. im trying to impliment a queue with a simplified interface for holding messages. What I have … |
| | Hi Everyone! I have here a queue: [CODE]my $qTool = Thread::Queue->new();[/CODE] I want to show all the elements that the queue contains. [CODE]my $qItem = $qTool->peek();[/CODE] The code above returns only either the head of the queue or an element at a specified index. Is there a way for me …  |
| | am having a lot of headache trying to pass values to upload.php I have tried various ways to pass one parameter but it is always empty in upload.php. I have seen the sample but I failed to get it right nor all the other tutorials outthere helped me out. here … |
| | I can't understand the following statement [QUOTE]The Hotspot VM now implements Thread.yield() using the Windows SwitchToThread() API call. This call makes the current thread give up its current timeslice, but not its entire quantum.[/QUOTE] given at [URL="http://www.javamex.com/tutorials/threads/yield.shtml"]http://www.javamex.com/tutorials/threads/yield.shtml[/URL] I understand that after a thread yields, other threads get a chance to …  |
 | hi masters... i want to get jobs in printer queue... i didn't have idea to do this. please help me. any help will be appreciated. thanks before. |
| | Hello,everyone.Im doing the same project as Slash12 source:[url]http://www.daniweb.com/forums/thread331507.html[/url] I thought the data structure I constructed is correct but I don't know how to test it until my search function works. The errors i have now are: TypeError:__init__() takes exactly 3 arguements(1 given) for i in range(len(board)) has no len() TypeError:object …  |
| | hi, any body can help me i need a source code for a simulation of elevator in vb or any single-queue, multi-queue simulation  |
| | I am having trouble with my print function for my linked queue. My compiler error is pointing towards cout << tempPtr->info << " "; line 149 tempPtr = tempPtr->next; line 150 in my print function. Can anyone help me fix this? Thanks CODE: [CODE] #include <iostream> #include <cstddef> // For …  |
| | I am working on this linked queue class program and it runs without any compiler errors but there is a break point in my dequeue function. It is pointing towards: "item = qFront-> info;" line 83 in the dequeue function and I am not sure how to fix this error. …  |
| | HI guys ~ i am trying to find Active Queue Management in Computer Networking a Top-Down book but i can't find it . tomorrow i have final exam , and i was checking last year exams i saw this question but i don't know how to solve it can some … |
| | Hey everyone, I was assigned a project where we have to simulate virtual memory page replacement algorithms. I decided to use a Queue ADT I made in a previous project, and modify it to enqueue page reference strings of a process, character by character. However, when I initially create the …  |
| | Hi all, I've built a Queue class which basically uses dynamic memory allocation to make an array grow with every new element inserted. It compiles and works perfectly under dev c++, but when I included the class in a VC++ 10 Express project and instantiated an object from it, the … |
| | i am using devc++ compiler. using c code created the window but its blank . now to write data something on it. like (say)write(create) the output of my own program into that window.in c. guide me pl.[CODE]. in this i have not inserted my own code. this code is used …  |
| | Hi, I have a homework assignment that I just cannot figure out. I would be grateful of any help. The assignment is: Create a program which: Implements a class called Queue: The class should contain an array of maxQ integers. There should be two constructors: One that takes no argument … |
| | I am trying to create a queue class and then allow the user to input integers at the back of the queue and take them from the front. This is what I have so far, it runs but will not output the size of the queue correctly. Any help would … |
| | Hello everyone, It has been a while since I last logged on. It has been a while since I really needed any major help in programming. But I am here now and I do need a bit of help. Let me start off by saying that I have tried to … |
| | I am trying to write a dropout stack/queue using a Linked List, I have already done the code for Arrays but I am coming across a problem. I do not understand doubly linked list, specifically creating a pointer the previous. I believe I have done the push correctly (5 being … |
| | Hi, I have a task which involves using a queue in order to fill an enclosed region. For example I have chosen this 2d array to apply a flood fill technique to. [CODE] int[][] shape ={ {X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X}, {X,X,X,0,0,0,0,0,0,0,0,0,0,0,0,0,X,X,X,X}, {X,X,X,0,X,X,X,X,X,X,X,X,X,X,X,0,X,X,X,X}, {X,X,X,0,X,X,X,X,X,0,0,0,0,0,0,0,X,X,X,X}, {X,X,X,0,0,X,X,X,X,0,X,X,X,X,X,X,X,X,X,X}, {X,X,X,X,0,X,X,X,X,0,X,X,X,X,X,X,X,X,X,X, {X,X,X,X,0,X,X,X,X,0,0,0,0,X,X,X,X,X,X,X}, {X,X,X,X,0,0,0,0,X,X,X,X,0,X,X,X,X,X,X,X}, {X,X,X,X,X,X,X,0,X,X,X,X,0,0,X,X,X,X,X,X}, {X,X,X,X,X,X,X,0,X,X,X,X,X,0,X,X,X,X,X,X} {X,X,X,X,X,X,X,0,X,X,X,X,X,0,X,X,X,X,X,X} {X,X,X,X,X,0,0,0,X,X,X,X,X,0,X,X,X,X,X,X} {X,X,X,X,X,0,X,X,X,X,X,X,X,0,X,X,X,X,X,X} {X,X,X,X,X,0,0,0,0,0,0,0,0,0,X,X,X,X,X,X} … |
| | hi, M'soft sites documented that [CODE]RECEIVE TOP (n) FROM Target[/CODE] should fetch the n number of message from the specified queue. I am having problem with this, and do not know why because not much resource is available pertaining this. Tried finding for an answer on Klaus Aschenbrenner's book, failed. … |
| | Can anyone see any way of improving this? [CODE]//____________________________________________________________________________________________ // START #include <iostream> using namespace std; int maxQ, total1; //____________________________________________________________________________________________ // CLASS(ES) class Queue { int array[]; public: //variabes int count; //constructors Queue(); Queue(int q); //functions void add(int i); void take(); }; //constructors initialization Queue::Queue(int q) { array[maxQ]; count = …  |
| | Hi, i have no idea how to go about doing this iv tried coding it a bit but just get very confused! if anyone could give me a hand or show me some sample code would be great. Thank you Create a program which: Implements a class called Queue: The … |
| | Hi there, I'm working on a 'queue program' which will queue 30 job numbers(case 1) between 1 and 30, validated, in an array, display the array , (case 3) and remove a number from the back of the queue.(case 2) I have the display array and remove from front of … |
 | Hi Guys, I have set up a cron job on a Centos server that is supposed to execute a script that looks for SMS messages in a queue and processes them. My crontab file is under [B]/etc/crontab[/B]. The job is supposed to be run after every 5 minutes. The command … |
| | Hi, i have this assignment to do and i dont really know what i have to do could someone tell me what i have to do in simpler language thanks Here is the assignment: Create a program which: Implements a class called Queue: The class should contain an array of … |
| | This is driving me mad. This program reads 8 records from an iseries data queue and then I get the segmentation fault. I can't work out why. Does anyone have any ideas? Please!! [CODE] #define WIN32_LEAN_AND_MEAN // Include the necessary DQ Classes #include <iostream> #include <fstream> #include <windows.h> #include <cwbdq.h> … |
| | Hello, I am currently assigned a project to simulate a carwash in C++ using a priority queue and a heap. Basic synopsis: 1. a car enters the carwash. 2. if there are no parking spaces the car departs (must keep track of number of cars that depart without getting a … |
| | Hi all, I've been working on making a bounded priority queue implemented as an array of queues and I believe I have it at last -- except of course for this error that I don't understand... I am getting an error about the queue array being declared without a type … |
| | Hi, My program is supposed to implement a binary tree with an insert, remove, copy, pre-order, post-order and in-order functions. Problem is that my code compiles but doesn't work correctly. When I try to insert more than one node/child node the program crashes/freezes. Could someone help me out. Thanks. header … |
| | Input: A, B, C, D, E ... [CODE] 1/1 1/2 2/3 3/4 2/5 [/CODE] Output (Queue!): [CODE] 5 B 1 E 3 C 4 D 2 A [/CODE] How to make this? Mark competitors (persons) Example: A ... E their come in first queue. A can label/tag 1/1. B can … |
| | I got a simple priority queue of <node> objects. [CODE] Priority Queue<node> queue = new Priority Queue<node>(n,compare);[/CODE] the node object has a few fields, one of them an int field called LB(lower bound) I've build a compare class so the queue would use my compare to sort itself. The problem … |
| | Hello all, Please help me if you can: my question is [B]what is the efficiency of the queue's insertion and deletion operations when the ADT list's implemetnation is a. Array-based b. Pointer-based[/B] Give me a hint if you can. I am new to the C++ world so please forgive me … |
| | As the title suggests I need to write the class of a graph object. It is required that I write a function that prints the graph determine if the graph has conex components,what are the cinex components, if the graph has cycles, and to determine the shortest and longest road …  |
| | I am having trouble printing the contents of a b-tree of order 'n' in level order. I have looked at algorithms online, but they only cover trees that have nodes with only 2 children. Shouldn't it also be called recursively? No algorithm I found used recursion. [CODE]void addToQue(struct node *root) … |
| | I am working on a web application in silverlight. i want to use msmq to send data to the remote server in offline mode. I have absolutely no idea about msmq, except for some basics. i used this link to create triggers, rules and queue [URL="http://www.left-brain.com/tabId/65/itemId/1690/pageId/3/Pro-MSMQ-Microsoft-Message-Queue-Programming.aspx"]http://www.left-brain.com/tabId/65/itemId/1690/pageId/3/Pro-MSMQ-Microsoft-Message-Queue-Programming.aspx[/URL] I created a private … |
| | I'm supposed to implement a queue using a singly linked circular linked list (it also has to be generic). It keeps saying there are incompatible types at lines 44 and 45. I've honestly been trying to work this out for hours, but I don't understand what i'm doing wrong. Any … |
| | Hello everyone. My name is Mike. I am a new member :). I hope to be using this forum quite a bit to extend my knowledge base on c++ and java.(just wanted to introduce myself being my 1st post and all lol) Well my class was tasked with making a … |
| | Hello, I have an assignment where we are supposed to populate an operating system's ready queue with processes and try various process scheduling scheme and record their wait times. To do this i made a rudimentary structure for a process: [CODE]typedef struct{ int ID; int wait_time; int exec_time; }process; [/CODE] … |
 | please i want someone to help me out here. i am trying to develop a dynamic class timetable. Every 2hrs; classes change lectures and lecturerers. i want my application on its own to be able to switch to next period. Doing that, the next period lctures and the lectureers would … |
 | Hi there everyone!! Struggling a bit with some Linked Lists combined with copy constructors as well as operator overloading. Here is the code of the header (.h) and the implementation file (.C). Hope that you can help! [CODE] /////////////////////////////////////////////////////////// ////////////////// //////////////////// ////////////////// Queue.h //////////////////// ////////////////// //////////////////// /////////////////////////////////////////////////////////// #ifndef QUEUE_H #define …  |
| | [COLOR="Green"]Hello everybody I am writing a mini program in Linux I have a message queue which has a default maximum capacity of bytes that can be written in it. I am trying to modify this capacity. I googled for a solution and tried to change the value of (msg_qbytes) by … |
| | the question is: Write a method with the signature: [B]public static void printABs(int n)[/B]that prints all the strings, less than or equal to length n, that can be built from the alphabet A,B. printABs must print out its strings starting from the shortest strings and ending in the longest. So, … |
| | I'm using Eclipse and when I try to build the JMS example included in j2ee tutorial, it return a NullPointerException at this: [code]connection = connectionFactory.createConnection();[/code]. Here's the code of that example: [code]public class Producer { @Resource(lookup = "jms/ConnectionFactory") private static ConnectionFactory connectionFactory; @Resource(lookup = "jms/Queue") private static Queue queue; @Resource(lookup …  |
| | Please could you show me how to use stakcs and queue to create a program that divided letters (a,b,c,d,e...x,y,z) by vowel and consonant letters.We have two stacks:in first should be vowel letters and in second consonant letters. Thanks in advance! |
| | [COLOR="Green"]Hello Friends... i made this Queue Program in c and its working good.. But I want to make it circular Queue please give some ideas..[/COLOR] [CODE] # include <stdio.h> # include <conio.h> # include <stdlib.h> # include <string.h> # define QSIZE 5 typedef struct{ int head,tail; char names[QSIZE][30]; }QUEUE; void … |
| | How can I listen for new connection as well as lisstening for ongoing communication with TCPIP? I have the following code which properly listen for new connections, sends and receive data. However, if the client application sends new data from an existing connection I don't see anything. [CODE] using System; …  |
The End.