GATE CSE 1996 | Basic of Programming Language Question 34 | Programming Languages

PREVIOUS NEXT

GATE CSE 1996

MCQ (Single Correct Answer)

-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 – 3 B – 4 C – 1 D - 2

A – 4 B – 3 C – 1 D - 2

A – 4 B – 3 C – 2 D - 1

A – 3 B – 4 C – 2 D - 1

GATE CSE 1994

MCQ (Single Correct Answer)

-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?

Passing a constant value as a parameter

Passing the address of an array as a parameter

Passing an array element as a parameter

Passing an array following statements is true

GATE CSE 1990

MCQ (Single Correct Answer)

-0.6

Match the pairs in the following:

List - I

(A) Pointer data type
(B) Activation record
(C) Repeat-until
(D) Coercion

List - II

(p) Type conversion
(q) Dynamic data structure
(r) Recursion
(s) Nondeterministic loop

A - q; B - r; C - s; D - p

A - r; B - q; C - s; D - p

A - q; B - r; C - p; D - s

A - r; B - s; C - q; D - p

GATE CSE 1990

MCQ (Single Correct Answer)

-0.6

Match the pairs in the following:

List - I

(A) Small talk
(B) LISP
(C) Prolog
(D) VAL

List - II

(p) Logic programming
(q) Data flow programming
(r) Functional programming
(s) Object-Oriented programming

A - s; B - r; C - p; D - q

A - r; B - s; C - p; D - q

A - s; B - r; C - q; D - p

A - s; B - p; C - r; D - q

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method Dynamic Programming P and NP Concepts

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Database Management System

Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

Concepts of Layering Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

Discrete Mathematics

Graph Theory Set Theory & Algebra Combinatorics Mathematical Logic Probability Linear Algebra Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Computer Organization

Computer Arithmetic Memory Interfacing Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory