GATE CSE 2014 Set 1 | Basic of Programming Language Question 14 | Programming Languages

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

-0.3

Consider the following program in C language:

#include < stdio.h >
main()
{
int i;
int *pi = &i;
scanf("%d", pi);
printf("%d\n", i + 5);
}

Which one of the following statements is TRUE?

Compilation fails.

Execution results in a run-time error.

On execution, the value printed is 5 more than the address of variable i.

On execution, the value printed is 5 more than the integer value entered.

GATE CSE 2010

MCQ (Single Correct Answer)

-0.3

Which languages necessarily need heap allocation in the runtime environment?

Those that support recursion

Those that use dynamic scoping

Those that allow dynamic data structures

Those that use global variables

GATE CSE 2005

MCQ (Single Correct Answer)

-0.3

A common property of logic programming languages and functional languages is:

both are procedural languages

both are based on l-calculus

both are declarative

both use Horn-clauses

GATE CSE 2004

MCQ (Single Correct Answer)

-0.3

The goal of structured programming is to

have well indented programs

be able to infer the flow of control from the compiled code

be able to infer the flow of control from the program text

avoid the use of GOTO statements

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

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Database Management System

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

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

Computer Networks

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

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