Either I\'ve been staring at this code for way too long or I just can\'t figure this one out.but when I use an 8000 number text file in descending order; 8000, 7999, ... I get a segmentation fault in
Following error is received while running a java application on linux, crashing the jvm: # # A fatal error has been detected by the Java Runtime Environment:
I\'m writing a program in Python that uses a closed source API in Linux.The API sometimes works, and sometimes segfaults - crashing my program also. However, if the program runs for 10 seconds, its pa
When I run my program, I get the Segmentation Fault error.I believe it is coming from how I am using the array \"string *words\" which is privately declared in the class definition.I use it here in th
I have a project due in my operating systems class where I\'m supposed to simulate a translation lookaside buffer.
i\'m new here and first of all, i wanna apologize if i make errors in question. My problem is: i want to implement a B-tree in C, using a file to store the tree...my program reads 10000 strings of 10
node ** BST :: searchElement(node **tree, int item) { if( ((*tree)->data == item) || ( (*tree) == NULL) )
I\'m trying to create 5000 junk files, write them to a file and delete them. But this code only is writing a portion of the files to the file. ls -l | grep ^- | wc -l says I have 1598 files remaining
I am getting a segmentation fault while trying to check if some elements are NULL or not. Can anyone help?
my C program has type definition of a stack like this : typedef struct { char T[MaxEl+1][MAX_CHAR]; address TOP;
加载中,请稍侯......