InstanceOfJava

Write a c program to check a number is palindrome or not:

Posted by: saidesh Posted date: 9:56 PM / comment : 0 C language interview programs , c programming examples for beginners

If reverse number of a number is same then we can say its a palindrome number
we already know logic to reverse a number using remainder logic
read input from the user and store it in a variable
check reverse number of given number
compare original number and reverse number if both are same then we can say it's a palindrome number
C Program to Check Whether a Number is Palindrome or Not

Write a c program to check a number is palindrome or not:

#include <stdio.h>
int main() {
int n, revnumber = 0, ramindernum, number;
printf("Enter number: ");
scanf("%d", &n);
number = n;
// reversed integer is stored in reversedN
while (n != 0) {
ramindernum = n % 10;
revnumber = revnumber * 10 + ramindernum;
n /= 10;
}
// if number and revnumber are same then its a palindrome
if (number == revnumber)
printf("%d is a palindrome.", number);
else
printf("%d is not a palindrome.", number);
getch();
}

Output:

C program to print pyramid pattern of numbers

Posted by: saidesh Posted date: 10:02 PM / comment : 0 C language interview programs , c programming language

#1: C program to print pyramid pattern of n stars

#include <stdio.h>
//c program to print pyramid pattern of numbers
// www.instanceofjava.com
int main(){
int number,k,m;
printf("Number of lines of star pattern ");
scanf("%d", &number);
printf("\n");
for( k = 1; k <= number; k++ )
{
for( m = 1; m <= k; m++)
{
printf("*");
}
printf("\n");
}
getch();
}

Output:

#2: C program to print pyramid pattern of n Numbers

#include <stdio.h>
//c program to print pyramid pattern of numbers
// www.instanceofjava.com
//pyramid pattern in c
//write a c
program to print following pattern
int main(){
int number,k,m;
printf("Number of lines of star pattern ");
scanf("%d", &number);
printf("\n");
for( k = 1; k <= number; k++ )
{
for( m = 1; m <= k; m++)
{
printf("%-5d ", m);
}
printf("\n");
}
getch();
}

Output:

prime number program in javascript

Posted by: saidesh Posted date: 9:04 AM / comment : 0 javascript , Javascript interview questions

JavaScript prime number program
In this example will learn about how to find the number is prime or not.
WHATS IS PRIME NUMBER
A number greater than 1 with exactly two factors is called prime number.
Number which is divisible by 1 and itself is prime number. If it is divisible by any other number(other than 1 and itself) then it's not a prime number.

Consider an example of number 5 ,Which has only two factors 1 and 5. This means 5 is a prime number. Lets take one more example Number 6, which has more than two factors, i.e 1,2,3. This means 6 is not a prime number.
The first ten prime numbers are 2,3,5,7,11,13,17,19,23,29.
Note: It should be noted that 1 is non-prime number, because in the above defination already mentioned A number greater than 1 with 2 factors called prime number..

Here we have simple program to print the prime numbers in java script.

JavaScript program to check a number is prime number or not.

<html>
<head>
<script>
// javascript program to check the number is prime or not.
// prime number program in javascript
// javascript prime number program
// take input from the user
const x = parseInt(prompt("Enter a number to check prime or not: "));
let isPrimeNumber=true;
// check if number is equal to 1
if (x === 1) {
alert("1 is neither prime nor composite number.");
}
// checking if number is greater than one or not
else if (x > 1) {
// iterating from 2 to number -1 (leaving 1 and itself )
for (let i = 2; i < x ; i++) {
if (x % i == 0) {
isPrimeNumber = false;
break;
}
}
if (isPrimeNumber) {
alert(`${x } is a prime number`);
} else {
alert(`${x } is not a prime number`);
}
}
// check if number is less than 1
else {
console.log("The number is not a prime number.");
}
</script>
</head>
<body>
</body>
</html>

Output:

Python range function recursive

Posted by: Instanceofjava Posted date: 3:23 PM / comment : 0 Python Programming

Recursion:

The process of calling a function by itself is called recursion and the function which calls itself is called recursive function.
Recursion is used to solve various mathematical problems by dividing it into smaller problems. This method of solving a problem is called Divide and Conquer. In programming, it is used to divide complex problem into simpler ones and solving them individually.
In order to prevent infinite recursive call,we need to define proper exit condition in a recursive function.

Python program to show recursive function

n=4
def a(n):
if n==0:
return 0
else:
print(n)
Return a(n-1)

Python range for float numbers
Limitation of python’s range() function
The main limitation of Python’s range() is it works only with integers. Python range() doesn’t support the float type i.e., we cannot use floating-point or non-integer number in any of its argument.
For example, Let’s see the following source code
for num in range(0, 5.5, 0.1):
print (num)
If you try to execute above code Python will raise a TypeError: ‘float’ object cannot be interpreted as an integer.

Now, Let see how to generate the range for float numbers? There are various ways to do this Let see one by one with the examples.
Use numpy’s arange() function to generate the range for float numbers in Python.
We can use the numpy module of Python programming language to get the range of floating-point numbers.

NumPy library has various numeric functions and mathematical functions to operate on multi-dimensional arrays and matrices.
NumPy has the arange() function to get the range of a floating-point number.
arange() function has the same syntax and functionality as python range() function.
Additionally, it also supports floating-point numbers in any of its argument.
i.e., we can pass float number in the start, stop and step arguments.

Syntax of numpy’s arange() function: –

arange (start, stop, step)
Let demonstrate the use with the following example.

Else statement in python with example program

Posted by: Instanceofjava Posted date: 4:44 PM / comment : 0 Python Programming

Else Statement in Python:

The if statement alone tells us that if a condition is true it will execute a block of statements and if the condition is false it won’t. But what if we want to do something else if the condition is false. Here comes the else statement.
We can use the else statement with if statement to execute a block of code when the condition is false

if (condition):

# Executes this block if

# condition is true

else:

# Executes this block if

# condition is false

#1: Python program to illustrate If else statement

i = 2;
if i< 1:
print ("i is smaller than 1")
print ("i'm in if Block")
else:
print ("i is greater than 1")
print ("i'm in else Block")
print ("i'm not in if and not in else Block")

Output:

I is greater than 1
I'm in else Block
I'm not in if and not in else Block

Fibonacci series in c without recursion

Posted by: Instanceofjava Posted date: 4:21 PM / comment : 0 c programming examples for beginners

In Fibonacci series the first two numbers in the Fibonacci sequence are 0 and 1 and each subsequent number is the sum of the previous two. For example Fibonacci series is 0, 1, 1, 2, 3, 5, 8,13, 21
C Program to Display Fibonacci Sequence
Fibonacci series means next number will be generated as sum of previous two numbers.

#1: C example program on Fibonacci series

#include <stdio.h>
void main()
{
int fib1 = 0, fib2 = 1, fib3, limit, count = 0;
printf("Enter the limit to generate the Fibonacci Series \n");
scanf("%d", &limit);
printf("Fibonacci Series is ...\n");
printf("%d\n", fib1);
printf("%d\n", fib2);
count = 2;
while (count < limit)
{
fib3 = fib1 + fib2;
count++;
printf("%d\n", fib3);
fib1 = fib2;
fib2 = fib3;
}
}

Output:

Enter the limit to generate the Fibonacci Series
20
Fibonacci Series is ...
0
1
1
2
3
5
8
13
21
34
55
89
144
233
377
610
987
1597
2584
4181

Subscribe to: Posts ( Atom )