GATE CSE 2014 Set 2 | Basic of Programming Language Question 21 | Programming Languages

GATE CSE 2014 Set 2

MCQ (Single Correct Answer)

-0.3

Suppose n and p are unsigned int variables in a C program. We wish to set p to $${}^n{C_3}$$. If n is large, which one of the following statements is most likely to set p correctly?

$$p = n*(n - 1)*(n - 2)/6$$

$$p = n*(n - 1)/2*(n - 2)/3$$

$$p = n*(n - 1)/3*(n - 2)/2$$

$$p = n*(n - 1)*(n - 2)/6.0$$

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

Finite Automata and Regular Language Push Down Automata and Context Free Language Undecidability 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

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 Data Link Layer and Switching Network Layer Application Layer Protocol Routing Algorithm TCP UDP Sockets and Congestion Control Lan Technologies and Wi-Fi Network Security

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Verbal Ability Logical Reasoning Numerical Ability

Discrete Mathematics

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

Programming Languages

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

Computer Organization

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