1. Swap function: difference between pass by value and pass by reference
2. Fibonacci series. Two implementation: for loop and recursive.
3. The usage of constant, constant functions
4. Detect sequence pattern in FSM.

Question

1. Swap function: difference between pass by value and pass by reference
2. Fibonacci series. Two implementation: for loop and recursive.
3. The usage of constant, constant functions
4. Detect sequence pattern in FSM.

Joshua Pang · Accepted Answer

loop:
int fibo_loop(int n){
	int j = 1;
	int k = 1;
	int sum;
	for(int i = 2; i < n; i++){
		sum = j + k;
		j = k;
		k = sum;
	}
	return sum;
}
recursive:
int fibo_recu(int n){
	if(n <= 2){
		return 1;
	}
	else{
		return fibo_recu(n-1) + fibo_recu(n-2);
	}
}

NVIDIA

Sollicitatievraag bij NVIDIA

Antwoord op sollicitatievraag

Gevolgde bedrijven

Vacatures