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 2014 Set 3
MCQ (Single Correct Answer)
+1
-0.3
Let A be a square matrix size $$n \times n$$. Consider the following pseudocode. What is the expected output?
C = 100; 
for i = 0 to n do 
for j = 1 to n do 
 { 
      Temp = A[ i ][ j ] + C ; 
      A[ i ][ j ] = A[ j ][ i ] ; 
      A[ j ][ i ] = Temp - C ; 
 } 

 for i = 0 to n do 
 for j = 1 to n do 
 output(A[ i ][ j ]);
A
The matrix A itself
B
Transpose of the matrix A
C
Adding 100 to the upper diagonal elements and subtracting 100 from lower diagonal elements of A
D
None of these
2
GATE CSE 2014 Set 2
Numerical
+1
-0
Consider the function func shown below:
int func(int num) 

{
         int count = 0;
         while(num)
         {
                count++;
                num >>= 1;
         }
  return (count);
}

The value returned by func(435) is _________.
Your input ____
3
GATE CSE 2014 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following is NOT performed during compilation?
A
Dynamic memory allocation
B
Type checking
C
Symbol table management
D
Inline expansion
4
GATE CSE 2014 Set 2
MCQ (Single Correct Answer)
+1
-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?
A
$$p = n*(n - 1)*(n - 2)/6$$
B
$$p = n*(n - 1)/2*(n - 2)/3$$
C
$$p = n*(n - 1)/3*(n - 2)/2$$
D
$$p = n*(n - 1)*(n - 2)/6.0$$
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