Please can someone help me answer this question.

Replace any alphabetic character with '_' in 2-character string passCode. Ex: If passCode is "9a", output is:9_Hint: Use two if

Mashcka [7]

Answer:

Following is given the code as required.

I hope it will help you!

Explanation:

7 0

2 years ago

Suppose Host A sends two TCP segments back to back to Host B over a TCP connection. The first segment has sequence number 90; th

Anna71 [15]

Answer:

a) Consider sequence numbers,First segment=90

Second segment=110

Data in the first segment = 110-90 =20

b) Consider the first segment is lost but the second segment arrives at B. In the acknowledgment that Host B sends to Host A, then the acknowledgment number will be first segment of sequence number, that is 90.

Explanation:

8 0

2 years ago

Read 2 more answers

Writing in Java, write a program that prompts the user to input an integer and then outputs both the individual digits of the nu

larisa [96]

Answer:

//Here is code in java.

import java.util.*;

class Main

{

public static void main (String[] args) throws java.lang.Exception

{

try{

int in;

//scanner class object to read the input

Scanner scr=new Scanner(System.in);

// variable to keep running total

int total=0;

System.out.println("please enter an Integer:");

// read the input first time

in=scr.nextInt();

System.out.print("individual digits of "+in+" is ");

if(in<0)

{

in=-(in);

}

//call the function to print the digits of number

print_dig(in);

System.out.println();

//calculate the sum of all digits

do{

int r=in%10;

total=total+r;

in=in/10;

}while(in>0);

//print the sum

System.out.println("total of digits is: "+total);

}catch(Exception ex){

return;}

}

//recursive function to print the digits of number

public static void print_dig(int num)

{

if(num==0)

return;

else

{

print_dig(num/10);

System.out.print(num%10+" ");

}

Explanation:

Read a number with the help of object of scanner class.if the input is negative

then make it positive number before calling the function print_dig().call

the recursive method print_dig() with parameter "num".It will extract the digits

of the number and print then in the order. Then in the main method, calculate

sum of all the digits of number.

Output:

please enter an Integer:

3456

individual digits of 3456 is 3 4 5 6

total of digits is: 18

please enter an Integer:

-2345

individual digits of -2345 is 2 3 4 5

total of digits is: 14

6 0

2 years ago

Define a function CoordTransform() that transforms its first two input parameters xVal and yVal into two output parameters xValN

NISA [10]

Answer:

#include <iostream>

using namespace std;

void CoordTransform(int *ptr1, int *ptr2);

int main()

{

int xVal;

int yVal;

cout<<"please enter two valid integers";

cin>>xVal;

cin>>yVal;

CoordTransform(&xVal , &yVal);

int xValNew=xVal;

int yValNew=yVal;

cout<<xValNew<<yValNew;

return 0;

}

void CoordTransform(int *ptr1, int *ptr2)

{

int a = *ptr1;

*ptr1=(*ptr1+1)*2;

*ptr2=(*ptr2+1)*2;

}

Explanation:

It will return new values in previously defined variables

coding language: c++

3 0

2 years ago

Read 2 more answers

There are N bulbs numbered from 1 to N, arranged in a row. The first bulb is plugged into the power socket and each successive b

Ksivusya [100]

Answer:

The code is given below with appropriate comments

Explanation:

// TestSolution class implementation

import java.util.Arrays;

public class TestSolution

{

// solution function implementation

public static int solution(int[] arr)

{

// declare the local variables

int i, j, count = 0;

boolean shines;

// use the nested loops to count the number of moments for which every turned on bulb shines

for (i = 0; i < arr.length; i++)

{

shines = true;

for (j = i + 1; j < arr.length && shines; j++)

{

if (arr[i] > arr[j])

shines = false;

}

if (shines)

count++;

}

// return the number of moments for which every turned on bulb shines

return count;

} // end of solution function

// start main function

public static void main(String[] args)

{

// create three arrays named A, B, and C

int[] A = {2, 1, 3, 5, 4};

int[] B = {2, 3, 4, 1, 5};

int[] C = {1, 3, 4, 2, 5};

// generate a random number N within the range range[1..100000]

int N = 1 + (int)(Math.random() * 100000);

// create an array named D of size N

int[] D = new int[N];

// fill the array D with the distinct random numbers within the range [1..N]

int i = 0;

while(i < N)

{

int num = 1 + (int)(Math.random() * N);

boolean found = false;

for(int j = 0; j < i && !found; j++)

{

if(D[j] == num)

found = true;

}

if(!found)

{

D[i] = num;

i++;

}

// print the elements and number of moments of the arrays A, B, and C

System.out.println("Array A: " + Arrays.toString(A) + " and Moments: " + solution(A));

System.out.println("Array B: " + Arrays.toString(B) + " and Moments: " + solution(B));

System.out.println("Array C: " + Arrays.toString(C) + " and Moments: " + solution(C));

// print the size and number of moments of the array D

System.out.println("Size(N) of Array D: " + N + " and Moments: " + solution(D));

} // end of main function

} // end of TestSolution class

3 0

2 years ago