Unhandled exception at 0x7c92a958 in...Access violation writing location 0x00030fb0.

Posted on 2008-10-20
Last Modified: 2011-10-03
Code runs fine for awhile and then breaks in first for loop between Counter2 = 150 and Counter2 = 450 then throws the error:

Unhandled exception at 0x009810ab in Sim HW5.exe: 0xC0000005: Access violation writing location 0x00000000.

Any ideas why?

// Sim HW4.cpp : Defines the entry point for the console application.
#include "stdafx.h"
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int _tmain(int argc, _TCHAR* argv[])
	int Counter = 0;
	int Counter2 = 0;
	int Counter3 = 0;
	const int n = 100000;
	int fj[20] = {0};
	memset(fj,0,20 * sizeof(int));
	double Divisor = 1.0;
	double Z0 = 1;
	double Zi = 0.0;
	double ZiMinusOne = 0.0;
	double Ui = 0.0;
	double TwoPowerThirtyOne;
	TwoPowerThirtyOne = pow((double)2,31);
	double v[100000];
	memset(v,0,100000 * sizeof(double)); 
	while (Counter < n+1){
		if (Counter == 0)
			ZiMinusOne = Z0;
			ZiMinusOne = Zi;
		Divisor = (floor( 16807*ZiMinusOne/(TwoPowerThirtyOne-1)));
		Zi = 16807*ZiMinusOne - (Divisor) * (TwoPowerThirtyOne-1);
		Ui = Zi/(TwoPowerThirtyOne-1);
		v[Counter] = Zi;
	for (Counter2 = 0; Counter2 < n-1; Counter2++){
		cout << Counter2 << endl;
		for (Counter3 = 0; Counter3 < 20; Counter3++){
			if (v[Counter2] >= Counter3*TwoPowerThirtyOne/20 && v[Counter2] <= (Counter3+1)*TwoPowerThirtyOne/20)
	int i, j;
	int k = 20;
	double ChiSq = 0;
	for (Counter2 = 0; Counter2 < k; Counter2++){
		cout << "fj" << Counter2 << ": " << fj[Counter2] << endl;
		ChiSq += k/n*(pow((double)(fj[Counter2]-n/k),2));
	system ("PAUSE");

Open in new window

Question by:ltdanp22

Expert Comment

ID: 22763360
Could you give us a rough idea of what exactly your code is doing?
LVL 14

Accepted Solution

wayside earned 500 total points
ID: 22763412
      const int n = 100000;
        int fj[20] = {0};

        for (Counter2 = 0; Counter2 < n-1; Counter2++){
                for (Counter3 = 0; Counter3 < 20; Counter3++){
                        if (v[Counter2] >= Counter3*TwoPowerThirtyOne/20 && v[Counter2] <= (Counter3+1)*TwoPowerThirtyOne/20)
                                fj[Counter2]++;                 // <-!!!!!!!!!!!!!!

fj has only 20 elements, Counter2 goes up to 99999 (n-1).

So you are inserting elements far beyond the end of the fj[] array by using fj[Counter2]. At some point this causes sufficient stack corruption to crash the program.


Author Comment

ID: 22764655
THANK YOU! Wayside I could kiss you. Too bad for you I'm not more attractive. Have a great day. :)

Featured Post

Gigs: Get Your Project Delivered by an Expert

Select from freelancers specializing in everything from database administration to programming, who have proven themselves as experts in their field. Hire the best, collaborate easily, pay securely and get projects done right.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

This article shows you how to optimize memory allocations in C++ using placement new. Applicable especially to usecases dealing with creation of large number of objects. A brief on problem: Lets take example problem for simplicity: - I have a G…
Examines three attack vectors, specifically, the different types of malware used in malicious attacks, web application attacks, and finally, network based attacks.  Concludes by examining the means of securing and protecting critical systems and inf…
The viewer will learn how to pass data into a function in C++. This is one step further in using functions. Instead of only printing text onto the console, the function will be able to perform calculations with argumentents given by the user.
The viewer will be introduced to the member functions push_back and pop_back of the vector class. The video will teach the difference between the two as well as how to use each one along with its functionality.

776 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question