GATE 2016 CS/IT C PROGRAMMING| STATIC AND DYNAMIC SCOPING | m(x) | n(y) | Output of the pseudo-code
For any queries feel free to comment or direct message on Instagram
Instagram - / jatingupta5jan
GATE | GATE-CS-2016
What will be the output of the following pseudo-code when parameters are passed by reference and dynamic scoping is assumed?
a=3;
void n(x) {x = x * a; print(x);}
void m(y) {a = 1; a = y - a; n(a); print(a);}
void main() {m(a);}
(A) 6, 2
(B) 6, 6
(C) 4, 2
(D) 4, 4
Playlist link -
C programming - • C PROGRAMMING |GATE CS/IT PYQ | PREVIOUS ...
Time Complexity - • GATE CS/IT PYQ TIME COMPLEXITY | ALGORITHM...
Data structure - • GATE CS/IT (PYQ) | DATA STRUCTURES | NET ...
Algorithms - • GATE CS/IT (PYQ) ALGORITHMS | TIME COMPLEX...
Binary tree - • GATE CS/IT CSE PYQ| BINARY TREE | DATA STR...
Linked List - • GATE CS/IT CSE PYQ | LINKED LIST | DATA ST...
C PROGRAMMING OUTPUT
CALL BY REFERNCE
STATIC SCOPING AND DYNAMIC SCOPING
ALGORITHMS
time complexity
theta
BIG O
OMEGA
TIME AND SPACE COMPLEXITY
DOUBLE HASHING
QUADRATIC PROBING
linked list for gate
PYQ
LINEAR PROBING
COLLISION
HASHING
net
B.tech
university
placement preparation
doubly linked list
GATE 2021