[Go to site: main page, start]
Scribd
Upload
6 views5 pages

CSE Interview Programs Java Python

The document provides code examples for various programming tasks in both Python and Java, including checking if a number is even or odd, determining if a number is prime, checking for palindrome strings, calculating factorials, generating Fibonacci series, reversing strings, performing bubble sort, and executing linear search. Each task includes a brief code snippet in both languages for comparison. This serves as a reference for B.Tech interview preparation in computer science engineering.

Uploaded by

Abhi Anil Anil Abhi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views5 pages

CSE Interview Programs Java Python

The document provides code examples for various programming tasks in both Python and Java, including checking if a number is even or odd, determining if a number is prime, checking for palindrome strings, calculating factorials, generating Fibonacci series, reversing strings, performing bubble sort, and executing linear search. Each task includes a brief code snippet in both languages for comparison. This serves as a reference for B.Tech interview preparation in computer science engineering.

Uploaded by

Abhi Anil Anil Abhi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

CSE B.

Tech Interview Programs (Python


+ Java)
Even or Odd
Python:
num = int(input("Enter number: "))
if num % 2 == 0:
print("Even")
else:
print("Odd")

Java:
import [Link].*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
int num = [Link]();
if(num % 2 == 0)
[Link]("Even");
else
[Link]("Odd");
}
}

Prime Number
Python:
num = int(input())
for i in range(2, num):
if num % i == 0:
print("Not Prime")
break
else:
print("Prime")

Java:
import [Link].*;
class Main {
public static void main(String[] args) {
int num = new Scanner([Link]).nextInt();
boolean isPrime = true;
for(int i=2;i<num;i++){
if(num%i==0){
isPrime=false;
break;
}
}
[Link](isPrime ? "Prime":"Not Prime");
}
}

Palindrome String
Python:
s = input()
print("Palindrome" if s == s[::-1] else "Not Palindrome")

Java:
import [Link].*;
class Main {
public static void main(String[] args) {
String s = new Scanner([Link]).next();
String rev = new StringBuilder(s).reverse().toString();
[Link]([Link](rev) ? "Palindrome":"Not Palindrome");
}
}

Factorial
Python:
n = int(input())
fact = 1
for i in range(1,n+1):
fact *= i
print(fact)

Java:
import [Link].*;
class Main {
public static void main(String[] args) {
int n = new Scanner([Link]).nextInt();
int fact = 1;
for(int i=1;i<=n;i++){
fact *= i;
}
[Link](fact);
}
}

Fibonacci Series
Python:
n = int(input())
a,b = 0,1
for i in range(n):
print(a,end=" ")
a,b = b,a+b

Java:
import [Link].*;
class Main {
public static void main(String[] args) {
int n = new Scanner([Link]).nextInt();
int a=0,b=1;
for(int i=0;i<n;i++){
[Link](a+" ");
int c = a+b;
a=b;
b=c;
}
}
}

Reverse String
Python:
s = input()
print(s[::-1])

Java:
import [Link].*;
class Main {
public static void main(String[] args) {
String s = new Scanner([Link]).next();
[Link](new StringBuilder(s).reverse());
}
}
Bubble Sort
Python:
arr = [5,3,8,4]
for i in range(len(arr)):
for j in range(len(arr)-i-1):
if arr[j] > arr[j+1]:
arr[j],arr[j+1] = arr[j+1],arr[j]
print(arr)

Java:
class Main {
public static void main(String[] args) {
int arr[] = {5,3,8,4};
for(int i=0;i<[Link];i++){
for(int j=0;j<[Link]-i-1;j++){
if(arr[j] > arr[j+1]){
int temp = arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
for(int x:arr)
[Link](x+" ");
}
}

Linear Search
Python:
arr = [1,2,3,4]
key = int(input())
print("Found" if key in arr else "Not Found")

Java:
import [Link].*;
class Main {
public static void main(String[] args) {
int arr[] = {1,2,3,4};
int key = new Scanner([Link]).nextInt();
boolean found=false;
for(int x:arr){
if(x==key){
found=true;
break;
}
}
[Link](found ? "Found":"Not Found");
}
}

You might also like