I'm making an x86 emulator with C++ (currently 8086/80186 with some little unfound errors). When I'm compiling all the files (deleting all *.o files and running make), the emulator runs fine (still some errors, but it runs). When I run make, just having one file adjusted, the emulator (JPCSP, a PSP emulator) gives me an invalid opcode/address fault. The emulator does use some pointers at different places though (mostly dynamic memory and optimization), can this be the cause? Causing addressing errors with partial recompilation using make?
Program is to add two fractions together like so..
This program adds fractions. ‘Y’ continues, any other key exits program =================================================== Enter numerator 1 ==> 1 Enter denominator 1 ==> 3 Enter numerator 2 ==> 1 Enter denominator 2 ==> 6 1 1 1 --- + --- = --- 3 6 2 ----------------------------------------------------- Continue? Y or N! ==> n
My question is that i need each input to be a number. if a character is entered i want it to output something like..
This program adds fractions. ‘Y’ continues, any other key exits program =================================================== Enter numerator 1 ==> 1 Enter denominator 1 ==> a You need to enter a number here. Press any key to continue.
and then clear the part where the letter was entered.
This program adds fractions. ‘Y’ continues, any other key exits program =================================================== Enter numerator 1 ==> 1 Enter denominator 1 ==>
My address book will be simple, and the thing's that I'm expecting to use in it are :
Pointers, Linked Lists Malloc Structs Typedefs Makefile, header file Putting functions into different program files
I have started the program trying to create a struct, and getting it working with a couple of entries before going onto user input and splitting it up.
Code:
#include <stdio.h> #include <stdlib.h> int main(void) { // Struct type address book. Just a name, a number and a pointer
[Code] .....
I'm a bit lost at this point... My knee jerk thought is to create a for loop, and cycle through the list.
I'm not sure how this would apply to this though? Without using the familiar type of print loop such as :
Code: for (i = 0; ;i++) { printf("%i ", array[i]; }
I'm thinking that I need to create a temporary struct that can be used to assign the value of the next struct in the list, and then somehow print from that....
I'll try and write the logic out :
while temp != NULL (The last node value is assigned NULL to show us where the end of the list is)
create a temporary pointer that can be used to keep track of where we are in the list.
print out the current entry name and number
then assign the temp pointer value to the * next of the current struct. So if we are in entry1 the *next should be the address of entry 2.
Print out entry 2 name and number, assign entry 2 next to the temp value.
I made a program and when I try to use the main driver to instantiate everything it says invalid storage class for a function. All of my code is in 4 separate files i'm just trying to get it to run now.
i want to modify value of whole array by passing it to a function and make each value of array multiplied by 3 ,return the value to main and print it using pointer.
error : invalid Lvalue is the error
Code:
#include<stdio.h> main() { int i,arr[10]; for (i=0;i<=9;i++) { printf("Enter value of arr[%d] : ",i); scanf("%d",&arr[i]);
I have this piece of code from the book "Modern C++ Design" that checks for compile-time error. When i tried to compile it, i get the error "invalid application of size of to function type". How to make this compiler-time checker work?
I need to do it to avoid calling a function of my process from injected code.
So would like to hook this function to check whether the call is from the current module or it is from an external module, then I compare the address of the instruction who did the call with the module address range.
/* Task: create a function that determines prime number and use it to print out prime numbers from 0-50: */
Function prototype: Should return a `bool` (because it answers a yes/no question) and should take in a single int (to ask whether it's prime).
- An int greater than 2 is prime if it is not divisible by any number between 2 and itself, not including itself. - Use this function to print out the primes less than 50. Check it against my list: 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47
#include <iostream> using namespace std; int prime(int&x) { if(x%2==1)
[Code] ....
It is printing out the correct prime numbers but also printing this between each number: 1629974960
I'm not a programmer, at least, not a good one. I'm a researcher and I need to implement this function and test it and use it for my research. I tested some clustering methods in JAVA and Matlab and also I want to test it on C. I don't know too much about programming, especially about C, I know nothing. I tried to implement some basic methods but I failed.
It's all about K-Means Algorithm. I'm working on a disease and I'm trying to find ways to early diagnosis. Anyway, these are details. The thing is, I found a 'free to use' function but I don't know how can I use it. I tried to learn something from Net, I downloaded a compiler, I paste the code and I get many errors... And I heard that I have to do some "calling function" stuff but I don't know how to..
The code is in the link below: URL....It's not imperative that using this function, it can be another one but it had to written in C.
My errors are at the end of the program in two function calls within the definition of the InsertByValue function. g++ does not seem to recognize NumArray as a valid parameter.
#include <iostream> #include <assert.h> using namespace std; const int CAPACITY = 20;
/* Displays the content of an int array, both the array and the size of array will be passed as parameters to the function @param array: gives the array to be displayed @param array_size: gives the number of elements in the array */ void DisplayArray (int array[], int array_size);
I'm trying to create a function that determines the largest value in the array and then outputs the value and index. I want to values in the array to be random so I tried using the rand function, although I'm not sure where I'm supposed to put it. My main problem (I think) is outputting the correct values...
#include <iostream> #include <cstdlib> #include <ctime> using namespace std; void lastLargestIndex (int numbers[], int arraySize); int main(int argc, char** argv) { int number, arraySize = 50;
This program is incomplete as I am having difficulty creating the function that needs to find the number of perfect scores entered by the user. I have everything but the function complete ,here is my code:
Code: // Write a modular program that accepts at least 10 integer test scores from the user and stores them in an array. // The main should display how many perfect scores were entered (i.e., scores of 100), using a value-returning countPerfect function. // Input validation: Do not accept scores less than 0 or greater than 100.
#include <iostream> using namespace std; int countPerfect(int intArray[], int); // Function prototype
I have been trying to make a function that compares all the values of the array and if they are all equal will return a value to print true. The problem I am having is that regardless of what values I enter the function is always returning true. Any way to tell the program o check all the values in one command instead I put them each,
We know that function pointer for virtual function are stored in a vtable.When we have multiple function pointer entry in vtable and we call one of the virtual function then how the corresponding or correct function pointer is retrived from Vtable? Who do this stuff? In assembly code i can not see any code or logic to detrmine the correct function pointer.
Ok, so the assignment is to use a recursive function to display a request for a certain position in the Fibonacci Sequence (0, 1, 1, 2, 3, 5, 8, 13...)
The program I have written works, but it displays the wrong number in sequence. The book says that when you enter "8" you should receive "13", which is correct in the order of the sequence, though my program is producing "21" which is the next number in the sequence.
I tested it with a few more numbers and when I enter "7" it produces "13" and when I enter "6" it produces "8" and so on.
Code: //Cameron Taylor #include <stdio.h> int main(){
For whatever reason, I get an error meassage about lines 53-57 saying there is no matching function to call to. Yet the header and the prototype are correct (I think anyways).
#include <iostream> #include <string> #include <fstream> #define N 10 using namespace std; class cust{
I'd like a function to return either a value or the address of that value by the users input. So he can call the function like:
function("adress") - gets an adress, or function("value") - gets the value
I've tried both function overloading and templates, but none of them worked. He might input a character for the address and an int for the value... but...
Another strange thing that i observed is that the value returned by the function below is 0, so the output is address 0.
