Skip to content
Related Articles

Related Articles

GATE | GATE CS 1999 | Question 64

View Discussion
Improve Article
Save Article
  • Last Updated : 10 Oct, 2017
View Discussion
Improve Article
Save Article

[5 Marks question]
Consider the following pascal program skeleton:

program sort(...);
      var a,x,...;
      procedure readarray;
       var i,....;
       begin
                        ...:=a...
       end;
     procedure exchange(...);
       begin
                         ...:=a...
                         ...:=x...
       end;https://www.geeksforgeeks.org/wp-admin/profile.php
     procedure qsort(...);
       var k,v,...;
       function partition (...)...;
                var i,j,...;
                begin
                         ...:=a...
                         ...:=v...
                end;
        begin
            .
            .
        end;
   begin
        .
        .
   end;

Assume that at a given point in time during program execution, following procedures are active: sort, qsort(1,9), qsort(1.3), partition(1,3), exchange(1,3).
Show snapshots of the runtime stack with access links after each of the activations.


Answer:

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!