All categories

2 years ago

How did machines get involved throughout the years?

Computers and Technology

1 answer:

Nataliya [291]2 years ago

4 0

Answer:

Although the primary goal of a political machine is keeping itself in power rather than providing good government, machines have been responsible for restructuring city governments to centralize authority, improving facilities and services, helping to assimilate immigrant groups, and encouraging the growth of business and industry. Supporters of political machines say that they “work” and that consolidating power in the hands of a boss.

Explanation:a political machine is a political group in which an authoritative leader or small group command the support of a corps of supporters and businesses

You might be interested in

What linux command displays the ip address and subnet mask?

Nookie1986 [14]

Type "ifconfig" at the terminal prompt, then press the "Enter" key. The IP address is labeled as "inet addr." The subnet is labeled as "Mask."

step 2

Type "netstat -r" at the command prompt, then press the "Enter" key to view the gateway address.

3 0

3 years ago

"3. 4. Simple number search We will pass you 2 inputs an list of numbers a number, N, to look for Your job is to loop through th

Arisa [49]

Answer:

Following is given the detailed solution to the question given.

First image contains source code. All the steps are described with help of comments.
Second image contains the output or the program given.

I hope it will help you!

Explanation:

4 0

3 years ago

Input a number and find the square root only if the number entered is greater than or equal to zero.

Svetradugi [14.3K]

number = float(input("Enter a number: "))

if number >= 0:

print(number**0.5)

I hope this helps!

5 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

Write a do - while loop to get 20 numbers from the user and sum them together. output the sum after the loop. declare any variab

Lilit [14]

A do while loop in this situation is actually stupid. A for loop or while loop will suit this purpose better, since you do not need to make sure it executes at least once for the given condition. Do while loops are good for situations where the condition may not be true initially, and you'd like to guarantee execution at least once. E.g circular linked list node counter.

8 0

2 years ago