Over the last few days I have been converting old video files from avi to mp4. I've been doing this using the command line version of DivX. This is the process behing the DivXPro GUI and it is named `DivXEngine.exe`. Converting video files takes a big hit on the CPU and I would prefer to set the process to a lower priority to minimize the impace on my usual tasks. Under Windows 7 there was a utility program that could be used to permanently change a task priority. Unfortunately it no longer works in Windows 10 so I did the …

Member Avatar
+1 forum 0

hello i have a problem with Priority when I set priority of any thread then I get wrong output my code is below class Run implements Runnable{ private String st; public Run(String s){ st=s; } public void run(){ for(int i=1 ; i<=10 ; i++){ System.out.println(st+"="+i); } } } class PriorityCheck{ public static void main(String ss[]){ Run first=new Run("First"); Run second=new Run("Second"); Thread t1=new Thread(first); Thread t2=new Thread(second); t1.setPriority(Thread.MIN_PRIORITY); t2.setPriority(Thread.MAX_PRIORITY); t1.start(); t2.start(); } } and its output is below First=1 Second=1 First=2 Second=2 First=3 Second=3 First=4 Second=4 First=5 Second=5 First=6 Second=6 First=7 Second=7 First=8 Second=8 First=9 Second=9 First=10 Second=10 but output …

Member Avatar
Member Avatar
+0 forum 9

I have an accommodation reservation system that allows managing agents to list all the properties under their control. There are various 'locations' that have a priority such as:- 'Beach Front' has priority of 1 and 'Off beach' a priority of 2 etc. Setting these are pretty much a straight forward issue as they dont change. The issue I am facing is that within each location there are properties and they too have priorities. When someone searches for a holiday home the results are sorted by location.priority and then property.priority. This is done so the admin can push higher priced establishments …

Member Avatar
Member Avatar
+0 forum 5

I'm curious about write locks with MySQL and how they are prioritized with eachother. Specifically, I'm wondering if "low priority write" locks have lower priority than "normal" write locks, or if they are equal. The only documentation I can find states that the low priority locks have lower priority than read locks, allowing read locks to process first. But I can't find anything that states how they relate to other write locks. The point of this is that I'm looking for a way to "prioritize" write locks, and wondering if just the standard low priority lock will do what I'm …

Member Avatar
Member Avatar
+0 forum 1

I am trying to implement a priority queue with an unsorted array and hit a wall when I received a Segmentation fault:11. I used gdb and got the error: Program received signal EXC_BAD_ACCESS, Could not access memory. Reason: KERN_INVALID_ADDRESS at address: 0x0000000000000000 0x00000001000017fa in Item<std::string>::setKey (this=0x0, k=3) at PriorityQueueArray.h:27 27 void setKey(const int k) { key = k; } (gdb) backtrace #0 0x00000001000017fa in Item<std::string>::setKey (this=0x0, k=3) at PriorityQueueArray.h:27 #1 0x0000000100001b58 in PriorityQueueArray<std::string>::insertItem (this=0x7fff5fbffb00, k=3, x=@0x7fff5fbffaf8) at PriorityQueueArray.h:48 #2 0x0000000100001430 in main () at PriorityQueue.cpp:50 My code is: ` // // PriorityQueueArray.h // Assignment5 // // Created by Danielle Crowley …

Member Avatar
Member Avatar
+0 forum 1

In the below code, I want to know the significance of 10 while creating a PrioriyQueue. I know its the initial capacity but what does it mean?? I replace 10 with any positive number and the output remains same. import java.util.*; class Test { static class PQsort implements Comparator<Integer> { // inverse sort public int compare(Integer one, Integer two) { return two - one; // unboxing } } public static void main(String[] args) { int[] ia = { 1, 5, 3, 7, 6, 9, 8 }; // unordered data PriorityQueue<Integer> pq1 = new PriorityQueue<Integer>(); // use // natural // order …

Member Avatar
Member Avatar
+0 forum 1

I'm trying to implement priority queue using a singly linked list, but the program is not running in the best way, n the display function is showing just first n last node's data , y??? [CODE]#include<iostream.h> #include<conio.h> struct node { int n,p,b; // Data members for getting Task no. ,Priority and Burst time respectively..// node * ptr; //Pointer pointing to next node ./// }; class pqueu { private: node * head; /// Header pointer // node * temp1; //Pointer used for Searching /// public: pqueu():head(NULL) //Giving NULL value to head /// {} void insert() { node* temp; // node for …

Member Avatar
Member Avatar
+0 forum 2

[COLOR="Red"]First off let me just say i don't want anyone to do my homework for me. I get a greater sense of satisfaction knowing that I did the work. with that being said I'm looking for some way to start or some input on what measures I should take while doing my assignment. Thank you in advance. [/COLOR] [COLOR="Green"]our assignment is to write a C/C++ program that can handle jobs in a long-term queue of an operating system based on priorities. The functions of the program must include: A random number generator that can generate numbers between 1 and 100. …

Member Avatar
+0 forum 0

hi:) i'm writing a windows form program that controls 4 stepper motors, using visual studio express 2010, c++ i'm using a for loop that has to cycle for up to 1200 times. it works well enough but it's kinda slow and, when it's connected to my hardware and given more than 300...400 loops, it shows "not responding" until it reaches the end of the cycle. during this, it moves much faster. That speed would be allot better for my application, but i dunno how to control it. i'd like to know how to make my form program work properly when …

Member Avatar
Member Avatar
+0 forum 3

I'm adding controls to a panel, using the .Controls.Add() function. How does Windows determine the display priority of the newly added controls? That is, if I position a new control so that it overlaps an existing control, which one shows up "on top", the older control or the newly added control? I'm guessing that it uses the order of the controls as they reside in the Controls array, with the lower indexed ones having lower display priority than the higher indexed ones. Is that correct?

Member Avatar
Member Avatar
+0 forum 2

Hi, I'm trying to somehow download all pictures on a website FIRST before anything else happens... the problem I'm experiencing is that when a user comes to the site - none of the images are loading, sometimes they show, sometimes they don't... I believe that if the client downloads all the images prior to anything else then it will force the browser to see the images... or am I wrong? Thanks, Ashton.

Member Avatar
Member Avatar
+0 forum 1

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 and I am not seeing what is wrong, since I am passing in a class Item into it as its type. header file: The error occurs at line 17 and says "error: ISO C++ forbids declaration of 'queue' with no type". [CODE] #include <stdlib.h> #include "queue.h" template <class Item, int …

Member Avatar
Member Avatar
+0 forum 2

The End.