When conducting research on the internet, what is a starting point for determining how to start the research?

It is a good idea to include your teacher’s name on a title page.

kkurt [141]

I usually include my teachers name in the upper right hand corner along with the date my name and the subject.

6 0

3 years ago

Which term refers to an interface between HTML elements and JavaScript program code that allows JavaScript code to manipulate HT

vfiekz [6]

I believe the answer is D, document object model. Conditional Statements deal with if statements, iterative structures are while and for loops, HTML tags are the tags which help to format and define a webpage, and src attribute deal with specifying external sources for certain tags.

4 0

2 years ago

What is the job title of someone who works with video and/or film?

boyakko [2]

Producer, videographer

4 0

3 years ago

In which case will the linear search return the lowest value faster than the<br> binary search?

Sveta_85 [38]

Answer:

A linear search is one that scans every record/file until it discovers the value being searched for.

Binary search, on the other hand, is also known as <em>Logarithmic search</em>. It is used to locate the position of a value inside an array that has already been sorted.

The linear search will return the lowest value faster than the binary search when small arrays are involved.

This will only be feasible when the array is sorted prior.

Cheers!

5 0

3 years ago

a password to a certain database consists of digits that cannot be repeated. if the password is known to consist of at least 8 d

BaLLatris [955]

Answer:

$\frac{10!}{2}mins$

Explanation:

12 seconds to try one combination will be equivalent to $\frac{1}{12}\times 60 = \frac{1}{5} \ mins$

Password contain at least 8 digit i.e. password can contain 8, 9, 10 digit.

Password cannot contain more than 10 digit because it will give room for repetition which it is clearly stated that digit cannot be repeated.

Possible digit that can be used: 9,8,7,6,5,4,3,2,1,0.

Total number of passwords combination possible for each position in 8 digit.

1st position = 10, 2nd position = 9, 3rd position = 8, 4th position = 7, 5th position = 6, 6th position = 5, 7th position = 4, 8th position = 3. Total number of passwords combination possible in 8 digit is equivalent to $\frac{10!}{2}$ .

Total number of passwords combination possible for each position in 9 digit.

1st position = 10, 2nd position = 9, 3rd position = 8, 4th position = 7, 5th position = 6, 6th position = 5, 7th position = 4, 8th position = 3, 9th position = 2. Total number of passwords combination possible in 9 digit is equivalent to $\frac{10!}{1}$ .

Total number of passwords combination possible for each position in 10 digit.

1st position = 10, 2nd position = 9, 3rd position = 8, 4th position = 7, 5th position = 6, 6th position = 5, 7th position = 4, 8th position = 3, 9th position = 2, 10th position = 1. Total number of passwords combination possible in 10 digit is equivalent to 10!.

Adding them up and multiplying by $\frac{1}{5} \ mins$ to get the total number of time needed to guarantee access to database = $[\frac{10!}{2}\times\ \frac{10!}{1} \times 10!] \frac{1}{5}\ mins = \frac{10!}{2}$

7 0

3 years ago