Programming Languages
Basic of Programming Language
Marks 1Marks 2
Function and Recursion
Marks 1Marks 2
Pointer and Structure in C
Marks 1Marks 2Marks 5
1
GATE CSE 1998
MCQ (Single Correct Answer)
+2
-0.6
Faster access to non-local variables is achieved using an array of pointers to activation records called a
A
stack
B
heap
C
display
D
activation tree
2
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6

Given the following Pascal like program segment:

Procedure A;

     x,y:intger;
     Procedure B;
            x,z:real;
            S1
     end B;
     Procedure C;
            i:integer;
            S2;
     end C;
end A;

The variables accessible in S1 and S2 are

A
x or A, y, x of B and z in S1 and x of B, y and i in S2
B
x or B, y and z in S1 and x of B, i and z in S2
C
x or B, z and y in S1 and x of A, i and y in S2
D
None of the above
3
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
The correct matching for the following pairs is

List - I
(A) Activation record
(B) Location counter
(C) Reference counts
(D) Address relocation

List - II
(1) Linking loader
(2) Garbage collection
(3) Subroutine call
(4) Assembler

A
A – 3 B – 4 C – 1 D - 2
B
A – 4 B – 3 C – 1 D - 2
C
A – 4 B – 3 C – 2 D - 1
D
A – 3 B – 4 C – 2 D - 1
4
GATE CSE 1994
MCQ (Single Correct Answer)
+2
-0.6
In which one of the following cases is it possible to obtain different results for call-by-reference and call-by-name parameter passing methods?
A
Passing a constant value as a parameter
B
Passing the address of an array as a parameter
C
Passing an array element as a parameter
D
Passing an array following statements is true
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization