Posts by rubberman

We don't do your homework for you. Since this is in the C++ forum, I expect you need to create the code (classes, methods, etc) in C++. Do that to solve the problem. If you make a real effort to solve the assignment and are still having problems, errors, etc. then post the code, errors, and your problems here and we may be able to help.

We don't do your homework for you. Write the code, then post it here along with errors and problems.

Remove the HDD. Boot from live media. Put HDD in an external carrier (either Sata or USB), plug it in, and then erase the drive (after backing up data if you can). The key here is to boot before attaching the HDD.

First, this is not good:

if ( ( CtPtr = fopen( "hardware.dat", "rb+" ) ) == NULL ) {
    if ( ( CtPtr = fopen( "hardware.dat", "wb" ) ) == NULL );
}

In the second condition, it just falls through even if the file cannot be opened for write access (create).

Please show sample output that illustrates your problem with duplicates. I am not seeing anything in the code (on cursory inspection) that would cause that.

Well, if it was working, and now isn't, then either some software update has munged the system, or you have a hardware failure. I would guess the latter (hardware). Most PC's have multiple USB hubs internally with separate connections and chips. You might try another port, or other ports, to see if one of them still works for you. If not, then take it in for service. Most system warranties are for 1 year these days, but often you can get a 3 year warranty for a bit more $$. If it is under warranty, you should be "golden". If not, then you will have to pay something for the repair, or replacement with a refurbished motherboard.

FWIW, Intel is pretty good with in or out-of-warranty service. Even if out of warranty, if you complain loudly enough, they may do the repair gratis.

If you are running Windows systems, go to the command prompt (cmd.exe) and run the command "ipconfig". If Linux/Unix, go to a command prompt and run the command "ifconfig". These should should your network interfaces, and the address of the router (gateway), along with other stuff.

Your router has a range of IP addresses for DHCP and for local static addresses. You can only change your IP to another static address. If you change it to something in the DHCP range, you are going to have problems.

Go to the disk management tool, create a partition on the drive, and then format it (with NTFS).

As Mike2K said, dd will happily wipe any disc, file system, or file as needed. That said, did you try to use fsck to fix the file system? FWIW, you can only do a fix if the file system isn't mounted, otherwise it will only to a read-only analysis to tell you what is wrong. Boot a live cd/dvd/usb drive, and then run fsck on the file system that is problematic, such as /dev/sda1, or whatever it is. That will, if possible, fix the file system. If you think there may be bad blocks on the drive, then add the -c option to fsck. That will check for bad blocks, and map them out of use, after trying to relocate the data.

I have used this technique a number of times in the past to recover failing drives until I could get a replacement delivered.

Name: My First Loan Program
Logo: A dollar sign with wings flying away

What language depends upon a lot of things, such as the platform you want to target - computer, tablet, mobile phone, etc. as well as whether it's for Windows, Apple, Android, Linux, et al. Also, some parts may be one language (low-level stuff) and other parts another language (graphics, audio, etc). You obviously have a lot more to learn before you start on this long road. Some of the early PC games written by friends of mine were done in assembly language, others in Pascal, Basic, and C. These days, PC games are often written in C++ and C. A lot of Windows phone games are webapp and javascript based. Android games are usually in Dalvik (Java), and on and on.

This helps. I'll get back to you after I've had a chance to look closer.

Seems pretty clear to me. You are calling functions that have not been defined as yet. A declaration is NOT a definition! You cannot call a function before it has been fully defined.

In the case of either on-premises or in-cloud systems, following the "rules" is the only way to get real security (relatively speaking). Amazon is pretty good about security, but you can still leave yourself open to exploit if you don't dot your i's and cross your t's. That said, I think it is still more secure than having to roll your own in a private data center - I've had to deal with both. Amazon provides a lot of tools, help, and documentation to secure your cloud services. To do that on your own is very difficult, and expensive.

Some browsers today aren't allowing plain http access, but require https (secure, encrypted connections) to work. Try using https instead of http as the protocol type.

This effectively works, but is essentially a goto - not good programming practice. Usually you would use a termination flag in the for loop, set it when found, and you are done.

Posting 500+ lines of code with no indication or description of the errors or problems you are getting just doesn't work.

Assuming that balance is at least a floating point value, this is almost correct. Try this:

std::cout << "Your new balance is " << std::put_money((long double) balance) << std::endl;

Here is a good c++ reference: http://www.cplusplus.com/reference/

What deceptikon said. In addition, modern processors have a lot of cache memory that could, in theory, be used as main core if desired. That said, most BIOS's will refuse to run without main memory, unless modified.

Yes. The biggest issue was not declaring FirstData variable as extern. As a result, a unique global variable would be created in each translation unit that included linklist.h, which caused the duplicate symbol error.

Go to the control panel's add/remove programs page and look for the bitlocker entry. It should show the version there.

Yes. It needs to be either of these two ways:

if (pin1 == pin && accnum1 == accnum)

or this

if ((pin1 == pin) && (accnum1 == accnum))

Definitely keep up on the math! 9 years ago I took a job designing and devloping risk analysis software for the options trading industry at the CBOE in Chicago. Even though I hadn't used it for years, I dusted off my college calculus texts to refresh my understanding of 3rd order differential equations, necessary for computing things like the Black-Scholes algorithms needed to properly evaluate risk and rebalance portfolios based upon those factors! Without the foundational studies, that would have been impossible.

Besides the MySQL connector, you may need the MySQL client on the client machines. Also, make sure that you are installing the correct MySQL Connector and Client versions. They may have already had a different version installed and that is still the default.

I use K3b - it is a front end for other command-line tools, but has a lot of options and handles the CL tools very well. I also use it to create and burn DVD's, CD's, and such.

You need to show us the errors you are getting. What kreiger said is correct - that is an error. Also, on line 24 you are declaring a[] as an array with no size. This won't work, and is a situation where declaring a global or static constant for the age array size would be appropriate, such as:

static const size_t NUM_AGES = 5;

and then use that when you declare the age[] array and a[] arrays. In such a case, line 6 would be int age[NUM_AGES] and line 24 would be int a[NUM_AGES] and your loops would instead of for (int i = 0; i < 5; i++) or whatever, would be for (int i = 0; i < NUM_AGES; i++). That way, if you need to change the number of elements, you just have to alter the const value definition of NUM_AGES.

I was just reading in Phoronix an article about these new devices, and that they are definitely NOT Nouveau friendly! You will need to blacklist the Nouveau driver, and install the proprietary driver that you can download from nVidia to get these new Maxwell cards to work well. DO NOT bother with the drivers in the system package manager. Get the latest stable driver directly from nVidia.

Sometimes things just get stuck - not malware, just bugs. Kill the processes that are taking up the CPU and shut down the services that started them (if possible). Then, see if they are restarted or not. That may give you a clue as to what is going on.

A little update - my wife and I just had our 41st anniversary, and last fall we were presented with our second great grandchild, Alice. This September, our granddaughter Alynn is getting married so we will travel to California (Visalia) for that event. Hopefully we will get some time to hike in Yosemite while there.

My wife is still doing the physics thing, and after some time with Nokia Mobile Phones (2 1/2 years until Microsoft bought out the division and let 12,500 people go, including yours truly) and then Adobe, I am looking for a new position - interviewing with Amazon, Nokia, and Nike this week and next. The Amazon position is the most interesting. Nokia just bought Alcatel-Lucent and the Nokia division (Nokia Here - mapping and autonomous navigation) I will be interviewing with may be next on the block to sell. Nike would be a long-term (6-12 months) contract in Portland Oregon. Fortunately, I have family there.

So, that's all the news that fit to print from Rubberman. I can be found either 40 miles west of Chicago, or in a galaxy far, far away! :-)

Well, things got fixed. I was upset with the broken interfaces and needed to rant! These days, I am pretty much happy with how things are, so obviously things got resolved. :-) Anyway, belated apologies.

You only print the query about continuing or not (line 47), but you take no input to test in the ans variable (line 48).

We don't do your homework for you. Make an honest attempt, post your code here, and we will be happy to critique it.

This is a situation where posix threads may be more appropriate than fork/exec processes.

When it comes to sorting and searching, you cannot beat Knuth! :-) He wrote the bible on the subject.

The std::swap function does use a temporary value when doing the swap, but the user doesn't need to worry about that. This is when standard tools can be helpful, and reduce the amount of code that the user needs to write.

Glad to help! :-) Sometimes just asking the question leads us to the answer!

Really! Please don't ask us to help you cheat!

