Ex 4) Trace the following flowchart for when input values are 12, -2, -3, 6, -11, 3, 1, -1 and complete the trace table. Also, write pre- post-conditions for this flowchart. start | cnt1–0 cnt2 +0 i +1 i+i+1 num is 4 num<0 T ent1 ( cnt1 + 1 i +1 i←i+1 num is 4 num>0 T cnt2 + cnt2 + 1 F cnt1=cnt2 "yes" (end) "no"

Ex 4) Trace the following flowchart for when input values are 12, -2, -3, 6, -11, 3, 1, -1 and complete the trace table. Also, write pre- post-conditions for this flowchart. start | cnt1–0 cnt2 +0 i +1 i+i+1 num is 4 num<0 T ent1 ( cnt1 + 1 i +1 i←i+1 num is 4 num>0 T cnt2 + cnt2 + 1 F cnt1=cnt2 "yes" (end) "no"

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 9SA

See similar textbooks