There are a lot of free system testing tools to do this. Try Googling for that!

Coller pretty much has it nailed. If you have a try/catch block that fails, then allocated code that was allocated before the try/catch block will no longer be valid.

It mostly depends upon the video card you are going to use. I have dual monitor support on my server (a Linux CentOS system with nVidea 1800GT card w/ 2 ports). My laptop has an HDMI and VGA ports, and runs an nVidia GTX card. Unfortunately, it will display the same output on both monitors... :-( I will report back if I can overcome this problem.

I've had similar problems when either the CPU or RAM would overheat. As a Linux user, I had access to the sensors tool and could monitor the temperature of these parts. I found that the RAM was overheating, but because I was only using 1/2 of the available slots, I staggered the spacing and the problem went away. Now, it runs nice and cool! At 10+ years old, it is still a kick-### server! Dual quad-core Intel chips and 8GB of RAM. Also, it, being custom built, has a 1000 watt PS. Never go cheap on the power supply!

In the colorPicker.cpp file you have specified the class colorPicker to be derived from itself. EitherRmove the ':ColorPicker' from the class declaration, or change the caps 'C' to lowercase 'c'. IE::class ColorPicker::colorpicker. That said, DON'T DO THAT! It will just come back and bite you on the rear.

Calling main(int c) is just plain wrong. Acceptable forms are main(void), main(), and main(int c, char[]). If you are trying to ask the system to evaluate the char[] argument using an int c that is not smaller than the size of the array, then you will get a SEGFAULT.

The traditional (and mathematically rigorous) method to determine primes is using the Sieve of Aristostenes. Your method will work for small primes, but breaks down quickly, or becomes computationally overwhelmed by the number of itererations required. This Wikipedia article explaines it pretty well: https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes

Also, simplify your code. You can also use a map for this - it will automatically sort the key (word) associated with the meaning. It is a lot faster, and less susceptible to errors like this. Here is a tutorial about the use of Java maps: https://docs.oracle.com/javase/tutorial/collections/interfaces/map.html

These sound like school/class questions. All of them can be answered by reading the appropriate books and/or internet articles. We are not here to do your homework for you. :-(

Also, make sure the directory and associated files are readable. If they aren't readable, then you can have this problem. I have had similar issues in the past. Make sure the directory also has full rwx permissions.

Re. Tinstaafl's suggestion. Just make sure you guard the header from being included multiple times, or you will will have the same problem. Do you know how that works?

Not enough information. Need server specs, operating system, and a lot of other stuff. With this "nugget" of information, you are on your own!

The pointer just points to NULL. It has no storage space. you need to allocate space. You could use strdup to do that. IE, sentence = strdup("helloworld"); strdup will allocate space for the string (including terminating NUL character) and copy the string to the newly allocated space that "sentence" now owns.

I always cap them because then you can detect them in your code a LOT easier! Also, I am not sure, but they may need to be all caps anyway. I'd have to refer to the reference documentation to be sure.

You need an encrypt method that takes a list or array of files argument so it can encrypt each and put the output into the output file.

Try using a live DVD instead of USB drive. That way, any faulty software on the live image can't break the media. Also, I am guessing that the ISO you built your live image from is faulty. Have you run a checksum on it and compared that to what is on the system you got it from? Also, did you get it from the Ubuntu web site, or somewhere else?

Do you have a primary key or any unique keys defined for this table? If so, that is how you would do this deleting by primary key (unique) or another unique key.

You will find some useful stuff in http://www.cplusplus.com/
If you plug "recursion" into their search bar you get a lot of articles that cover the subject.

And no, I am not going to correct your code. This is too simple of a problem, and you should have no problem solving it!

commented: Not helpful -3

Simple two-dimensional matrix. First column is the ticket price. Second is the number of tickets were sold at that price. To compute the income, iterate through the matrix, row by row, multiplying the price by number of tickets. Got it? If not, go back to your basic maths.

You need to post your errors and where they are coming from if you want any reasonable help. Asking for people to analyze 250+ lines of code is not usually received well. In any case I don't have time as I am currently out of the country until after the first of the year and have little time for such.

Ouch! Not sure what you can do as the system is remote. Have you run chkdsk on the system to see if there are file system problems? You can do that without rebooting, or on reboot if you wish. Anyway, a reboot may be necessary. Given the user directory is gone and the user account isn't there any longer, I'm not sure what you can do. If you had a recent system backup and you were on site, then not so much an issue, though if the backup disc is online you might be able to restore the user data after recreating the user account. You will lose anything done in the interim however. :-(

25 % 2 == 1. The modulus is the remainder after the division, so 25 / 2 == 12 with a remainder of 1. So, if i % 2 == 1, it is odd. If 0, then it is even.

The bit-wise operation, if the language supports that, is a nice hack though.

There is always the speed of light to consider, plus switching time in the necessary optical cable repeaters. That's about 135ms to traverse the world without repeaters, routers, switches, etc. From Amsterdam to NYC you still are looking a 20ms just to cover the distance. There there are all of the routers, spy systems, switches, etc. Longer if you go via satellite. These are barriers that cannot be avoided. So, if your packet from Amsterdam to NYC takes less than 100 ms, consider it a win. Try pinging a server across the Atlantic like that with Speedtest.net to see what is your likely best bet.

commented: I see now. Thanks. I guess next "breakthrough" is when we will find out how to travel faster than light. Only 500 billion years to go! +4

So, how are you calculating that?

What rproffitt said. Also, this is an indication that either the file system is munged, or the disc has too many bad sectors. Back up the data and get a new thumb drive, as advised.

You need to read up on sed and Linux/Unix regular expressions. The dot (.) has a special meaning - ie, any character. You need to preface each with an escape back slash (in a shell, two back slashes) to tell the tool to consider only a dot. Also, forward slashes are expression separators. They also need to be escaped like the dots. Try some experimentation until the output reflects your intention.

Basic programming stuff. Show your code and I'll show you where you are in error.

All you show is the XML file. Please show your code (php and laravel) and errors you are getting. Also, read the terms of use for this site. We don't do your work/homework for you.