All categories

3 years ago

A(n) guiiconfatmenu is a list of commands that tell your computer what to do.

Computers and Technology

2 answers:

Maslowich3 years ago

6 0

Answer:

A Menu is a list of commands that tell your computer what to do.

MARK AS BRSINLIEST

Explanation:

natima [27]3 years ago

3 0

Yes that is right a guiiconfatmenu is a list of commands that your computer will tell you to do

You might be interested in

What is the Moore's law

Nadya [2.5K]

Answer:

Hi, in the law of Moore we can express aproxitmaly for each <em>two years</em> is duplicated the number of transitors in a microprocessor.

Explanation:

In around 26 years the number of transitors has increased about 3200 times, a transitor is a way to regulate the current voltage flow and can be act like a <em>switch</em> for an electronic signal.

I hope it's help you.

4 0

3 years ago

The fast movement of briefly flashed images in an animated motion picture produces what effect? subliminal messaging convergence

REY [17]

Answer:

The answer is Stroboscopic movement

Explanation:

Stroboscopic movement occurs when we do not see a motion continuously but in discrete shots. It is an effect in which we see an object at one place and after another instant the object seems to have shifted it's position.

Auto kinetic effect is an effect in which a stationary point of light appears to move.It occurs as our brains can perceive motion relative to some other object and cannot observe ,motion along a featureless terrain or environment.

Phi effect causes an observer to perceive motion in stationary objects.

3 0

2 years ago

List the five body functions that monitor homeostasis.

IceJOKER [234]

You can also have homeostatis by shivering and sweating

6 0

3 years ago

MARKING BRAINLIEST

BabaBlast [244]

Answer: Well, first of all, you might want to change websites. I suggest khan academy.

anyways if your a begnner *Like me* The you might wanna try Java Script! in other words i do not know how to work Python

8 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

2 years ago