Professional Documents
Culture Documents
c
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/wait.h>
void collatz_sequence(int n) {
printf("%d ", n);
while (n != 1) {
if (n % 2 == 0)
n = n / 2;
else
n = 3 * n + 1;
printf("%d ", n);
}
printf("\n");
}
int main() {
int default_starting_number = 35;
return 0;
}
int x;
pid_t process;
printf("Enter the value of n: ");
scanf("%d %d %lf", &n, &salt, &val);
if (process == 0) {
collatz(x, salt);
printf("\n Child %d (PID: %d)\n", i, getpid());
break; // Add a break to exit the loop in child processes
} else {
wait(NULL);
printf("\n Parent %d (PID: %d)\n", i, getpid());
x += 3; // Increment x for the next iteration
}
}
return 0;
}
3)fibo.cpp
#include <iostream>
#include <thread>
#include <vector>
int main() {
int numFibonacci;
cout << "Enter the number of Fibonacci numbers to generate: ";
cin >> numFibonacci;
vector<int> fibSequence(numFibonacci);
return 0;
}
4)prime.cpp
#include <iostream>
#include <thread>
#include <vector>
int main() {
int maxNumber;
std::cout << "Enter a number: ";
std::cin >> maxNumber;
return 0;
}
5)virtualaddress.cpp
#include <stdio.h>
#include <stdlib.h>
int main() {
unsigned int virtual_address;
return 0;
}
6)avgmax.cpp
#include <iostream>
#include <thread>
#include <vector>
#include <numeric>
#include <algorithm>
#include <limits>
int main() {
std::vector<int> numbers = {90, 81, 78, 95, 79, 72, 85};
double average;
int maximum;
int minimum;
avgThread.join();
maxThread.join();
minThread.join();
return 0;
}