closed by
561 views
0 votes
0 votes

The following program fragment prints

int i = 5;
do { putchar(i+100); printf(“%d”, i--;) }
while(i);
  1. i5h4g3f2el
  2. 14h3g2f1e0
  3. An error message
  4. None of the above
closed by
Answer:

Related questions

1 votes
1 votes
2 answers
1
1 votes
1 votes
3 answers
3
2 votes
2 votes
1 answer
4
admin asked Apr 1, 2020
1,053 views
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number number of nodes in a binary tree of height $h$ is $2^{h}$$2^{h-1} ...