Well, XP is a zombie now - we just can't kill it no matter what we try! I have a legal Win7 OEM install disc that I installed on a Linux VM (VirtualBox) - and Microsoft says it is "possibly" a fake (is is not), so I may need to resurrect XP so I can run my scanner and other Windows software without being nagged about this crap!

Anyway, apparently, running an OEM version of Win7 in a virtual machine that is not Microsoft's makes them think it is an illegal copy... Bad Microsoft! I paid over $100 USD to purchase it from a reputable (and MS-certified) dealer! What a load of crap!

What Dave said, plus, recursion also occurs when functionA calls functionB ... and finally functionX calls functionA again, before any of them return to their caller. These function stacks can become very deep, and difficult to debug.

FWIW, I also did AVL and other variants of balanced binary trees. Fast for lookup. Not so fast when needing to rebalance the tree on insertion (depending upon the number of entries allowed in each data node). Consider them a mix of a sorted array and linked list... :-) I got a lot of my inspiration for these from Knuth, volume 3.

When I designed the framework for FACTORYworks (a major MES for semiconductor, flat-panel display, and disc drive manufacturers), I designed and wrote an insertion sort for sorted collections. It was a qsort variant, and REALLY fast. With head/tail optimizations, it could suck up over 100K nodes so fast that our QA department had to ask if there was a bug! There wasn't... :-) The head/tail optimizations were useful when loading data from a sorted SQL query. Since it was array-based, the array resizing algorithm was critical. It was a binary algorithm with a reasonal starting size (factor of 2) where each increase would be simple to compute and reallocate. IE, double size on each reallocation.

Linked lists are elegant, but inefficient to keep sorted. To find the insertion spot requires possibly a full scan of the list, so this is another situation where head/tail optimizations can be useful if you REALLY need to use a linked list. If the new node isn't at the head or tail of the list, then you have to scan the list - not an optimal situation when performance is required. At least a sorted array will use a binary search which reduces the scan time considerably. This is why when I did need to sort a linked list, the "read into an array and use qsort" method worked well.

For more technical information and tutorials on random number generators, go here: http://www.phy.ornl.gov/csep/CSEP/RN/RN.html

Not what you need for your class, but good nontheless... :-)

First, the default nVidia driver is the Nouveau driver (open source - ok but not great for high-performance video). Next, to install the proprietary driver that you download from nVidia, you need to blacklist the Nouveau driver, reset the system to boot into text mode (/etc/inittab). Then, boot into text mode, install the proprietary driver (it is a script that will do all the right things), set the system back to GUI boot, and reboot.

You also want to be sure you have DKMS installed first so the next time the system updates the kernel, the nVidia driver will be rebuilt as necessary without your intervention.

Ok. This is a python script. There is a Makefile, and running "make" will put the script and stuff in the build directory. Then if you run "sudo make install" it will put all the stuff in the proper places so you can run vol.py to run it - it is put in /usr/bin/vol.py. There may be missing python modules that you will need to install. In my case, there were several.

Is there a Makefile? I'll download and check it out to better help you.

I won't repeat Schol-R-LEA's rant, but agree with it 100%. That said, make an effort. Show your work (code), along with where you are encountering problems. Then we may be able to help you.

To install on Linux, you will need to build from source. Here is the link: http://downloads.volatilityfoundation.org/releases/2.4/volatility-2.4.tar.gz

Download, untar with the command "tar -zxvf volatility-2.4.tar.gz". Go into the directory created. There may be a configure script. If so, run that as in "./configure". If that succeeds, then next run the make command, and finally "sudo make install" to install it. The default location will be in /usr/local instead of /usr, so /usr/local/bin will need to be in your path environment variable.

Are you trying to write a tool that provides audio output for the user?

If you aren't a competent programmer, especially with Java skills, then you aren't going to become a good Android developer. Android Dalvik applications ARE Java. Focus on object-oriented design and programming, which is what Java is all about.

Without the basics, you are going to be stuck with elementary skills.

Better, but not good enough as yet. First, in the "Choosing Index" block on line 49, use a switch statement instead of a bunch of conditional statements, as in switch(choice1_index). Also, in lines 40-47, after you have captured the value of decision_array[0], you start your index at 0 instead of 1, resulting in a redundant (and possibly incorrect) choice1_index value. That's all I have time for now.