1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
devlian [24]
3 years ago
5

Which is the best description of the laws governing IT professionals?

Computers and Technology
1 answer:
Vinvika [58]3 years ago
4 0

Answer: D, Most laws are directed at the information, data, or intellectual property rather than the IT professional.

Explanation:i just took the test

You might be interested in
Chad, a computer programming student, just finished writing a computer program. In order to check whether the program performs t
dangina [55]
He'd need to use a compiler. 
3 0
3 years ago
Read 2 more answers
You are a visitor at a political convention with delegates; each delegate is a member of exactly one political party. It is impo
Fed [463]

Answer:

The algorithm is as follows:

Step 1: Start

Step 2: Parties = [All delegates in the party]

Step 3: Lent = Count(Parties)

Step 4: Individual = 0

Step 5: Index = 1

Step 6: For I in Lent:

Step 6.1: If Parties[Individual] == Parties[I]:

Step 6.1.1: Index = Index + 1

Step 6.2: Else:

Step 6.2.1 If Index == 0:

Step 6.2.2: Individual = I

Step 6.2.3: Index = 1

Step 7: Else

Step 7.1: Index = Index - 1

Step 8: Print(Party[Individual])

Step 9: Stop

Explanation:

The algorithm begins here

Step 1: Start

This gets the political parties as a list

Step 2: Parties = [All delegates in the party]

This counts the number of delegates i.e. the length of the list

Step 3: Lent = Count(Parties)

This initializes the first individual you come in contact with, to delegate 0 [list index begins from 0]

Step 4: Individual = 0

The next person on the list is set to index 1

Step 5: Index = 1

This begins an iteration

Step 6: For I in Lent:

If Parties[Individual] greets, shakes or smile to Party[i]

Step 6.1: If Parties[Individual] == Parties[I]:

Then they belong to the same party. Increment count by 1

Step 6.1.1: Index = Index + 1

If otherwise

Step 6.2: Else:

This checks if the first person is still in check

Step 6.2.1 If Index == 0:

If yes, the iteration is shifted up

Step 6.2.2: Individual = I

Step 6.2.3: Index = 1

If the first person is not being checked

Step 7: Else

The index is reduced by 1

Step 7.1: Index = Index - 1

This prints the highest occurrence party

Step 8: Print(Party[Individual])

This ends the algorithm

Step 9: Stop

The algorithm, implemented in Python is added as an attachment

<em>Because there is an iteration which performs repetitive operation, the algorithm running time is: O(n) </em>

Download txt
5 0
2 years ago
Convert to binary 140
Ber [7]

00110001 00110100 00110000

5 0
3 years ago
after clicking the start button on your computer screen desktop what option would you then select to examine systems components
xenn [34]
You would click on control panel to get to that area
7 0
3 years ago
The internet may best be compared to a
liraira [26]
I would say a calculator.
7 0
3 years ago
Read 2 more answers
Other questions:
  • Match the following tasks with their appropriate timing.
    8·1 answer
  • Select the correct answer.
    13·1 answer
  • What is the energy conversion of solar water heaters?
    12·1 answer
  • Create a story that depicts the events leading up to a vehicle crash fatality, the crash itself, and the emotional aftermath on
    9·1 answer
  • Students who respond promptly to e-mails are following which netiquette rule?
    13·2 answers
  • Does any one here play destiny on xbox one
    12·1 answer
  • Which of the following represent advantages of GPL-licensed software? Check all of the boxes that apply It is always free of cos
    12·2 answers
  • Snap Me on <br>samxavier.18​
    12·2 answers
  • Calculate the ERA
    6·1 answer
  • What color pixels are used in a camera?
    10·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!