Yahoo India Web Search

Search results

  1. C language interview questions solution for freshers beginners placement tricky good pointers answers explanation operators data types arrays structures functions recursion preprocessors looping file handling strings switch case if else printf advance linux objective mcq faq online written test prime numbers Armstrong Fibonacci series factorial palindrome code programs examples on c++ tutorials and pdf

  2. C language interview questions solution for freshers beginners placement tricky good pointers answers explanation operators data types arrays structures functions recursion preprocessors looping file handling strings switch case if else printf advance linux objective mcq faq online written test prime numbers Armstrong Fibonacci series factorial palindrome code programs examples on c++ tutorials and pdf

  3. An armstrong number is an n-digit number that is equal to the sum of the nth powers of its digits. Write a program that accepts an integer and determines if it is an armstrong number or not. Example: 153 is a 3- digit number so each digit should be raised to 3 and add the results. 1 3 ++ 5 3 + 33 = 1 + 125 + 27 = 153 153 = 153

  4. Prime factors of a number in java Java code to get the prime factors of give number. import java.io ...

  5. In general definition: Armstrong numbers are defined as integers for which the sum of each digit raised to the power of the total number of digits in the number equals the original number itself. Example 1: 153. Total digits in 153 is 3. And 1^3 + 5^3 + 3^3 = 1 + 125 + 27 = 153. Example 2: 1634. Total digits in 1634 is 4.

  6. Java code to check given number is perfect number or not import java.io.*; class Test { public ...

  7. Write a c program to reverse any number. 2. Write a c program to find out sum of digit of given number. 3. Write a c program to find out power of number. 4. Write a c program to add two numbers without using addition operator. 5. Write a c program to subtract two numbers without using subtraction operator.

  8. Java code to print the Floyd’s triangle import java.io.*; class Test { public ...

  9. Java program to check whether given number is prime number or not. import java.io.*; class Test ...

  10. C language interview questions solution for freshers beginners placement tricky good pointers answers explanation operators data types arrays structures functions recursion preprocessors looping file handling strings switch case if else printf advance linux objective mcq faq online written test prime numbers Armstrong Fibonacci series factorial palindrome code programs examples on c++ tutorials and pdf

  1. People also search for