Which of the following Internet protocols is used to request and send pages and files on the World Wide Web?

I have no idea, this has two parts. Any help I would love.

lana [24]

Answer:

2that is the question??? then many I could help

7 0

2 years ago

Select all the correct answers.

inysia [295]

Answer:

Buyers can source products from anywhere in the world.

Your purchases are delivered to the location you specify.

Explanation:

E-commerce refers to the process of buying and selling goods and services through the internet or the virtual world. The economic and business transaction done through this process constitutes electronic commerce or e-commerce.

Two advantages for buyers are that the <u>buyer can source the goods and products from all over the world and also get them delivered at the location specified</u>. This allows for an easy and effortless transaction and also saves the buyer's time and energy. With things available at just a touch of an electronic screen, the buyer can get products from anywhere and get them delivered at his/ her doorstep or for that matter, anywhere he/she wished it delivered, with no extra effort from his side.

Thus, the correct answers are the third and fourth options.

4 0

3 years ago

A 16M X 16 main memory is built using 512K X 8 RAM chips and memory is word addressable.

Yanka [14]

Answer

The answer and procedures of the exercise are attached in the following archives.

Step-by-step explanation:

You will find the procedures, formulas or necessary explanations in the archive attached below. If you have any question ask and I will aclare your doubts kindly.

7 0

3 years ago

Write a java program called allDigitsOdd that returns whether every digit of a positive integer is odd. Return true if the numbe

Vlada [557]

Answer:

public class Digits

{

public static boolean allDigitsOdd(int num)

{

boolean flag=true;

int rem;

while(num>0)

{

rem=num%10;

num=num/10;

if(rem%2==0) // if a even digit found immediately breaks out of loop

{

flag=false;

break;

}

return flag; //returns result

}

public static void main(String args[])

{

System.out.println(allDigitsOdd(1375)); //returns true as all are odd digits

}

OUTPUT :

true

Explanation:

Above program has 2 static methods inside a class Digits. Logic behind above function is that a number is divided by 10 until it is less than 0. Each time its remainder by 0 is checked if even immediately breaks out of the loop.

4 0

3 years ago

Let's implement a classic algorithm: binary search on an array. Implement a class named BinarySearcher that provides one static

yKpoI14uk [10]

Answer:

Hope this helped you, and if it did , do consider giving brainliest.

Explanation:

import java.util.ArrayList;

import java.util.List;

//classs named BinarySearcher

public class BinarySearcher {

// main method

public static void main(String[] args) {

// create a list of Comparable type

List<Comparable> list = new ArrayList<>();

// add elements

list.add(1);

list.add(2);

list.add(3);

list.add(4);

list.add(5);

list.add(6);

list.add(7);

// print list

System.out.println("\nList : "+list);

// test search method

Comparable a = 7;

System.out.println("\nSearch for 7 : "+search(list,a));

Comparable b = 3;

System.out.println("\nSearch for 3 : "+search(list,b));

Comparable c = 9;

System.out.println("\nSearch for 9 : "+search(list,c));

Comparable d = 1;

System.out.println("\nSearch for 1 : "+search(list,d));

Comparable e = 12;

System.out.println("\nSearch for 12 : "+search(list,e));

Comparable f = 0;

System.out.println("\nSearch for 0 : "+search(list,f));

}

// static method named search takes arguments Comparable list and Comparable parameter

public static boolean search(List<Comparable> list, Comparable par) {

// if list is empty or parameter is null the throw IllegalArgumentException

if(list.isEmpty() || par == null ) {

throw new IllegalArgumentException();

}

// binary search

// declare variables

int start=0;

int end =list.size()-1;

// using while loop

while(start<=end) {

// mid element

int mid =(start+end)/2;

// if par equal to mid element then return

if(list.get(mid).equals(par) )

{

return true ;

}

// if mid is less than parameter

else if (list.get(mid).compareTo(par) < 0 ) {

start=mid+1;

}

// if mid is greater than parameter

else {

end=mid-1;

}

// if not found then retuen false

return false;

}

}import java.util.ArrayList;

import java.util.List;

//classs named BinarySearcher

public class BinarySearcher {

// main method

public static void main(String[] args) {

// create a list of Comparable type

List<Comparable> list = new ArrayList<>();

// add elements

list.add(1);

list.add(2);

list.add(3);

list.add(4);

list.add(5);

list.add(6);

list.add(7);

// print list

System.out.println("\nList : "+list);

// test search method

Comparable a = 7;

System.out.println("\nSearch for 7 : "+search(list,a));

Comparable b = 3;

System.out.println("\nSearch for 3 : "+search(list,b));

Comparable c = 9;

System.out.println("\nSearch for 9 : "+search(list,c));

Comparable d = 1;

System.out.println("\nSearch for 1 : "+search(list,d));

Comparable e = 12;

System.out.println("\nSearch for 12 : "+search(list,e));

Comparable f = 0;

System.out.println("\nSearch for 0 : "+search(list,f));

}

// static method named search takes arguments Comparable list and Comparable parameter

public static boolean search(List<Comparable> list, Comparable par) {

// if list is empty or parameter is null the throw IllegalArgumentException

if(list.isEmpty() || par == null ) {

throw new IllegalArgumentException();

}

// binary search

// declare variables

int start=0;

int end =list.size()-1;

// using while loop

while(start<=end) {

// mid element

int mid =(start+end)/2;

// if par equal to mid element then return

if(list.get(mid).equals(par) )

{

return true ;

}

// if mid is less than parameter

else if (list.get(mid).compareTo(par) < 0 ) {

start=mid+1;

}

// if mid is greater than parameter

else {

end=mid-1;

}

// if not found then retuen false

return false;

}

7 0

3 years ago