All categories

3 years ago

____ is a style of programming that focuses on the step-by-step sequence of instructions and operations.

Computers and Technology

2 answers:

mario62 [17]3 years ago

7 0

Answer: Algorithm

Explanation: An algorithm is a plan, a set of step-by-step instructions to solve a problem. it involves three basic building blocks to use when designing algorithms. these are.,

1. Sequencing

2. Selection

3. Iteration

Klio2033 [76]3 years ago

6 0

Answer:

Procedural programming

Explanation:

In procedural programming, the main aim is to use procedures to execute instructions and operations. A procedure is actually a step-by-step and/or ordered sequence of instructions to be executed and operations to be performed. A procedure could be a statement, a function, a subprogram or a subroutine that are invoked or run to perform specific tasks.

Compared to object oriented programming (OOP) style which uses classes and objects to implement functionalities, procedural programming makes use of modules. Large application programs are divided into sub-programs called modules that can be run and tested separately. In other words, a module is a part of a big application program that can run separately.

Examples of programming languages that use the procedural programming style are;

i. FORTRAN - Formula Translator

ii. COBOL - Common Basic Oriented Language

iii. Java (Java also uses the object oriented programming style)

iv. BASIC - Beginner's All-purpose Symbolic Instruction Code.

You might be interested in

_________ is the start up sequence a computer conducts.

Travka [436]

Answer:

Booting

Explanation:

Booting is the start up sequence a computer conducts when it is being turned on. The booting is done by the operating system. The booting process is usually started when a hardware on the computer is pressed or by a software command. For a windows computer, the BIOS is used to start the booting sequence. These boot sequence is called boot order or BIOS boot sequence.

6 0

4 years ago

I can create spreadsheets in Google Draw. False True

Over [174]

False, it's usually only in google sheets.

5 0

3 years ago

Read 2 more answers

which endpoint application runs on an endpoint device that only detects an attack in an endpoint device? chqgg

WARRIOR [948]

A host-based intrusion detection system works similarly to a network-based intrusion detection system in that it can monitor and analyze both the internal workings of a computer system and the network packets on its network ports.

<h3>What is Host-Based IPS?</h3>

A host-based intrusion detection system works similarly to a network-based intrusion detection system in that it can monitor and analyze both the internal workings of a computer system and the network packets on its network ports.
The Host-based Intrusion Prevention System (HIPS) guards against malicious software and other activities that aim to harm your computer. HIPS uses sophisticated behavioral analysis in conjunction with network filtering's detection capabilities to keep track of active programs, files, and registry keys.
The integrated endpoint security system known as endpoint detection and response (EDR), also referred to as endpoint threat detection and response (ETDR), combines real-time continuous monitoring and gathering of endpoint data with rules-based automated reaction and analysis capabilities.

To learn more about Host-Based IPS refer to:

brainly.com/question/20490376

#SPJ4

5 0

1 year ago

Using Sequential Search on an array of size n, the search key is definitely present in the array. The probability of matching th

MissTica

Answer:

(11n-5) / 12 is correct answer.

Explanation:

The Probability that key will match to nth term = 1/2

The Probability that key will match to n-1th term = 1/3

As all other probabilities are equal

The Total Probability that key matches to any of 1 to n-2 index = 1 - 1/2 - 1/3 = 1/6

The Probability that key matches to any of 1 to n-2 index = (1/6) / n-2 = (1/6)* (n-2))

Let P(i) = Probability that key matches to ith index.

The Average time complexity = 22 i=1 P(i) * i

The Average time complexity = 1/(6(n-2) * ( sum of 1 to n-2 ) + (n-1) / 3 + n/2

The Average time complexity = 1/(6(n-2) * ( n-2)*(n-1) / 2 + ( n-1) / 3 + n/2

The Average time complexity = 1/6 * (n-1)/2 + (n-1)/3 + n/2

The Average time complexity = (n-1)/12 + (n-1)/3 + n/2

The Average time complexity = (n-1 + 4 * n - 4 * 1 +6 * n)/12

The Average time complexity = 11n-5 / 12

so (11n-5) / 12 is correct answer.

7 0

3 years ago

25% of 60 min<br> 20% of 60 min<br> 33%% of 60 min

Alexxx [7]

15
12
19.8 cool cool cool

7 0

2 years ago