Loop takes only positive numbers and terminates once it encounters a negative numbers.
Answer and Explanation:
Using javascript:
Var positiveInt= window.prompt("insert positive integer");
While(positiveInt>=0){
Alert("a positive integer");
Var positiveInt= window.prompt("insert positive integer");
}
Or we use the do...while loop
Var positiveInt= window.prompt("insert positive integer");
do{
Var positiveInt= window.prompt("insert positive integer");
}
While (positiveInt>=0);
The above program in javascript checks to see if the input number is negative or positive using the while loop condition and keeps executing with each input until it gets a negative input
import java.util.Scanner;
public class JavaApplication70 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println("Input a String:");
String txt = scan.nextLine();
System.out.println("Input an integer:");
int num = scan.nextInt();
String newTxt = "";
int w = 0;
for (int i = txt.length()-1; i >= 0; i--){
char c = txt.charAt(i);
while (w < num){
newTxt += c;
w++;
}
w = 0;
}
System.out.println(newTxt);
}
}
I hope this helps!
Software as a Service cloud model is ideal for Rita’s business. SaaS are office solutions that allow Rita’s small business to work more efficiently and in a more organized way. Most SaaS applications are used for invoicing and accounting, sales, performance monitoring, and overall planning. SaaS applications can save Rita money. They do not require the deployment of a large infrastructure at her location. As a result, it drastically reduces the upfront commitment of resources. Whoever manages SaaS’s IT infrastructure running the applications brings down fees for software and hardware maintenance. SaaS has generally been acknowledged to be safer than most on-premise software.
Answer:
The programming code can be found in the explanation part, please go through it.
Explanation:
Code:
#include<stdio.h>
#include<stdlib.h>
#include <pthread.h>
// function check whether a number
// is prime or not
int isPrime(int n)
{
// Corner case
if (n <= 1)
return 0;
// Check from 2 to n-1
for (int i = 2; i < n; i++)
if (n % i == 0)
return 0;
return 1;
}
void* printPrimes(void *vargp)
{
int *n = (int *)vargp;
int i=0;
for (i=2;i<=n;i++)
{
if (isPrime(i)) printf("%d\n", i);
}
}
// Driver Program
int main(int argc, char* argv[])
{
int n = atoi(argv[1]);
pthread_t tid;
pthread_create(&tid, NULL, printPrimes, (void *)n);
pthread_exit(NULL);
return 0;
}
