1,306 Topics
![]() | |
I get this error message every time on start up. Will describe it as best as I can: Application NDP1. 1sp 1 Error Description Queue Serv Size 2.1KB Contents NDP1. 1sp 1. KB2416447_x86_ wrapper log version bd As I get this message every day I would appreciate any help in … | |
Hello! My question concerns software architects that have experience with UML/UTP. [U]Introduction:[/U] We are currently in the start phase of a new project, where documentation for hardware with embedded software is written. I am responsible for the GUI development. As the starting point, a predecessor model is used. Its GUI … | |
Hi, I am trying to make a one octave piano. heres my code: [CODE]#include<windows.h> #include<mmsystem.h> #include<stdlib.h> /* Declare Windows procedure */ LRESULT CALLBACK WindowProcedure (HWND, UINT, WPARAM, LPARAM); /* Make the class name into a global variable */ char szClassName[ ] = "WindowsApp"; int WINAPI WinMain (HINSTANCE hThisInstance, HINSTANCE hPrevInstance, … | |
My basic problem is that I'm having a hard time implementing a Pthread that consists of a round robin dequeuing 4 arrays consisting of ints. Followed by a Pthread that creates random numbers with which to enqueue them with. I've written most of the code for the queue itself and … | |
hello, i want a useful and clear link that let me understand the details of the queue at the server, like the steps from the first SYN packet received from the client and the allcations that happen to that client and the size that reserved is it for the whole … | |
![]() | I am relatively new to php and i am having this error "You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near '' at line 1" and i cant figure out what is wrong with … ![]() |
I want to have two threads with a queue exchanging data (in the form of lists) between the two threads. However, at the moment I cannot fathom out how to write the code simply for taking the first list from the queue, processing it(which I have written the function for) … | |
Hi All, I am trying tp put messages into a jms queue using jms, webservices and weblogic server 10.0. When i run the web service in a single invocation the messages are put into the queue successfully. But when i try to run a load test on the web service … | |
Hi, I am deveoloping a Web Service solution that is hosted inside a JBoss 4.2.3 sever and connects to a JMS queue that is hosted on another server. So far I am creating a new connection to the JMS queue each time the web service is called, this means that, … | |
I am making a program the enqueues a number at index 0. I also made a function for it, as written below: [CODE] //main #include <stdio.h> #include <stdlib.h> #include "functions.h" main(){ int *queue = NULL; int size, choice, aNumber, numberOfQueues; do{ printf("Enter Array size: "); size = input(); allocateMemory(&queue, size); … | |
Hi, I followed the following [URL="http://www.coderanch.com/t/424312/JBoss/Configuring-Eclipse-JBoss-MySQL-EJB"]http://www.coderanch.com/t/424312/JBoss/Configuring-Eclipse-JBoss-MySQL-EJB[/URL] to configure JBOSS and MSSQL Server in Eclipse. But I'm getting an error and I tried many ways but I'm still there. (In this guide "5. Copy the driver libraries to jboss-5.0.0.Beta4\server\default\lib" means copying jdbc.jar ??? right?) When I run an EJB project I'm … | |
Hello everbody Simply put; [I]rand() is driving me nuts[/I]. I've been trying to get my teeth into Dev c++ (v. 4.9.9.2) for the first time and couldn't find anything anywhere which helped me anymore. Nearly all this code is IDE generated or copied from examples - I'm just trying to … | |
Hey, this exploit periodically pops up on my MSE. I'd ideally like to get rid of it permanently. Here are the logs I had to break this down into like a million posts because the logs were too large for one post to handle. Sorry about that! I know for … | |
Hi everyone, I want to implement an ADT Queue class (pointer base) use Template with following public interfaces: enqueue,dequeue,dequeueAll,peek,and size. I have 2 problems: 1.not sure how to dequeueAll which is removes all elements from the queue with Postcondition: size( ) returns 0 2.for dequeue and peek I need to … | |
Greetings I have this page, which will have a slider gallery based on the EasySlider plugin [URL="http://fantasma98.byethost12.com/restaurante/galeria.php"]http://fantasma98.byethost12.com/restaurante/galeria.php[/URL] The problem I'm having is that, I don't know how to display a title and a description of the given image (been trying for hours to move positioned divs to display it). I … | |
I have an JOGL based opengl program that uses textures on flat surfaces. After a texture is put on a surface, it will eventually crash. If the textures are small, it takes a while. I managed to reproduce it with a simple program: [CODE] package org.yourorghere; import com.sun.opengl.util.Animator; import com.sun.opengl.util.texture.Texture; … | |
I'm finding that my session variable isn't following through from script to script. I'm creating a library database for school and I want the administrator to be able to open user accounts and view the details. This works fine. I then set the account number as a session variable for … | |
Hey everyone, I'm having some trouble writing this program using queues. The main issue that I'm having right now is that I have three queues, each is size=5. The user inputs a number to remove from a queue. The program will pop all the values out of the 3 queues … | |
hello, please i need to know how can i let the syn cookie work within requirments, i read that the syn cookie work automaticaly by the OS when a limit of the queue is exeeded, please how can i let the syn cookie work in a specific condition(not necessary that … | |
This is a program for recording sound from an Audio Input device. I have taken help from the MSDN website ..... ! I did as they had mentioned .... [CODE] //wave.cs using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.IO; using System.Runtime.InteropServices; namespace Record { public class wave { … | |
[CODE]template < class Object> void fix(queueType < Object> &q, int n) { -if (n>=1) -{ ---Object temp = q.front(); ---q.deleteQueue(); ---fix(q,n-1); ---q.addQueue(temp); -} }[/CODE] (a)what will the final state of queue q1 be after the statement fix(q1,2); is exexuted, if q1 has the values (1,2,3,4,5} my answer: {2,3,4,5,1} because q.addQueue … | |
Hello I want to implement a pr. queue with structs. My struct is: [CODE] struct Call { int CallNum; long CallTime; int CallLength; };[/CODE] This is a call center simulation application (of course if i can). According to algorithm, the agents should choose the call whose CallLength is shorter. I … | |
I have to modify the myqueue and mystack templates and make a new class called myerror in order to make the main.cpp work, im getting countless errors tho in the main.cpp Here are my errors [code] main.cpp: In function ‘int main()’: main.cpp:52: error: no matching function for call to ‘MyStack<double>::MyStack(int)’ … | |
compiles there are no errors but it only outputs part of the desired output and then exits in a segmentation fault This is the output its printing out [code] Input is: 25 10 - 100 115 - - 300 2 5 * / / Contents of input queue: 25 10 … | |
![]() | Hi all, I recently made a web crawler as part of a Uni team project building a small search engine. I've managed to incorporate it into our GUI, there is a button which starts the crawling process by creating the crawler in a thread. (I did this because otherwise the … |
Hi, I need to develop a C# console application which implements stack as a circular queue. I've written the code to use stack as a simple queue. [CODE]using System; public class Stack { private int[] theArray; private int topOfStack; public Stack() { theArray = new int[10]; topOfStack = -1; } … | |
I just cant get my head around it. Is there another way going through a singly linked list without using some kind of helper function? The header file wants me to implement: [CODE]size_t priority_queue::size() { /* code here */ }[/CODE] Now I just could create a helper function that has … | |
One of our salespeople routinely receives e-mail messages from a certain customer, but cannot reply or send new messages to this address. We use Exchange 2003, and I see the messages he sends or replies to just sit in the queue until they eventually time out and a NDR is … | |
The purpose of my program is to have the user to enter a word to be checked to see if its a palindrome or not. My program works in Visual Basic...but i have to turn it in to my teacher through SSH. When I run my program there this is … | |
Do you think a hash table is a good data structure for implementing a priority queue? Any ideas? | |
have an implementation of BFS I got elsewhere and modified slightly, but I am having problems with its input. It takes a graph, and will take it as '((a b c) (b c) (c d)) But my input I am giving it is a weighted graph... I know it's not … | |
I am experiencing a strange error with the constructor for a binary search tree. The project is for an Hoffman Encoding scheme however the issue is whenever i insert more than two items into the STL priority queue, the copy constructor crashes. [CODE] void copyTree(myTreeNode* & copy,myTreeNode* originalTree) { cout<<"Copy … | |
I am currently attempting to write a single [B]recursive[/B] method (per instruction) whereas the items in a binary tree are displayed in a horizontal hierarchical manner (level order traversal). The UML describes the method as: levelOrderTraversal(TreeNode<T> tree, Integer indent) - tree: a node in the binary tree - indent: describes … | |
[COLOR="Green"][I]CAN YOU HELP ME TO SOLVE THIS Assignment.... PLEASE....[/I][/COLOR] [COLOR="red"][B][U]THIS IS THE QUESTION : [/U][/B][/COLOR]Implement the linkedPriorityQueue class as defined below. Note the following: ï‚· Each node in linkedPriorityQueue represents a customer. A customer can be regular or with a high priority. High-priority customers have their high_priority variable set to … | |
[CODE]#include <iostream> #include <cassert> using namespace std; struct node { int number; bool high_priority; node *link; }; class linkedPriorityQueue { private: node *high_priority_front, *high_priority_rear, *queue_front, *queue_rear; public: linkedPriorityQueue(); void addQueue( int number, bool high_priority ); void deleteQueue(); int front(); int back(); bool empty(); bool full(); void print(); int size( bool … | |
hi there [B]how do i determine the average Number of Queue Items that leave the queue (example: processes leaving the ready queue in order to be Running in the CPU) per second?[/B] i need this value to calculate for the average waiting time. the formula is: w = n/X where … | |
Hi in this program i want it to run for 720 loops but it keeps stoping short for some reason. There is no compilation error or runtime error. [CODE]import java.util.LinkedList; import java.util.Random; public class Simulation { private LinkedList<Customer> customerList; private int minutesThatHavePast; private int customerNumber; private int customerProcessTime; private int … | |
![]() | Hi all, I am currently trying (and now wondering if) you can add multiple threads to a program to do the same job? Basically I am writing a web crawler for a search engine and it adds many URLs to an ArrayList which is used as a queue. I add … ![]() |
hey, I use DEV-C++ and I want to know how to display text in a new windows project. this code that i used from an example doesnt work. [CODE]#include <windows.h> #include<iostream> #include<string.h> /* Declare Windows procedure */ LRESULT CALLBACK WindowProcedure (HWND, UINT, WPARAM, LPARAM); /* Make the class name into … | |
i am getting an error in this. basically it sorts a queue in abc order. [CODE]public class Queue2{ public static void main(String [] args){ LinkedQueue q = new LinkedQueue(); q.enqueue("d"); q.enqueue("v"); q.enqueue("b"); q.enqueue("a"); q.enqueue("d"); System.out.println(q); System.out.println("----------------"); sort(q); } public static void sort(LinkedQueue q){ LinkedQueue qFinal = new LinkedQueue(); int count … | |
this is a linked list based queue private class Node { String value; Node next; Node(String val, Node n) { value = val; next = n; } } public String dequeue() { if (empty()) throw new EmptyQueueException(); else { String value = front.value; front = front.next; if (front == null) … | |
I have two issues that I need to solve on this program that are giving me some troubles. I have scanned google and my text book and so far coming up empty. Problem #1 - My program works for palindrome words and 2 word palindromes like "race car". But I … | |
this assignment has stomped me. i thought it about long and hard and can't imagine how would i edit the quicksort to sort an array-based queue object. i'm required to use an array-based queue class which has only 3 methods: enqueue(), dequeue(), and peek(). they're pretty self explanatory. i cannot … | |
I am trying to finish this palindrome program and the only output I get is output cannot be found. Can anyone show me what I am doing wrong. I will put the instructions in if needed for a guide to show what it needs to do... [CODE] #include <windows.h> #include … | |
ETA: okay take two, I thought I had the problem fixed, turn out no. Okay so I'm a student on work term teaching myself C++ coming from a background in Java, having done that for the past two years in school. I'm having a tough time with some concepts and … | |
I try to make to set up [code] public Datas getData() { Node node; if (Process.TryDequeue(out node)) return node.getdata(); else if (downloads.tryDequeue(out node)) return node.getdata(); else return null; } public void GetNextItemToADD() { ConcurrentQueue<Node>.GetNextItemToProcess(); } [/code] I think I am wrong.. I try to find example for GetNextItem. I want … | |
Hi all, I'm currently thinking about how to make a thread safe queue. Specified as such: [LIST] [*]Single reader [*]Multiple writers [*]Dynamically sized [*]Suitable for both a reader sleeping on a queue or as a polled queue [/LIST] So what I'm looking at so far (pseudo)code wise is the following … | |
globals.h [CODE] #ifndef _globals #define _globals #define NEXT(L) ( (L) -> next ) #define DATA(T) ( (T) -> datapointer ) #define LEFT(T) ( (T) -> left ) #define RIGHT(T) ( (T) -> right ) typedef enum { OK, ERROR } status ; typedef enum { FALSE=0 , TRUE=1 } bool … | |
Can someone help me print my BST in level order. Heres what i got so far... [CODE] Queue<BinaryNode<Type>> f=null; while(node.element!=null){ System.out.println(node.element); if(node.left!=null){ f.offer(node.left); } if(node.right!=null){ f.offer(node.right); } if(!f.isEmpty()){ node=f.remove(); } else{ node.element=null; } } [/CODE] | |
I tried to figure out the Queue with moveup and movedown (like swap). But I will make the consoleApplication but i can't make the window forms application. I want to know about it. If I will make thread safe too. Thanks. |
The End.