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
Kaylis [27]
3 years ago
5

What happens if you try to compile and run this program?

Computers and Technology
1 answer:
Lynna [10]3 years ago
7 0

Your question is poorly formatted

<em>#include <stdio.h> </em>

<em>int main(void) { </em>

<em>int i, t[4]; </em>

<em>t[3] = 0; </em>

<em>for (i = 1; i >= 0; i--) </em>

<em>t[i] = t[3] * i; </em>

<em>printf("%d", +t[1]); </em>

<em>return 0; </em>

<em>}</em>

Answer:

It outputs 0

Explanation:

I'll start my explanation from the third line

This line declares an integer variable i and an array of 4 elements of type integer

<em>int i, t[4]; </em>

<em />

This line initialize the 3rd index element to 0

<em>t[3] = 0; </em>

<em />

The next two lines is an iteration;

The first line of the iteration iterates the value of i in descending order from 1 to 0

<em>for (i = 1; i >= 0; i--) </em>

<em />

This line of the iteration calculates t[1] as t[3] * i and t[0] as t[3] * i; Since t[3] is 0; both t[1] and t[0] will be 0

<em>t[i] = t[3] * i; </em>

<em />

This line prints t[1] which is 0

<em>printf("%d", +t[1]); </em>

You might be interested in
A contiguous subsequence of a list S is a subsequence made up of consecutive elements of S. For example, if S is 5,15,-30,10,-5,
Sindrei [870]

Answer:

We made use of the dynamic programming method to solve a linear-time algorithm which is given below in the explanation section.

Explanation:

Solution

(1) By making use of the  dynamic programming, we can solve the problem in linear time.

Now,

We consider a linear number of sub-problems, each of which can be solved using previously solved sub-problems in constant time, this giving a running time of O(n)

Let G[t] represent the sum of a maximum sum contiguous sub-sequence ending exactly at index t

Thus, given that:

G[t+1] = max{G[t] + A[t+1] ,A[t+1] } (for all   1<=t<= n-1)

Then,

G[0] = A[0].

Using the above recurrence relation, we can compute the sum of the optimal sub sequence for array A, which would just be the maximum over G[i] for 0 <= i<= n-1.

However, we are required to output the starting and ending indices of an optimal sub-sequence, we would use another array V where V[i] would store the starting index for a maximum sum contiguous sub sequence ending at index i.

Now the algorithm would be:

Create arrays G and V each of size n.

G[0] = A[0];

V[0] = 0;

max = G[0];

max_start = 0, max_end = 0;

For i going from 1 to n-1:

// We know that G[i] = max { G[i-1] + A[i], A[i] .

If ( G[i-1] > 0)

G[i] = G[i-1] + A[i];

V[i] = V[i-1];

Else

G[i] = A[i];

V[i] = i;

If ( G[i] > max)

max_start = V[i];

max_end = i;

max = G[i];

EndFor.

Output max_start and max_end.

The above algorithm takes O(n) time .

4 0
3 years ago
1. The opportunity to create several equations for launching program files is called
vladimir1956 [14]

\huge\underline\color{brown}\boxed{☕ANSWER:☕}

_________________________________

1. The opportunity to create several equations for launching program files is called

a) creating a file

b) creating a folder

✒ <u>c) creating a directory</u>

d) creating a shortcut

2. Unless you specify otherwise most spreadsheet packages assume all cell addresses are

a) macros

b) relative cell reference

c) absolute cell reference

✒<u> d) mix cell references</u>

3. Which of the following is not a type of lcon

a) program icon

✒ <u>b) document icon </u>

c) folder icon

d) utility icon

_________________________________

\normalsize\underline\color{yellow}\boxed{TheQuestionner}

\large\mathbb\color{orange}{Correct \: me \: if \: im \: wrong}

7 0
2 years ago
____ are diagrams used in mathematics and logic to help describe the truth of an entire expression based on the truth of its par
Bad White [126]
<span>Truth tables are diagrams used in mathematics and logic to help describe the truth of an entire expression based on the truth of its parts.

A truth table shows all the possible combinations (outputs) that can be produced from the given inputs. They are mainly used in Boolean algebra.</span>
4 0
3 years ago
All air transportation carriers transport freight to some extent. True False
SCORPION-xisa [38]
TRUE !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
4 0
4 years ago
Read 2 more answers
Lots of data can be transferred in short time, when we have,
dusya [7]

Answer: B. Higher Bandwidth

8 0
2 years ago
Read 2 more answers
Other questions:
  • What protocol suite below is the most commonly used protocol for local area network (lan) communication?
    8·1 answer
  • Pressing the e key while in edit mode will exit the interaction mode<br><br> true<br><br> false
    7·1 answer
  • Develop a list of privacy protection features that should be present if a website is serious about protecting privacy. Then, vis
    8·1 answer
  • A building is equipped with light sensors that turn off the fluorescent lights when natural light is above a certain brightness.
    5·1 answer
  • Create a class 'ProblemSolution' with following characteristics A public method 'solution' without parameters and return type is
    14·1 answer
  • Programmers should strive to _____. increase coupling increase cohesion both of the above neither a nor b
    7·1 answer
  • There are....... section in<br>cpu<br>​
    15·1 answer
  • Write a SELECT statement that returns a single value that represents the sum of the largest unpaid invoices submitted by each ve
    5·1 answer
  • Write a Java program to create a class called Cars. The class should include three instance variables: makes (type: String), mod
    12·1 answer
  • Why womt this code work????
    10·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!