How do i make spaces in python<br> To draw hello world

T in your computer will you use to plug in your camera?

Gnom [1K]

A tool in your computer that you will use to plug in your camera is the Universal Serial Bus (USB). If you camera has this chord and it is an Universal Serial Bus type. Then what you need is your software installer of the camera and only the USB.

7 0

4 years ago

In an average case involving an array of n elements, how many times will a sequential search function have to read the array to

Strike441 [17]

Answer:

n/2 times

Explanation:

The number of times a sequential search function will have to read the array in other to locate a specific value is : n/2 times

In an average case to locate a specific value using the a sequential/linear search the elements of the array will be searched in other to get a specific value and this will take n/2 number of attempts/times.

a sequential search is used to search for a value contained in a data set that has a linear relationship with other values contained in the data set

3 0

4 years ago

Identify the type of error described

Arturiano [62]

Answer:

ZeroDivisionError

ValueError

Explanation:

ZeroDivisionError occurs when you attempt to divide a number by $0$ .

ValueError occurs when the argument passed into a function holds the wrong value. In this case, the string is not numeric which cannot be passed into the float() function.

Hope this helps :)

5 0

3 years ago

Write the definition of a method named add that receives a reference to a Scanner object associated with a stream of input consi

Lisa [10]

Answer:

import java.util.*;

class Main

{

public static void main(String[] args)

{

System.out.println("Enter integers and 0 to exit");

Scanner a1=new Scanner(System.in);

System.out.println(add(a1));

}

public static int add(Scanner a1)

{

int total = a1.nextInt();

if (a1.hasNextInt())

{

total =total +add(a1);

}

return total;

}

Explanation:

The only thing that needs explanation here is hasnextInt. This returns true if entered number is integer and false if entered is not an integer. And rest is as shown in the program.

5 0

4 years ago

. In the select algorithm that finds the median we divide the input elements into groups of 5. Will the algorithm work in linear

8090 [49]

Answer:

we have that it grows more quickly than linear.

Explanation:

It will still work if they are divided into groups of 77, because we will still know that the median of medians is less than at least 44 elements from half of the \lceil n / 7 \rceil⌈n/7⌉ groups, so, it is greater than roughly 4n / 144n/14 of the elements.

Similarly, it is less than roughly 4n / 144n/14 of the elements. So, we are never calling it recursively on more than 10n / 1410n/14 elements. T(n) \le T(n / 7) + T(10n / 14) + O(n)T(n)≤T(n/7)+T(10n/14)+O(n). So, we can show by substitution this is linear.

We guess T(n) < cnT(n)<cn for n < kn<k. Then, for m \ge km≥k,

\begin{aligned} T(m) & \le T(m / 7) + T(10m / 14) + O(m) \\ & \le cm(1 / 7 + 10 / 14) + O(m), \end{aligned}

T(m)

≤T(m/7)+T(10m/14)+O(m)

≤cm(1/7+10/14)+O(m),

therefore, as long as we have that the constant hidden in the big-Oh notation is less than c / 7c/7, we have the desired result.

Suppose now that we use groups of size 33 instead. So, For similar reasons, we have that the recurrence we are able to get is T(n) = T(\lceil n / 3 \rceil) + T(4n / 6) + O(n) \ge T(n / 3) + T(2n / 3) + O(n)T(n)=T(⌈n/3⌉)+T(4n/6)+O(n)≥T(n/3)+T(2n/3)+O(n) So, we will show it is \ge cn \lg n≥cnlgn.

\begin{aligned} T(m) & \ge c(m / 3)\lg (m / 3) + c(2m / 3) \lg (2m / 3) + O(m) \\ & \ge cm\lg m + O(m), \end{aligned}

T(m)

≥c(m/3)lg(m/3)+c(2m/3)lg(2m/3)+O(m)

≥cmlgm+O(m),

therefore, we have that it grows more quickly than linear.

5 0

3 years ago

How do i make spaces in python To draw hello world