AQ Quiz 5

/* C program to check palindrome and check the input and output*/

#include <stdio.h>

int main()

{ int n, reverse = 0, temp;

printf("Enter a number you want to check\n");

scanf("%d",&n);

temp = n;

while( temp != 0 )

{ reverse = reverse * 10;

reverse = reverse + temp%10;

temp = temp/10;

} if ( n == reverse )

printf("%d is a palindrome number.\n", n);

else

printf("%d is not a palindrome number.\n", n);

return 0;

}

• SYNTAX ERROR

• LOGICAL ERROR

• RUNTIME ERROR

• ALL OF THE ABOVE

• ERROR EXCEPTED COLON IN LINE11

• ERROR EXCEPTED SEMICOLON IN LINE11

• ERROR EXCEPTED COLON IN LINE12

• ERROR EXCEPTED SEMICOLON IN LINE12

In which of the following cases the minimum no of insertions to form palindrome is maximum?

• string with all same characters

• string of length 1

• palindromic string

• non palindromic string

In the worst case, the minimum no of insertions to be made to convert the string into a palindrome is equal to the length of the string

• TRUE

• FALSE

• NEITHER TRUE NOR FALSE

What does the following function print for n = 25?

void fun(int n)

{

if (n == 0)

return;

printf("%d", n%2);

fun(n/2);

}

• 11001

• 10011

• 11111

• 00000

What’s happen if base condition is not defined in recursion ?

• Stack underflow

• Stack Overflow

• None of these

• Both a and b

Iteration requires more system memory than recursion.

• TRUE

• FALSE

• NONE OF THE ABOVE

• BOTH A AND B

C program scenario based question to calculate electricity bill.

Write the algorithmic logic

WHICH OF THE FOLLOWING IS CORRECT

• Any number is said to be a palindrome if the original number and the reverse of the original number are the same.

• Any number is said to be a palindrome if the original number and the reverse of the original number are the not same.

• Any number is said to be a palindrome if the original number and the non reverse of the original number are the different.

• both a and c