Madhav kaushik

java

noreply@blogger.com (HACKTECH) — Sun, 19 May 2024 01:06:00 -0700

S.no	Date		Signature
1	15/1/2024	WAP to print your name in Java.
2	15/1/2024	WAP to add 2 numbers. Take Input (Via Command Prompt & Via Scanner Class).
3	15/1/2024	WAP to do addition, subtraction, multiplication and division by taking (Values for variables & Values via Scanner Class).
4	29/1/2024	WAP to calculate factorial of a number taken via Scanner Class.
5	29/1/2024	WAP to take 5 numbers as an input from the user and then calculate (Average of the number & Maximum and minimum among the numbers).
6	29/1/2024	WAP to take 2 numbers and a symbol (+, -, *, /, %) from user. Using Switch case statement, calculate the desired arithmetic operation.
7	5/2/2024	WAP that prompts the user to input a user and then output the number with the digits reversed.
8	5/2/2024	WAP to find the largest element in the array using sort function.
9	5/2/2024	WAP to multiply two arrays.
10	5/2/2024	WAP to create a String class that performs String methods (Equal, reverse the string, change case).
11	5/2/2024	WAP to check wether the substring input by user belongs to a pre-defined String object.
12	12/2/2024	WAP to create a class circle and define its methods for calculating area and circumference of circle. Use parametrized constructors to initialize 2 objects of circle class and print the area and circumference of the 2
13	12/2/2024	WAP to create a class Rectangle and define its methods for calculating area and perimeter of rectangle. Use parametrized constructors to initialize 2 objects of rectangle class and print the area and circumference of the 2 objects.
14	12/2/2024	WAP to create a class Shape and use different parameterised constructors to create objects of different shapes:
15	19/2/2024	Define a class MyNumber having one private int data member. Write a default constructor to initialize it to 0 and another constructor to initialize it to a value (Use this). Write methods isNegative, isPositive, isZero, isOdd, isEven. Create objects in main method.
16	19/2/2024	WAP to invoke current class method using this keyword. (this.display())

17	19/2/2024	WAP to invoke current class constructors. (this(10), this())
18	19/2/2024	Define a Student class (roll number, name, percentage). Define a default and parameterized constructor. Keep a count on objects created.

S.no	Date		Signature
19	26/2/2024	Write a test program (says TestCylinder) to test the Cylinder class created. Create three objects of Cylinder class namely c1, c2 and c3 as below and display height, radius, area and volume of all the objects.
20	4/3/2024	Create 2 object for class Student and Staff each. Use different functions and constructors to provide values to these objects and finally print the objects via
21	11/3/2024	Create a class TestShape as code of class is given below and predict the output.
22	18/3/2024	Re-write the abstract superclass Shape into an interface, containing only abstract methods, as follows:
23	1/4/2024	WAP to showcase the possible use of this keyword.
24	1/4/2024	WAP to showcase the possible use of super keyword.
25	1/4/2024	WAP to showcase the possible use of final keyword.
26	8/4/2024	Create a package with two java files. Access these classes in another java file by importing the java file.
27	8/4/2024	Catch an Arithmetic Exception using try catch block.
28	15/4/2024	Create a class Student with attributes roll no, name, age and course. Initilize values through parameterized constructor. If age of the student is not in between 15 and 21 then g e n e r a t e u s e r - d e fi n e d e x c e p ti o n “AgeNotWithinRangeException”.
29	22/4/2024	Define a class MyDate with members day, month, year. Define default and parameterized constructors. Accept values from the command line and create a date object. Throw user defined – “ Invalid Day Exception” or InvalidMonthException” if the day and month are invalid. If the date is valid display message “valid date”
30	29/4/2024	Write a program in Java that will create two threads namely thread1 and Thread2 using Thread Class that will print the numbers from 1 to 5.

31	29/4/2024	Write a program in Java that will create two threads namely thread1 and Thread2 using Runnable interface that will print the alphabet from A to F.
32	29/4/2024	Implement a class that checks whether a given number is a prime using both the Thread class and Runnable interface.

Program 1: WAP to print your name in Java.

Code:

class Second

{

public static void main (String a[]){

// String name

String name= "Samdarsh Gaur"; System.out.println("My name is:" +name);

}

Program 2: WAP to add 2 numbers. Take Input

(Via Command Prompt & Via Scanner Class).

Code:

(Input via Command Prompt) public class Program2 {

public static void main(String args[]){
String str1 = args[0]; String str2= args[1];

int num1 = Integer.parseInt(str1); int num2 = Integer.parseInt(str2); int Num3 = num1+num2;
System.out.println("your Addition of Command prompt numbers "+Num3);

}
}

(Input via Scanner Class)

import java.util.Scanner; public class Arithmatic{
public static void main(String arg[])

{
try (Scanner sc = new Scanner(System.in)) {

//Taking Input from the user
System.out.println("Enter the first number for calculation: "); int a= sc.nextInt();

System.out.println("Enter the second number for calculation: "); int b= sc.nextInt();
// Calculation & output int c= a+b;

System.out.println("Addition of (a+b) is: "+c);

}

}
}

Program 3: WAP to do addition, subtraction, multiplication and division by taking (Values for variables & Values via Scanner Class

Code:

import java.util.Scanner; public class arithmatic3 {

public static void main(String[] args) {

try (Scanner sc = new Scanner(System.in)){

// Input for the numbers System.out.print("Enter the first number: "); double num1 = sc.nextDouble(); System.out.print("Enter the second number: "); double num2 = sc.nextDouble();

// calculation

double sum = num1 + num2; System.out.println("Sum: " + sum); double difference = num1 - num2;

System.out.println("Difference: " + difference); double product = num1 * num2; System.out.println("Product: " + product);

// Division for Second Value cannot be Zero if (num2 != 0) {

double Division = num1 / num2; System.out.println("Divison: " + Division);

} else {

System.out.println("Cannot divide by zero.");

(Values for variables)

}

(Values via Scanner Class)

import java.util.Scanner; public class Arithmatic4{

public static void main(String arg[])

{

try (Scanner sc = new Scanner(System.in)) {

//Taking Input from the user

System.out.println("Enter the first number for calculation: "); int a= sc.nextInt();

System.out.println("Enter the second number for calculation: "); int b= sc.nextInt();

// Calculation & output

int c= a+b;

System.out.println("Addition of (a+b) is: "+c); int d= a-b;

System.out.println("Subtraction of (a-b) is: "+d); int e= a*b;

System.out.println("Multiplication of (a*b) is: "+e); int f= a/b;

System.out.println("Divison of (a/b) is: "+f); int g= a%b;

System.out.println("Factorial of (a%b) is: "+g); } } }

Program 4: WAP to calculate factorial of a number taken via Scanner Class.

Code:

import java.util.Scanner; public class Factorial {

public static void main(String[] args) {

try ( Scanner scanner = new Scanner(System.in)){

// Input number

System.out.print("Enter a number to calculate its factorial: "); int number = scanner.nextInt();

// Calculate factorial

long factorial = calculateFactorial(number);

// Output Number

System.out.println("Factorial of " + number + " is: " + factorial);

}

// Calculate factorial

private static long calculateFactorial(int n) { if (n == 0 || n == 1) {

return 1;

} else {

return n * calculateFactorial(n - 1);

}

Program 5: WAP to take 5 numbers as an input from the user and then calculate (Average of the number & Maximum and minimum among the numbers).

import java.util.Scanner; public class Average {

public static void main(String[] a) {

try (Scanner scanner = new Scanner(System.in)){

// Input for 5 numbers int sum = 0;

for (int i = 1; i <= 5; i++)

{ System.out.print("Enter number " + i + ": "); int number = scanner.nextInt();

sum += number;

}

// Calculate average int average = sum / 5;

// Output

System.out.println("Average of the 5 numbers is: " + average);

}

(Maximum and minimum among the numbers)

import java.util.Scanner; public class Maxmin {

public static void main(String[] a) {

try (Scanner scanner = new Scanner(System.in))

{ int max = Integer.MIN_VALUE; int min = Integer.MAX_VALUE;

// Input for 5 numbers for (int i = 1; i <= 5; i++) {

System.out.print("Enter number " + i + ": "); int num = scanner.nextInt();

// Update max and min if (num > max) {

max = num;

}

if (num < min)

{ min = num;

}

// Output

System.out.println("Maximum number: " + max); System.out.println("Minimum number: " + min);

}

Program 6: WAP to take 2 numbers and a symbol (+, -, *, /, %) from user. Using Switch case statement, calculate the desired arithmetic operation.

Code:

import java.util.Scanner; public class Switchcase {

public static void main(String[] a) {

try (Scanner scanner = new Scanner(System.in)){

// Input Number and symbols System.out.print("Enter the first number: "); int num1 = scanner.nextInt(); System.out.print("Enter the second number: "); int num2 = scanner.nextInt();

System.out.print("Enter the arithmetic operation (+, -, *, /, %): "); char operator = scanner.next().charAt(0);

// Arithmetic Operation using switch case statement int result;

switch (operator)

{ case '+':

result = num1 + num2; System.out.println("Result: " + result); break;

case '-':

result = num1 - num2; System.out.println("Result: " + result); break;

case '*':

result = num1 * num2; System.out.println("Result: " + result); break;

case '/':

// Check for division by zero if (num2 != 0) {

result = num1 / num2; System.out.println("Result: " + result);

} else {

System.out.println("Cannot divide by zero.");

}

break; case '%':

// Check for division by zero if (num2 != 0) {

result = num1 % num2; System.out.println("Result: " + result);

} else {

System.out.println("Cannot calculate remainder with zero divisor.");

}

break; default:

System.out.println("Invalid operator. Please enter a valid arithmetic operator.");

}

Program 7: WAP that prompts the user to input a user and then output the number with the digits reversed.

import java.util.Scanner;

public class Reversed_Number { public static void main(String[] args)

{ Scanner s = new Scanner(System.in); System.out.println("Enter a number: "); int user_Input = s.nextInt();

String str1= String.valueOf(user_Input); for(int i=str1.length()-1;i>=0;i--){

System.out.print(str1.charAt(i));

}

Program 8: WAP to find the largest element in the array using sort function.

Code:

Code:

import java.util.Arrays;

public class UsingSortFunction {

public static void main(String[] args) { int [] arr = {20,54,982,-1,29,19,-10};

System.out.println("THE ORIGINAL ARRAY IS: "); for(int num: arr){

System.out.print(num +" ");

}

System.out.println("\nTHE SORTED ARRAY IS: "); Arrays.sort(arr);

for(int num: arr){ System.out.print(num + " ");

}

Program 9: WAP to multiply two arrays.

Code:

public class MultiplyingTwoArrays

{ public static void main(String[] args) {

int [] arr1 = {10,20,30,40,50};

System.out.println("Values of Array 1"); for(int num: arr1){

System.out.print(num + " ");

}

int [] arr2 = {50,40,30,20,10};

System.out.println("\nValues of Array 2"); for(int num: arr2){

System.out.print(num + " ");

}

System.out.println("\nAFTER MULTIPLYING ARRAY 1 WITH ARRAY 2");

for(int i=0;i<arr1.length;i++){

System.out.print(arr1[i]*arr2[i] + " ");

}

Program 10: WAP to create a String class that performs String methods (Equal, reverse the string, change case).

Code:

import java.util.*;

public class StringFunctions {

public static void main(String[] args) {

String s1 = "HELLO";

String s2 = "HELLO";

String s3 = "welcome";

String s4 = "HELLO THIS SIDE Priyanshu Tiwari";

if(s1.compareTo(s2)!=0){

System.out.println("String s1 and s2 is NOT EQUAL");

}

else {

System.out.println("String s1 and s2 is EQUAL");

}

System.out.println("ORIGINAL STRING = " +s3);

StringBuilder sb = new StringBuilder(s3);

s3=sb.reverse().toString();

System.out.println("REVERSED STRING = " +s3);

System.out.println("Lower Case To Upper Case = " + s3.toUpperCase());

System.out.println("Upper Case To Lower Case = " + s4.toLowerCase());

}

Program 11: WAP to check whether the substring input by user belongs to a pre-defined String object.

Code:

import java.util.*;

public class StringFinder {

public static void main(String[] args) {

Scanner s = new Scanner(System.in);

System.out.println("Enter a String: ");

String str1 = s.nextLine();

System.out.println("Enter substring: ");

String substring = s.nextLine();

System.out.println(str1.contains(substring)?"contains "+substring:"Does not contains "+substring);

}

Output:

Program 12: WAP to create a class circle and define its methods for calculating area and circumference of circle. Use parametrized constructors to initialize 2 objects of circle class and print the area and circumference of the 2 objects.

Code:

public class Circle { double radius;

public Circle(double radius){

this.radius =radius;

}

double area(){

return 3.14*radius*radius;

}

double circumference(){ return 2*3.14*radius;

}

public static void main(String[] args) {

Circle circle1 = new Circle(5.0);

Circle circle2 = new Circle(7.5);

System.out.println("Circle 1 - Radius: " + circle1.radius);

System.out.println("Area: " + circle1.area());

System.out.println("Circumference: " + circle1.circumference());

System.out.println();

System.out.println("Circle 2 - Radius: " + circle2.radius);

System.out.println("Area: " + circle2.area());

System.out.println("Circumference: " + circle2.circumference());

}

Program 13: WAP to create a class Rectangle and define its methods for calculating area and perimeter of rectangle. Use parametrized constructors to initialize 2 objects of rectangle class and print the area and circumference of the 2 objects.

Code:

public class Rectangle { int length;

int breadth;

Rectangle(int length, int breadth){ this.length =length; this.breadth=breadth;

}

int Calc_area(){

return length*breadth;

}

int Calc_perimeter(){

return 2*(length+breadth);

}

public static void main(String[] args) {

Rectangle rectangle1 =new Rectangle(50 ,20);

Rectangle rectangle2 =new Rectangle(70 ,30);

System.out.println("Length of Rectangle1 = " + rectangle1.length);

System.out.println("Breadth of Rectangle1 = " + rectangle1.breadth);

System.out.println("Area of Rectangle1 = "+rectangle1.Calc_area());

System.out.println("Perimeter of Rectangle1 = "+rectangle1.Calc_perimeter());

System.out.println();

System.out.println("Length of Rectangle2 = " + rectangle2.length);

System.out.println("Breadth of Rectangle2 = " + rectangle2.breadth);

System.out.println("Area of Rectangle2 = "+rectangle2.Calc_area());

System.out.println("Perimeter of Rectangle2 = "+rectangle2.Calc_perimeter());

}

Program 14: WAP to create a class Shape and use different parameterised constructors to create objects of different shapes:

a) Shape (10,20). Rectangle

b) Shape (20.5). Circle

c) Shape (10). Square

Use method overloading to calculate and print the area of the 3 objects of the Shape class.

Code:

public class Shapes { double radius;

int length; int breadth;

int square_var;

Shapes(double radius){

this.radius =radius;

}

Shapes(int square_var){

this.square_var =square_var;

}

Shapes(int length, int breadth){

this.length =length;

this.breadth=breadth;

}

int Calc_area(int length,int breadth){ return length*breadth;

}

double Calc_area(double radius){

return 3.14*radius*radius;

}

int Calc_area(int square_var){

return square_var*square_var;

}

public static void main(String[] args) {

Shapes shape1 = new Shapes(60,40);

Shapes shape2 = new Shapes(10.0);

Shapes shape3 = new Shapes(5);

System.out.println("Length of Rectangle = "+shape1.length);

System.out.println("breadth of Rectangle = "+shape1.breadth);

System.out.println("Area of Rectangle = "+shape1.Calc_area(60,40));

System.out.println();

System.out.println("Radius of Circle = " +shape2.radius);

System.out.println("Area of Circle = "+shape2.Calc_area(10.0));

System.out.println();

System.out.println("Length and Breadth of Square = "+shape3.square_var);

System.out.println("Area of Square = "+shape3.Calc_area(5));

}

Program 15: Define a class MyNumber having one private int data member. Write a default constructor to initialize it to 0 and another constructor to initialize it to a value (Use this). Write methods isNegative, isPositive, isZero, isOdd, isEven. Create objects in main method.

Code:

public class MyNumber { private int data;

public MyNumber() { this.data = 0;

}

public MyNumber(int data) { this.data = data;

}

public boolean isNegative() { return data < 0;

}

public boolean isPositive() { return data > 0;

}

public boolean isZero() { return data == 0;

}

public boolean isOdd() { return data % 2 != 0;

}

public boolean isEven() { return data % 2 == 0;

}

public static void main(String[] args) {

MyNumber num1 = new MyNumber();

MyNumber num2 = new MyNumber(15);

System.out.println("Number 1:");

System.out.println(" isNegative: " + num1.isNegative());

System.out.println(" isPositive: " + num1.isPositive());

System.out.println(" isZero: " + num1.isZero());

System.out.println(" isOdd: " + num1.isOdd());

System.out.println(" isEven: " + num1.isEven());

System.out.println("\nNumber 2:");

System.out.println(" isNegative: " + num2.isNegative());

System.out.println(" isPositive: " + num2.isPositive());

System.out.println(" isZero: " + num2.isZero());

System.out.println(" isOdd: " + num2.isOdd());

System.out.println(" isEven: " + num2.isEven());

}

Program 16: WAP to invoke current class method using this keyword. (this.display())

Code:

public class MyClass { public void display() {

System.out.println("This is from the display method");

this.display2();

}

public void display2() {

System.out.println("This is from the display2 method");

}

public static void main(String[] args) {

MyClass obj = new MyClass();

obj.display();

}

Program 17: WAP to invoke current class constructors. (this(10), this())

Code:

public class MyClass1 { private int value; public MyClass1() {

this(10);

}

public MyClass1(int value) { this.value = value;

System.out.println("Value initialized to: " + value);

}

public static void main(String[] args) { MyClass1 obj1 = new MyClass1();

MyClass1 obj2 = new MyClass1(20);

}

Program 18: Define a Student class (roll number, name, percentage). Define a default and parameterized constructor. Keep a count on objects created.

Create objects using parameterized constructor and display the object count after each object is created. (Use static member and method). Also display the contents of each object.

Code:

public class Student {

private int rollNumber;

private String name;

private double percentage;

private static int objectCount = 0;

public Student() {

this.rollNumber = 0;

this.name = "NA";

this.percentage = 0.0;

objectCount++;

}

public Student(int rollNumber, String name, double percentage) {

this.rollNumber = rollNumber;

this.name = name;

this.percentage = percentage; objectCount++;

}

public void display() {

System.out.println("Roll Number: " + rollNumber);

System.out.println("Name: " + name);

System.out.println("Percentage: " + percentage);

}

public static int getObjectCount() {

return objectCount;

}

public static void main(String[] args) {

Student student1 = new Student(1, "Priyanshu Tiwari", 85.5);

Student student2 = new Student(2, "Alok Tiwari", 92.0);

System.out.println("Object count after creating student1: " + Student.getObjectCount());

student1.display();

System.out.println("\nObject count after creating student2: " + Student.getObjectCount());

student2.display();

}

Program 19: Write a test program (says TestCylinder) to test the Cylinder class created. Create three objects of Cylinder class namely c1, c2 and c3 as below and display height, radius, area, and volume of all the objects.

Code:

Circle

public class Circle {

private double radius = 1.0;

private String color = "red";

public Circle() {

}

public Circle(double radius) {

this.radius = radius;

}

public Circle(double radius, String color) {

this.radius = radius;

this.color = color;

}

public double getArea() {

return Math.PI * radius * radius;

}

public double getRadius() {

return radius;

}

public String getColor() {

return color;

}

Cylinder

public class Cylinder extends Circle {

private double height;

public Cylinder(double radius, double height) {

super(radius);

this.height = height;

}

public Cylinder(double radius, double height, String color) {

super(radius, color);

this.height = height;

}

public double getVolume() {

return getArea() * height;

}

public double getHeight() {

return height;

} }

Test Cylinder

public class TestCylinder {

public static void main(String[] args) {

Cylinder c1 = new Cylinder(5.0, 10.0);

Cylinder c2 = new Cylinder(4.0, 12.0, "green");

Cylinder c3 = new Cylinder(6.0, 8.0, "blue");

// Display properties of Cylinder c1

System.out.println("Cylinder c1:");

System.out.println("Height: " + c1.getHeight());

System.out.println("Radius: " + c1.getRadius());

System.out.println("Color: " + c1.getColor());

System.out.println("Area: " + c1.getArea());

System.out.println("Volume: " + c1.getVolume());

// Display properties of Cylinder c2

System.out.println("\nCylinder c2:");

System.out.println("Height: " + c2.getHeight());

System.out.println("Radius: " + c2.getRadius());

System.out.println("Color: " + c2.getColor());

System.out.println("Area: " + c2.getArea());

System.out.println("Volume: " + c2.getVolume());

// Display properties of Cylinder c3

System.out.println("\nCylinder c3:");

System.out.println("Height: " + c3.getHeight());

System.out.println("Radius: " + c3.getRadius());

System.out.println("Color: " + c3.getColor());

System.out.println("Area: " + c3.getArea());

System.out.println("Volume: " + c3.getVolume());

}

Program 20: Create 2 object for class Student and Staff each. Use different functions and constructors to provide values to these objects and finally print the objects via toString().

Code:

Person

public class Person {

private String name;

public Person(String name) {

this.name = name;

}

public String getName() {

return name;

}

public String toString() {

return "Name: " + name;

} }

Student

class Student extends Person {

private int studentId;

public Student(String name, int studentId) {

super(name);

this.studentId = studentId;

}

public int getStudentId() {

return studentId;

}

public String toString() {

return super.toString() + ", Student ID: " + studentId;

} }

Staff

class Staff extends Person {

private String staffId;

public Staff(String name, String staffId) {

super(name);

this.staffId = staffId;

}

public String getStaffId() {

return staffId;

}

public String toString() {

return super.toString() + ", Staff ID: " + staffId;

} }

Main

public class Main {

public static void main(String[] args) {

// Create Student objects using constructors

Student student1 = new Student("Priyanshu Tiwari", 1008);

Student student2 = new Student("Alok Tiwari", 10008);

// Create Staff objects using constructors

Staff staff1 = new Staff("Riya Sapra", "S101");

Staff staff2 = new Staff("Sunil Sikka", "S102");

// Print the objects

System.out.println("Student 1: " + student1);

System.out.println("Student 2: " + student2);

System.out.println("Staff 1: " + staff1);

System.out.println("Staff 2: " + staff2);

}

Program 21: Create a class TestShape as code of class is given below and predict the output.

public class TestShape {

public static void main(String[] args) {

Rectangle s1 = new Rectangle("red", 4, 5);

System.out.println(s1);

System.out.println("Area is " + s1.getArea());

Triangle s2 = new Triangle("blue", 4, 5);

System.out.println(s2);

System.out.println("Area is " + s2.getArea());

}

List out the errors in above mentioned code if any. Correct them to run the program successfully.

Code:

Rectangle

public class Rectangle {

private String color;

private int width;

private int height;

public Rectangle(String color, int width, int height) {

this.color = color;

this.width = width;

this.height = height;

}

public double getArea() {

return width * height;

}

public String toString() {

return "Rectangle - Color: " + color + ", Width: " + width + ", Height: " + height;

}

Triangle

public class Triangle {

private String color;

private int base;

private int height;

public Triangle(String color, int base, int height) {

this.color = color;

this.base = base;

this.height = height;

}

public double getArea() {

return 0.5 * base * height;

}

public String toString() {

return "Triangle - Color: " + color + ", Base: " + base + ", Height: " + height;

}

TestShape

public class TestShape {

public static void main(String[] args) {

Rectangle s1 = new Rectangle("red", 4, 5);

System.out.println(s1);

System.out.println("Area is " + s1.getArea());

Triangle s2 = new Triangle("blue", 4, 5);

System.out.println(s2);

System.out.println("Area is " + s2.getArea());

}

Program 22: Re-write the abstract superclass Shape into an interface, containing only abstract methods, as follows:

Create a class TestShape as code of class is given below and predict the output.

public class TestShape {

public static void main(String[] args) {

Rectangle s1 = new Rectangle("red", 4, 5);

System.out.println(s1);

System.out.println("Area is " + s1.getArea());

Triangle s2 = new Triangle("blue", 4, 5);

System.out.println(s2);

System.out.println("Area is " + s2.getArea());

}

List out the errors in above mentioned code if any. Correct them to run the program successfully.

Code:

Interface

interface Shape {

double getArea();

}

Rectangle

public class Rectangle {

private String color;

private int width;

private int height;

public Rectangle(String color, int width, int height) {

this.color = color;

this.width = width;

this.height = height;

}

public double getArea() {

return width * height;

}

public String toString() {

return "Rectangle - Color: " + color + ", Width: " + width + ", Height: " + height;

}

Triangle

public class Triangle {

private String color;

private int base;

private int height;

public Triangle(String color, int base, int height) {

this.color = color;

this.base = base;

this.height = height;

}

public double getArea() {

return 0.5 * base * height;

}

public String toString() {

return "Triangle - Color: " + color + ", Base: " + base + ", Height: " + height;

}

TestShape

public class TestShape {

public static void main(String[] args) {

Rectangle s1 = new Rectangle("red", 4, 5);

System.out.println(s1);

System.out.println("Area is " + s1.getArea());

Triangle s2 = new Triangle("blue", 4, 5);

System.out.println(s2);

System.out.println("Area is " + s2.getArea());

}

Program 23: WAP to showcase the possible use of this keyword.

Code:

public class ThisExample { private int value = 10;

public void demonstrateVariableConflict() { int value = 20;

System.out.println("Local value: " + value);

System.out.println("Member variable (using this): " + this.value);

}

public ThisExample() { this(5);

}

public ThisExample(int value) { this.value = value;

System.out.println("Value initialized to: " + value);

}

public void printValue() {

System.out.println("Current object value: " + this.value);

}

public void modifyValue(int addToValue) { this.value += addToValue;

System.out.println("Value after modification: " + this.value);

}

public static void main(String[] args) { ThisExample obj = new ThisExample();

obj.demonstrateVariableConflict();

obj.printValue(); obj.modifyValue(15);

}

Program 24: WAP to showcase the possible use of super keywords.

Code:

Animal

public class Animal {

String name;

// Constructor

public Animal(String name) {

this.name = name;

}

// Method with public access modifier

public void eat() {

System.out.println(name + " is eating.");

}

Dog

public class Dog extends Animal {

String breed;

// Constructor

public Dog(String name, String breed) {

super(name); // Call superclass constructor

this.breed = breed;

}

// Method overriding with public access modifier

@Override

public void eat() {

super.eat(); // Call superclass method

System.out.println(name + " is eating dog food.");

}

// Additional method with public access modifier

public void bark() {

System.out.println(name + " is barking.");

}

Main

public class Main {

public static void main(String[] args) {

// Create a Dog object

Dog myDog = new Dog("Buddy", "Labrador");

// Call superclass method using super

myDog.eat();

// Call subclass method

myDog.bark();

}

Program 25: WAP to showcase the possible use of final keyword.

Code:

Circle

// Final variable

public class Circle {

final double PI = 3.14159;

double radius;

public Circle(double radius) {

this.radius = radius;

}

// Method with public access modifier

public double getArea() {

return PI * radius * radius;

}

Parent

// Final method

public class Parent {

public void display() {

System.out.println("Parent class method");

}

public final void finalDisplay() {

System.out.println("Final method in Parent class (Priyanshu Tiwari)");

}

Child

// Attempting to override final method will result in a compilation error

public class Child extends Parent {

// void finalDisplay() { }

}

Final Class

// Final class

final class FinalClass {

// Cannot be extended

}

Program 26: Create a package with two java files. Access these classes in another java file by importing the java file.

Code:

Directory Structure

D:\Semester 2/

│

└── Java/

├── mypackage/

│ ├── MyClass1.java

│ └── MyClass2.java

└── Main.java

MyClass1

package mypackage;

public class MyClass1 {

public void method1() {

System.out.println("Method 1 from MyClass1");

}

MyClass2

package mypackage;

public class MyClass2 {

public void method2() {

System.out.println("Method 2 from MyClass2");

}

Main

import mypackage.MyClass1;

import mypackage.MyClass2;

public class Main {

public static void main(String[] args) {

MyClass1 obj1 = new MyClass1();

obj1.method1();

MyClass2 obj2 = new MyClass2();

obj2.method2();

}

Program 27: Catch an Arithmetic Exception using try catch block.

Code:

public class Main {

public static void main(String[] args) {

try {

int result = divide(20, 5); // Attempt to divide by zero

System.out.println("Result: " + result);

} catch (ArithmeticException e) {

System.out.println("Error: " + e.getMessage());

}

public static int divide(int dividend, int divisor) {

return dividend / divisor;

}

Program 28: Create a class Student with attributes roll no, name, age, and course. Initilize values through parameterized constructor. If age of the student is not in between 15 and 21 then generate user-defined exception “AgeNotWithinRangeException”.

Code:

Student

import java.util.*;

public class Student {

private int rollNo;

private String name;

private int age;

private String course;

// Parameterized constructor with age validation

public Student(int rollNo, String name, int age, String course) throws AgeNotWithinRangeException {

this.rollNo = rollNo;

this.name = name;

if (age < 15 || age > 21) {

throw new AgeNotWithinRangeException("Age must be between 15 and 21.");

}

this.age = age;

this.course = course;

}

// Getters and setters

public int getRollNo() {

return rollNo;

}

public void setRollNo(int rollNo) {

this.rollNo = rollNo;

}

public String getName() {

return name;

}

public void setName(String name) {

this.name = name;

}

public int getAge() {

return age;

}

public void setAge(int age) throws AgeNotWithinRangeException {

if (age < 15 || age > 21) {

throw new AgeNotWithinRangeException("Age must be between 15 and 21.");

}

this.age = age;

}

public String getCourse() {

return course;

}

public void setCourse(String course) {

this.course = course;

}

@Override

public String toString() {

return "Student{" +

"rollNo=" + rollNo +

", name='" + name + '\'' +

", age=" + age +

", course='" + course + '\'' +

'}';

}

Age Not Within Range Exception

// Custom exception class

public class AgeNotWithinRangeException extends Exception {

public AgeNotWithinRangeException(String message) {

super(message);

}

Main

public class Main {

public static void main(String[] args) {

try {

// Create a student object with valid age

Student student1 = new Student(108, "Priyanshu", 18, "Computer Science");

System.out.println("Student 1: " + student1);

// Attempt to create a student object with invalid age

Student student2 = new Student(102, "Alok", 22, "Mathematics");

System.out.println("Student 2: " + student2);

} catch (AgeNotWithinRangeException e) {

// Catch and handle AgeNotWithinRangeException

System.out.println("Exception: " + e.getMessage());

}

} }

Output:

Program 29: Define a class MyDate with members day, month, year. Define default and parameterized constructors. Accept values from the command line and create a date object. Throw user defined – “InvalidDayException” or InvalidMonthException” if the day and month are invalid. If the date is valid display message “valid date”

Code:

// Custom exception for invalid day

class InvalidDayException extends Exception {

public InvalidDayException(String message) {

super(message);

}

// Custom exception for invalid month

class InvalidMonthException extends Exception {

public InvalidMonthException(String message) {

super(message);

}

public class MyDate {

private int day;

private int month;

private int year;

// Default constructor

public MyDate() {

this.day = 1;

this.month = 1;

this.year = 2000;

}

// Parameterized constructor

public MyDate(int day, int month, int year) throws InvalidDayException, InvalidMonthException {

if (!isValidMonth(month)) {

throw new InvalidMonthException("Invalid month: " + month);

}

this.month = month;

if (!isValidDay(day, month, year)) {

throw new InvalidDayException("Invalid day: " + day);

}

this.day = day;

this.year = year;

}

// Method to validate month

private boolean isValidMonth(int month) {

return month >= 1 && month <= 12;

}

// Method to validate day

private boolean isValidDay(int day, int month, int year) {

if (day < 1 || day > 31) {

return false;

}

if (month == 4 || month == 6 || month == 9 || month == 11) {

return day <= 30;

}

if (month == 2) {

if (year % 4 == 0 && (year % 100 != 0 || year % 400 == 0)) {

return day <= 29;

} else {

return day <= 28;

}

return true;

}

// Method to display date

public void displayDate() {

System.out.println("Valid date: " + day + "/" + month + "/" + year);

}

public static void main(String[] args) {

try {

// Parse command line arguments

int day = Integer.parseInt(args[0]);

int month = Integer.parseInt(args[1]);

int year = Integer.parseInt(args[2]);

// Create MyDate object

MyDate date = new MyDate(day, month, year);

date.displayDate();

} catch (NumberFormatException e) {

System.out.println("Invalid input. Please provide numeric values for day, month, and year.");

} catch (InvalidDayException | InvalidMonthException e) {

System.out.println("Error: " + e.getMessage());

} catch (ArrayIndexOutOfBoundsException e) {

System.out.println("Usage: java MyDate <day> <month> <year>");

}

Program 30: Write a program in Java that will create two threads namely thread1 and Thread2 using Thread Class that will print the numbers from 1 to 5.

Code:

Thread1

class Thread1 extends Thread {

public void run() {

for (int i = 1; i <= 5; i++) {

System.out.println("Thread1: " + i);

try {

Thread.sleep(1000); // Sleep for 1 second

} catch (InterruptedException e) {

e.printStackTrace();

} } } }

Thread2

class Thread2 extends Thread {

public void run() {

for (int i = 1; i <= 5; i++) {

System.out.println("Thread2: " + i);

try {

Thread.sleep(1000); // Sleep for 1 second

} catch (InterruptedException e) {

e.printStackTrace();

}

} } }

Main

public class Main {

public static void main(String[] args) {

// Create threads

Thread1 thread1 = new Thread1();

Thread2 thread2 = new Thread2();

// Start threads

thread1.start();

thread2.start();

}

Program 31: Write a program in Java that will create two threads namely thread1 and Thread2 using Runnable interface that will print the alphabet from A to F.

Code:

Thread1

class Thread1 extends Thread {

public void run() {

for (char c = 'A' ; c <= 'F'; c++) {

System.out.println("Thread1: " + c);

try {

Thread.sleep(1000); // Sleep for 1 second

} catch (InterruptedException e) {

e.printStackTrace();

} } } }

Thread2

class Thread2 extends Thread {

public void run() {

for (char c = 'A' ; c <= 'F'; c++) {

System.out.println("Thread1: " + c);

try {

Thread.sleep(1000); // Sleep for 1 second

} catch (InterruptedException e) {

e.printStackTrace();

}

} } }

Main

public class Main {

public static void main(String[] args) {

// Create threads

Thread1 thread1 = new Thread1();

Thread2 thread2 = new Thread2();

// Start threads

thread1.start();

thread2.start();

}

Program 32

AIM:WAP to create a form with awt controls.

CODE:

import java.awt.*; import java.awt.event.*;

class frame1 extends Frame

{

frame1()

{

setLayout(null);

Label head=new Label("New Student Registeration Form"); head.setBounds(500,50,250,30);

this.add(head);

Label fName = new Label("Student First Name : "); fName.setBounds(50,150,150,30); this.add(fName);

TextField tf1=new TextField(30); tf1.setBounds(250,150,200,30); add(tf1);

Label lName = new Label("Student Last Name : "); lName.setBounds(50,200,150,30); this.add(lName);

TextField tf2=new TextField(30); tf2.setBounds(250,200,200,30); add(tf2);

Label Add = new Label("Email Address : "); Add.setBounds(50,250,150,30); this.add(Add);

TextField tf3=new TextField(30); tf3.setBounds(250,250,200,30); add(tf3);

Label cAdd = new Label("Confirm Email Address : "); cAdd.setBounds(50,300,150,30);

this.add(cAdd);

TextField tf4=new TextField(30); tf4.setBounds(250,300,200,30); add(tf4);

Label Pass = new Label("Password : "); Pass.setBounds(50,350,150,30); this.add(Pass);

TextField tf5=new TextField(30); tf5.setBounds(250,350,200,30); add(tf5);

Label cPass = new Label("Confirm Password : "); cPass.setBounds(50,400,150,30); this.add(cPass);

TextField tf6=new TextField(30); tf6.setBounds(250,400,200,30); add(tf6);

Label DOB = new Label("Date of Birth : "); DOB.setBounds(50,450,150,30);

this.add(DOB);

Choice c1 = new Choice();

c1.setBounds(250, 450, 75, 75); c1.add("Year");

c1.add("Item 4");

c1.add("Item 5"); add(c1);

Choice c2 = new Choice(); c2.setBounds(350, 450, 75, 75); c2.add("Month");

c2.add("Item 2");

c2.add("Item 3");

c2.add("Item 4");

c2.add("Item 5"); add(c2);

Choice c3 = new Choice(); c3.setBounds(450, 450, 75, 75); c3.add("Date");

c3.add("Item 2");

c3.add("Item 3");

c3.add("Item 4");

c3.add("Item 5"); add(c3);

Checkbox r1=new Checkbox("Male"); Checkbox r2=new Checkbox("Female"); r1.setBounds(250,500,100,30); r2.setBounds(350,500,100,30);

add(r1);

add(r2);

Label dept = new Label("Department : "); dept.setBounds(50,550,150,30); this.add(dept);

Checkbox r3=new Checkbox("Civil"); r3.setBounds(250,550,100,30); add(r3);

Checkbox r4=new Checkbox("Computer Science and Engineering"); r4.setBounds(250,580,100,30);

add(r4);

Checkbox r5=new Checkbox("Electrical"); r5.setBounds(250,610,100,30);

add(r5);

Checkbox r6=new Checkbox("Electronics and communication"); r6.setBounds(250,640,100,30);

add(r6);

Button bt=new Button("Submit"); bt.setBounds(250,700,70,30); add(bt);

Button bt1=new Button("Cancle"); bt1.setBounds(330,700,70,30); add(bt1);

Label date = new Label("Your date is Below "); date.setBounds(750,500,150,30); this.add(date);

TextField tf7=new TextField(30); tf7.setBounds(750,550,300,200); add(tf7);

this.addWindowListener(new WindowAdapter()

{

public void windowClosing(WindowEvent we)

{

System.exit(0);

}

public class MainFun

{

public static void main(String args[])

{

frame1 f1=new frame1(); f1.setVisible(true); f1.setSize(500,500);

}

AI Lab file 2024

noreply@blogger.com (HACKTECH) — Thu, 16 May 2024 19:53:00 -0700

Assignment 1

Problem – Write a program to find out the next state of a given 8-puzzle problem.

Solution:

import heapq

# Define the goal state

goal_state = [[1, 2, 3],

[4, 5, 6],

[7, 8, 0]]

# Define the possible moves

moves = [(0, 1), (0, -1), (1, 0), (-1, 0)]

def heuristic(state):

# Manhattan distance heuristic

distance = 0

for i in range(3):

for j in range(3):

if state[i][j] != 0:

goal_row, goal_col = (state[i][j] - 1) // 3, (state[i][j] - 1) % 3

distance += abs(i - goal_row) + abs(j - goal_col)

return distance

def get_next_states(state):

next_states = []

for i in range(3):

for j in range(3):

if state[i][j] == 0:

for move in moves:

new_i, new_j = i + move[0], j + move[1]

if 0 <= new_i < 3 and 0 <= new_j < 3:

new_state = [row[:] for row in state]

new_state[i][j], new_state[new_i][new_j] = new_state[new_i][new_j], new_state[i][j]

next_states.append(new_state)

return next_states

def astar(start_state):

frontier = [(heuristic(start_state), 0, start_state)]

explored = set()

while frontier:

_, cost, current_state = heapq.heappop(frontier)

if current_state == goal_state:

return current_state

explored.add(tuple(map(tuple, current_state)))

for next_state in get_next_states(current_state):

if tuple(map(tuple, next_state)) not in explored:

heapq.heappush(frontier, (heuristic(next_state) + cost + 1, cost + 1, next_state))

return None

def print_puzzle(puzzle):

for row in puzzle:

print(" ".join(map(str, row)))

if __name__ == "__main__":

# Example usage

initial_state = [[1, 2, 3],

[4, 0, 5],

[7, 8, 6]]

print("Initial state:")

print_puzzle(initial_state)

solution = astar(initial_state)

if solution:

print("\nSolution found:")

print_puzzle(solution)

else:

print("No solution found!")

Assignment 2

Problem – Write a program to compute Manhattan distance of a state in 8-puzzle problem.

Solution:-

def manhattan_distance(state):

distance = 0

for i in range(3):

for j in range(3):

if state[i][j] != 0:

goal_row, goal_col = (state[i][j] - 1) // 3, (state[i][j] - 1) % 3

distance += abs(i - goal_row) + abs(j - goal_col)

return distance

# Example usage

initial_state = [[1, 2, 3],

[4, 0, 5],

[7, 8, 6]]

print("Initial state:")

for row in initial_state:

print(" ".join(map(str, row)))

print("\nManhattandistance:", manhattan_distance(initial_state))

Assignment 3

Problem – Write a program to check the 8-puzzle problem is solvable or not.

Solution:-

def count_inversions(puzzle):

inversions = 0

puzzle_list = [number for row in puzzle for number in row if number != 0]

for i in range(len(puzzle_list)):

for j in range(i + 1, len(puzzle_list)):

if puzzle_list[i] > puzzle_list[j]:

inversions += 1

return inversions

def is_solvable(puzzle):

inversions = count_inversions(puzzle)

blank_row = 0

for i in range(3):

if 0 in puzzle[i]:

blank_row = i

if (inversions % 2 == 0 and blank_row % 2 == 0) or (inversions % 2 != 0 and blank_row % 2 != 0):

return True

else:

return False

# Example usage

puzzle = [[1, 2, 3],

[4, 5, 6],

[8, 7, 0]] # Unsolvable puzzle

print("Is the puzzle solvable? A program by Madhav",is_solvable(puzzle))

Assignment 4

Problem – Write a program to solve 8-puzzle problem using BFS Algorithm.

Solution:

from collections import deque

goal_state = [[1, 2, 3],

[4, 5, 6],

[7, 8, 0]]

moves = [(0, 1), (0, -1), (1, 0), (-1, 0)]

# Program by MADHAV

def get_next_states(state):

next_states = []

for i in range(3):

for j in range(3):

if state[i][j] == 0:

for move in moves:

new_i, new_j = i + move[0], j + move[1]

if 0 <= new_i < 3 and 0 <= new_j < 3:

new_state = [row[:] for row in state]

new_state[i][j], new_state[new_i][new_j] = new_state[new_i][new_j], new_state[i][j]

next_states.append(new_state)

return next_states

def bfs(start_state):

queue = deque([(start_state, [])])

visited = set()

while queue:

current_state, path = queue.popleft()

if current_state == goal_state:

return path

visited.add(tuple(map(tuple, current_state)))

for next_state in get_next_states(current_state):

if tuple(map(tuple, next_state)) not in visited:

queue.append((next_state, path + [next_state]))

# Example usage

initial_state = [[1, 2, 3],

[4, 0, 5],

[7, 8, 6]]

print("Initial state:")

for row in initial_state:

print(" ".join(map(str, row)))

solution_path = bfs(initial_state)

if solution_path:

print("\nSolution found in", len(solution_path), "steps:")

for step, state in enumerate(solution_path):

print("Step", step + 1, ":")

for row in state:

print(" ".join(map(str, row)))

else:

print("No solution found!")

Assignment 4

Problem – Write a program to solve 8-puzzle problem using BFS Algorithm.

Solution:

from collections import deque

goal_state = [[1, 2, 3],

[4, 5, 6],

[7, 8, 0]]

moves = [(0, 1), (0, -1), (1, 0), (-1, 0)]

# Program by MADHAV

def get_next_states(state):

next_states = []

for i in range(3):

for j in range(3):

if state[i][j] == 0:

for move in moves:

new_i, new_j = i + move[0], j + move[1]

if 0 <= new_i < 3 and 0 <= new_j < 3:

new_state = [row[:] for row in state]

new_state[i][j], new_state[new_i][new_j] = new_state[new_i][new_j], new_state[i][j]

next_states.append(new_state)

return next_states

def bfs(start_state):

queue = deque([(start_state, [])])

visited = set()

while queue:

current_state, path = queue.popleft()

if current_state == goal_state:

return path

visited.add(tuple(map(tuple, current_state)))

for next_state in get_next_states(current_state):

if tuple(map(tuple, next_state)) not in visited:

queue.append((next_state, path + [next_state]))

# Example usage

initial_state = [[1, 2, 3],

[4, 0, 5],

[7, 8, 6]]

print("Initial state:")

for row in initial_state:

print(" ".join(map(str, row)))

solution_path = bfs(initial_state)

if solution_path:

print("\nSolution found in", len(solution_path), "steps:")

for step, state in enumerate(solution_path):

print("Step", step + 1, ":")

for row in state:

print(" ".join(map(str, row)))

else:

print("No solution found!")

Assignment 5

Problem – Write a program in prolog to implement movie recommendation system.

Solution:

1. likes(Madhav, south).

2. likes(viral, mystery).

3. likes(anuj, action).

4. likes(ravi, sci-fi).

5. likes(anu, history).

6. likes(vicky, sci-fi).

7. movies(hum tum, mystery).

8. movies(the nun, horror).

9. movies(humshakals, comedy).

10. movies(avengers, sci-fi).

11. movies(war, action).

12. movies(extraction, action).

13. movies(the_maze_runner, sci-fi).

14. movies(inside, action).

15. movies(mummy, history).

16. movies(lucky_the_racer, south).

17. movies(pushpa, south).

18. recommend_to(Person, Movies) :-

likes(Person, Category),

movies(Movie, Category), Movies = Movie.

Assignment 6

Problem - Write a program in prolog to check whether a number is natural or not.

Solution:

1. mother_child(rahul,ram).

2. father_child(prateek, shyam).

3. father_child(prateek, ravi).

4. father_child(prateek, shyam).

5. sibling(X, Y) :- parent_child(Z, X), parent_child(Z, Y).

6. parent_child(X, Y) :- father_child(X, Y).

7. parent_child(X, Y) :- mother_child(X, Y).

Assignment 7

Problem - Write a program in prolog to check whether a number is natural or not.

Solution:

1. nat(N) :- between(0, infinite, N).

Output:

Assignment 8

Problem - Write a program in prolog to check the membership of an element from a list.

Solution:

1. member(X, [X|_]).

2. member(X, [_|T]) :- member(X, T).

Output:

Assignment 9

Problem - Write a program in prolog to add an element in front of a list.

Solution:

1. add_front(X, [], [X]).

2. add_front(X, [H|T], [X,H|T]).

Output:

Assignment 10

Problem - Write a program in prolog to delete an element from the front of a list.

Solution:

1. delete_front([_|T], T).

Output:

Assignment 11

Problem – Write a program in prolog to find out gcd of two numbers.

Solution:

1. gcd(X,0,X).

2. gcd(X,Y,Z) :- R is mod(X,Y), gcd(Y,R,Z).

OUTPUT

Assignment 12

Problem - The monkey-and-bananas problem is often used in the Al literature to demonstrate ideas about common-sense reasoning. The problem can be stated as follows: A monkey is in a room containing a box and a bunch of bananas. The bananas are hanging from the ceiling out of reach of the monkey. How can the monkey obtain the bananas. (The monkey is supposed to go to the box, push it under the bananas, climb on top of it and grasp the bananas.)

Write the production rules for the above problem. Implement the above problem in prolog.

Solution:

1. move(state(middle, onbox, middle, hasnot), grasp, state(middle, onbox, middle, has)).

2. move(state(P, onfloor, P, H), climb, state(P, onbox, P, H)).

3. move(state(P1, onfloor, P1, H), push(P1, P2), state(P2, onfloor, P2, H)).

4. move(state(P1, onfloor, B, H), walk(P1, P2), state(P2, onfloor, B, H)).

5. canget(state(_,_,_,has)) :- write("yes can get").

6. canget(State1) :- move(State1, Op, State2), canget(State2).

Output:

AI Prolog PDF

noreply@blogger.com (HACKTECH) — Thu, 16 May 2024 17:09:00 -0700

Prolog

Clause

Prolog programs describe relations, defined by means of clauses. Pure Prolog is restricted to Horn clauses. There are two types of clauses: facts and rules.

A rule is of the form Head :- Body

and is read as "Head is true if Body is true". For example

animal(X) :- cat(X).

mean for all X, X animal if X is cat.

Fact is a clause without body. For example ‘Tom is a cat.’ is a fact and represented in prolog as

cat(‘Tom’).

It may also be represented as

cat(tom):- true.

Term

A term in prolog may be

Atom: An atom is a general-purpose name with no inherent meaning. Examples of atoms include x , red , 'Taco' , 'some atom’ .

Number: It can be floats or integers. For example 5, 2.5, 0.5, -2 etc

Variable: It is denoted by a string consisting of letters, numbers and underscore characters, and beginning with an upper-case letter or underscore. It represents placeholders for arbitrary terms.

A variable can become instantiated through unification.

_ denotes anonymous variable. It does not represent same value every where it occurs with in a predicate definition.

Compound term: It is composed of an atom called a "functor" and a number of "arguments", which are again terms For example

likes_movie(ravi, dangal).

The number of arguments is called the term's arity.

Evaluation

Execution of a Prolog program is initiated by the user's posting of a single goal, called the query. Execution strategy is called chronological backtracking.

Example

mother_child(trude, sally). father_child(tom, sally). father_child(tom, erica). father_child(mike, tom).

sibling(X, Y) :- parent_child(Z, X), parent_child(Z, Y). parent_child(X, Y) :- father_child(X, Y).

parent_child(X, Y) :- mother_child(X, Y).

This results in the following query being evaluated as true:

?- sibling(sally, erica).

True

The process of evaluation is shown below

father_child(Z, sally) father_child(Z, erica)

father_child(tom, sally) father_child(tom, erica)

true

True True

This results in the following query being evaluated as true:

?- father_child(X, Y).

X=tom, Y=sally

X=tom, Y=erica

X=mike, Y=tom

The process of evaluation is shown below

r(a).

s(b,c).

m(b).

n(a).

q(X):-m(X).

q(X):-n(X). p(X,Y):-q(X),r(Y).

p(X,Y):-r(X),s(X,Y).

?-p(a,Y)

Y=a

Loop and Recursion

Iterative algorithms can be implemented by means of recursive predicates. Order of rules is important.

For example program to check whether a number is natural number or not

natural(X):-X=<0,!,fail.

natural(1):-true,!.

natural(X):-Y is X-1,natural(Y).

Anonymous Variable

The name of every anonymous variable is _.

An ordinary variable stands for the same variable within one clause and bound to same value. On the contrary, every occurrence of _denotes a distinct variable.

For example

fly(X) :- green(X), dragon(X).

and happy(X) :- pass_exam(X,Y).

here, X in fly(X) and happy(X) are not related.

However, the occurrance of X in the definition of fly(X) refer to the same thing. In the following example , the variable represented by _ refers to different people balanced_child(X) :-brother(X,_), sister(X,_).

List

Prolog supports a data-structure known as list. List always starts and end with square brackets, and each of the items it contains is separated by a comma.

Syntex [item1,item2,….]

[Head|Tail] [item1,item2,…|others] Item may be another list.

For example

[a,b,c] , [a], [[a,b],c,[d,[e,f]]]

[a,b,c] unifies with [Head|Tail] resulting in Head=a and Tail=[b,c]

[a] unifies with [H|T] resulting in H=a and T=[] [a,b,c] unifies with [a|T] resulting in T=[b,c] [a,b,c] doesn't unify with [b|T]

[] doesn't unify with [H|T]

[] unifies with []. Two empty lists always match

Q: Do the following pairs of lists unify ?

Ans:

[a,d,z,c] and [H|T]

Yes H = a and T = [d,z,c] [apple,pear,grape] and [A,pear|Rest]

Yes A = apple and Rest = [grape] [a|Rest] and [a,b,c]

Yes Rest = [b,c] [a,[]] and [A,B|Rest]

Yes A = a, B = [] and Rest = [] [One] and [two|[]]

Yes One = two [one] and [Two]

Yes Two = one [a,b,X] and [a,b,c,d]

No X can not represent the two atoms c,d

To check membership

member(X,Y) checks X is member of list Y?

member(X,[X|_]).

member(X,[H|T]):-member(X,T)

?- member(a,[b,a,c]) True

?- member(a,[[a,b],c,d]) False

To check concatenation

concatenation(L1,L2,L3) check L3 is concatenation of L1 and L2?

concatenation([],L,L).

concatenation([X|L1],L2,[X|L3]):- concatenation(L1,L2,L3).

concatenation([],L,L).

concatenation([X|L1],L2,[X|L3]):- concatenation(L1,L2,L3).

concatenation([1,2],[3,4],[1,2,3,4])

⬇

concatenation([2],[3,4],[2,3,4])

⬇

concatenation([],[3,4],[3,4])

⬇

TRUE

To add a element in the front of a list

add(X,L,[X|L]).

?-add(a,[b,c],[a,b,c]) true

?-add(a,[b,c],X) X=[a,b,c]

To delete an element from the front of a list

del(X,[X|Tail],Tail). del(X,[Y|Tail],[Y|Tail]):-del(X,Tail,Tail).

?-del(a,[a,b,c],[b,c]) True

?-del(a,[b,a,c],[b,c]) False

?-del(a,[a,b,c],X) X=[b,c]

To find out S is sublist of list L

sublist(S,L):-concatenation(L1,L2,L),concatenation(S,L3,L2).

?- sublist([a,b],[d,a,e,b,c]) False

?- sublist([a,b],[d,a,b,c]) True

To find out length of a list

len([],0).

len([_|T],N):-len(T,N1), N is N1+1.

?- len([a,b,c],4) False

?- len([a,b,c],X) X=3

Monkey and Banana Problem

There is a monkey at the door of a room

In the middle of the room a banana hangs from the ceiling

The monkey wants it, but can not jump high enough from the floor. At the window of the room there is a box that the monkey can use.

The monkey can perform the following actions.

· Walk on the floor

· Climb the box

· Push the box around(if it is beside the box)

· Grasp the banana if it is standing on the box directly under the banana. Solution:

We define the state as 4 tuple. (monkey_at, on, box_at, has_banana)

First parameter specify the position of monkey - door/middle Second parameter specifies whether monkey is on floor or on box Third parameter specifies position of box – window/middle

Forth parameter specifies whether monkey has banana or not

move(state(middle,onbox,middle,hasnot),grasp,state(middle,onbox,middle,has)). move(state(P,onfloor,P,H),climb,state(P,onbox,P,H)). move(state(P1,onfloor,P1,H),push(P1,P2),state(P2,onfloor,P2,H)). move(state(P1,onfloor,B,H),walk(P1,P2),state(P2,onfloor,B,H)). canget(state(_,_,_,has)):-write("yes can get").

canget(State1):-move(State1,Op,State2),canget(State2).

?- canget(state(middle,onbox,middle,has)) True

Arithmetic operators

Supports +,-,*, /, mod

is operator forces evaluation

?- X is 3/2

Relational operators

>, >=, =<,=:=,=\=

To find gcd of two numbers.

gcd(X,X,X).

gcd(X,Y,D):-X<Y, Y1 is Y-X , gcd(X,Y1,D).

gcd(X,Y,D):-X>Y, X1 is X-Y , gcd(X1,Y,D).

?-gcd(15,40,X) X=5

?-gcd(5,4,1)

True

Cuts for controlling backtracking

The cut, in Prolog, is a goal, written as !, which always succeeds, but cannot be backtracked past. It is used to prevent unwanted backtracking, for example, to prevent extra solutions being found by Prolog.

For example

C:-P, Q, R, !, S, T, U.

C:- V.

A:- B,C,D.

?-A

· Backtracking done within the goal list P,Q,R

· As soon as the cut is reached

ü All alternatives of P,Q,R are suppressed.

ü The clause C:-V will also be discarded

ü No effect within A:-B, C, D, that is backtracking within B,C,D remains active.

To find out maximum of 2 numbers.

max(X,Y,X):-X>=Y,!.

max(X,Y,Y).

Adding an element to a list without duplication.

member(X,[X|_]).

member(X,[_|T]):-member(X,T).

add(X,L,L):-member(X,L),!.

add(X,L,[X|L]).

Negation as failure (use of !)

Example 1:

‘Rohan likes all jewellery except rings’ likes(rohan,X):- ring(X),!,fail. likes(rohan,X):-jewellery(X).

Example 2:

Different predicate.

different(X,X):-!,fail. different(X,Y).

Difference between fail and cut

· Fail predicate forces backtracking whereas Cut predicate prevents backtracking.

· Fail predicate always fail whereas Cut predicate always succeed.

INSERTION SORT

noreply@blogger.com (HACKTECH) — Tue, 19 Dec 2023 14:24:00 -0800

INSERTION SORT :-

ALGORITHM:=

STEP1. SET A[0]:= INFINITY

STEP2. REPEAT STEP 3 TO 5 FOR K =2,3,...N

STEP3. SET TEMP:= A[K] AND PTR:=K-1

STEP 4. REPEAT WHILE TEMP<A[PTR]

A) SET A[PTR+1]:=A[PTR]

B) set PTR:=PTR-1

STEP5. SET A[PTR+1];=TEMP

STEP6. RETURN

CODE:-

#include<stdio.h>
#include<conio.h>
void insertionSort(int arr[], int size) {
    int i, j, key;
    for (i = 1; i < size; i++) 
    {
        key = arr[i];
        j = i - 1;
        while (j >= 0 && arr[j] > key) {
            arr[j + 1] = arr[j];
            j = j - 1;
        }

        arr[j + 1] = key;
    }
}

void main() {
    int a[5], i, size = 5;
    clrscr();
    printf("Enter array elements:\n");
    for (i = 0; i < size; i++) {
        scanf("%d", &a[i]);
    }
    printf("Array before sorting:\n");
    for (i = 0; i < size; i++) {
        printf("%d ", a[i]);
    }
    printf("\n");
    insertionSort(a, size);
    printf("Array after insertion sort:\n");
    for (i = 0; i < size; i++) {
        printf("%d ", a[i]);
    }
    printf("\n");
    getch();
}

MERGING AND SORTING

noreply@blogger.com (HACKTECH) — Tue, 19 Dec 2023 14:16:00 -0800

MERGING AND SORTING:-

CODE:-

#include<stdio.h>

#include<conio.h>

int main()

{

int i, j, n1, n2, k, a1[20], a2[20], m[20];

clrscr();

printf("enter size of first array : ");

scanf("%d", &n1);

printf("\n");

for (i=0; i<n1; i++)

{

printf("enter array element :");

scanf( "%d", &a1[i] );

}

printf("\n");

printf("enter size of second array :");

scanf( "%d", &n2 );

printf("\n");

for(j=0; j<n2; j++)

{

printf("enter array element :");

scanf( "%d", &a2[j] );

}

printf("\n\n The first array :");

for(i=0; i<n1; i++)

{

printf("%d ", &a1[i]);

}

printf("\n\n The Second array :");

for(j=0; j<n2; j++)

{

printf("%d ", &a2[j]);

}

k=0;

i=0; j=0;

while(i<n1 && j<n2)

{

if(a1[i]<a2[j])

{

m[k++] = a1[i++];

}

else

{

m[k++] = a2[j++];

}

while(i<n1)

m[k++] = a1[i++];

while(j<n2)

m[k++] = a2[j++];

printf("\n\n Array after merging and sorting :");

for(i=0; i<n1+n2; i++)

{

printf("%d ",m[i]);

}

getch();

return 0;

}

BINARY SORT

noreply@blogger.com (HACKTECH) — Tue, 19 Dec 2023 14:15:00 -0800

BINARY SEARCH:-

ALGORITHM:-

STEP 1. SET BEG:=LB,END:=UB AND MID =INT(BEG+END)/2)

STEP 2. REPEAT STEP 3 & 4 WHILE BEG<=END AND DATA[MID] is not equal to ITEM

STEP 3. IF ITEM <DATA[MID],THEN

SET END:=MID-1

ELSE

SET BEG:=MID+1

STEP 4. SET MID:= INT(BEG+END)/2

STEP 5. IF DATA [MID] =ITEM, THEN

SET LOC;=MID

ELSE

SET LOC:=NULL

STEP 6. EXIT

CODE:-

MERGE SORT

noreply@blogger.com (HACKTECH) — Tue, 19 Dec 2023 14:14:00 -0800

MERGE SORT:-

ALGORITHM:-

STEP 1. SET L:=1

STEP 2. REPEAT STEP 3 TO 6 WHILE L<N;

STEP 3. CALL MERGEPASS (A,N,L,B)

STEP 4. CALL MERGEPASS(B,N,2*L,A)

STEP 5. SET L:=4*L

STEP 6. EXIT

CODE:-

#include<stdio.h>

#include<conio.h>

int main()

{

int i,j,n1,n2,a1[20],a2[20],m[20];

clrscr();

printf("enter size of first array : ");

scanf("%d",&n1);

printf("\n");

for(i=0;i<n1;i++)

{

printf("enter array element : ");

scanf("%d",&a1[i]);

}

printf("\n");

printf("enter size of second array : ");

scanf("%d",&n2);

printf("\n");

for(i=0;i<n2;i++)

{

printf("enter array element : ");

scanf("%d",&a2[i]);

}

printf("\n\n the first array : ");

for(i=0;i<n1;i++)

{

printf("%d ",a1[i]);

}

printf("\n\n the second array : ");

for(i=0;i<n2;i++)

{

printf("%d ",a2[i]);

}

for(i=0;i<n1;i++)

{

m[i]=a1[i];

}

for(i=n1;i<n1+n2;i++)

{

m[i]=a2[i-n1];

}

printf("\n\n merged array : ");

for(j=0;j<n1+n2;j++)

{

printf("%d ",m[j]);

}

getch();

return 0;

}

SELECTION SORT

noreply@blogger.com (HACKTECH) — Tue, 19 Dec 2023 14:13:00 -0800

SELECTION SORT

ALGORITHM:-

STEP 1. REPEAT STEP 2 & 3 FOR K=1,2...N-1

STEP 2. MIN(A,K,N,LOC)

STEP 3. SET TEMP:=A[K],A[K]:=A[LOC] AND A[LOC];=TEMP

STEP 4. EXIT

CODE:-

#include<stdio.h>

#include<conio.h>

int main()

{

int i,j,n,arr[20],min=0,temp=0;

clrscr();

printf("Enter the size of array : ");

scanf("%d",&n);

printf("\n");

for(i=0; i<n; i++)

{

printf("enter array element : ");

scanf("%d",&arr[i]);

}

printf("\nThe Unsorted array you entered : \n");

for(i=0; i<n; i++)

{

printf("%d ",arr[i]);

}

printf("\n");

for(i=0;i<n-1;i++)

{

min=i;

for(j=i+1;j<n;j++)

{

if(arr[j]<arr[min])

{

min=j;

}

temp=arr[i];

arr[i]=arr[min];

arr[min]=temp;

}

printf("\nThe Sorted array we got using Selection sort : \n");

for(i=0;i<n;i++)

{

printf("%d ",arr[i]);

}

getch();

return 0;

}

BUBBLE SORT

noreply@blogger.com (HACKTECH) — Tue, 19 Dec 2023 14:12:00 -0800

BUBBLE SORT:-

ALGORITHM:-

STEP 1. REPEAT STEP 2 & 3 FOR K=1 TO N-1

STEP 2. SET PTR:= 1

STEP 3. REPEAT WHILE PTR <= N-K

A) IF DATA [PTR]>DATA[PTR+1] THEN INTERCHANGE DATA[PTR] & DATA[PTR+1]

B) SET PTR:= PTR+1

STEP 4. EXIT

CODE:-

#include<stdio.h>
#include<conio.h>
int main()
{
    int i,j,n,arr[20],temp;
    int flag;
    clrscr();
    printf("Enter the size of array : ");
    scanf("%d",&n);
    printf("\n");
    for(i=0; i<n; i++)
    {
    printf("enter array element : ");
    scanf("%d",&arr[i]);
    }
    printf("\nUnsorted Array : ");
    for(i=0; i<n; i++)
    {
    printf ("%d   ",arr[i]);
    }

    for(i=0;i<n-1;i++)
    {   flag=0;
    for(j=0;j<n-1;j++)
    {
        if(arr[j]>=arr[j+1])
        {
        temp = arr[j];
        arr[j] = arr[j+1];
        arr[j+1] = temp;
        flag=1;
        }
    }
    if(flag==0)
    {
        break;
    }
    }

    printf("\n\nHere's the sorted Array : ");
    for(i=0;i<n;i++)
    {
    printf("%d   ",arr[i]);
    }
    printf("\n");
    getch();
    return 0;

}

DELETION OF ARRAY

noreply@blogger.com (HACKTECH) — Tue, 19 Dec 2023 14:12:00 -0800

INSERTION SORT :-

ALGORITHM:=

STEP1. SET A[0]:= INFINITY

STEP2. REPEAT STEP 3 TO 5 FOR K =2,3,...N

STEP3. SET TEMP:= A[K] AND PTR:=K-1

STEP 4. REPEAT WHILE TEMP<A[PTR]

A) SET A[PTR+1]:=A[PTR]

B) set PTR:=PTR-1

STEP5. SET A[PTR+1];=TEMP

STEP6. RETURN

CODE:-

#include<stdio.h>
#include<conio.h>
void insertionSort(int arr[], int size) {
    int i, j, key;
    for (i = 1; i < size; i++) 
    {
        key = arr[i];
        j = i - 1;
        while (j >= 0 && arr[j] > key) {
            arr[j + 1] = arr[j];
            j = j - 1;
        }

        arr[j + 1] = key;
    }
}

void main() {
    int a[5], i, size = 5;
    clrscr();
    printf("Enter array elements:\n");
    for (i = 0; i < size; i++) {
        scanf("%d", &a[i]);
    }
    printf("Array before sorting:\n");
    for (i = 0; i < size; i++) {
        printf("%d ", a[i]);
    }
    printf("\n");
    insertionSort(a, size);
    printf("Array after insertion sort:\n");
    for (i = 0; i < size; i++) {
        printf("%d ", a[i]);
    }
    printf("\n");
    getch();
}

TRAVERSING ARRAY

noreply@blogger.com (HACKTECH) — Tue, 19 Dec 2023 14:11:00 -0800

TRAVERSING ARRAY:-

ALGORITHM:-

STEP1. SET K=LB

STEP2. REPEAT STEP 3 & 4 WHILE K<=UB

STEP3. VISIT ELEMENT LA[K]

SET K :=K|+1

STEP4. EXIT

CODE:-.

#include<stdio.h>

#include<conio.h>

void main() {

int a[5], i, size = 5;

clrscr();

printf("Enter array elements:\n");

for (i = 0; i < size; i++) {

scanf("%d", &a[i]);

}

printf("Array elements during traversal:\n");

for (i = 0; i < size; i++) {

printf("%d ", a[i]);

}

printf("\n");

getch();

}

INSERTION IN ARRAY

noreply@blogger.com (HACKTECH) — Tue, 19 Dec 2023 14:10:00 -0800

INSERTION IN ARRAY:-

ALGORITHM:-

STEP 1. set j=n

STEP2. repeat step 3 and 4 while j>=k

STEP3. set LA[j+1];=LA[J]

STEP4. SET J:= J-1

STEP5. SET LA[K]:=ITEM

STEP6. SET N:=N+1

STEP7. EXIT

CODE :-

#include<stdio.h>

#include<conio.h>

void main() {

int a[5], i = 0, j, position, value, size = 5;

clrscr();

printf("Enter array elements:\n");

for (j = 0; j < 5; j++) {

scanf("%d", &a[j]);

}

printf("Enter the position to insert (0-based index): ");

scanf("%d", &position);

if (position < 0 || position > size) {

printf("Invalid position. Insertion failed.\n");

} else {

printf("Enter the value to insert: ");

scanf("%d", &value);

for (i = size - 1; i >= position; i--) {

a[i + 1] = a[i];

}

a[position] = value;

size++;

printf("Array after insertion:\n");

for (i = 0; i < size; i++) {

printf("%d ", a[i]);

}

printf("\n");

}

getch();

}

TIME COMPLEXITY:-

LINEAR SEARCH

noreply@blogger.com (HACKTECH) — Tue, 19 Dec 2023 14:10:00 -0800

LINEAR SEARCH:-

ALGORITHM:-

STEP 1. Begin

STEP 2. set a[5] {10,20,30,40,50}

STEP3. set i=0

STEP4. input searching item

STEP5. repeat step 6 & 7 while i<5

STEP6. if a [i]=item then print item found and location=i & exit

STEP 7. i=i+1

STEP8. if i>5 then print item not found

STEP 9. EXIT

CODE :-

#include<stdio.h>

#include<conio.h>

void main() {

int a[5], i = 0, j, item;

clrscr();

printf("Enter array elements:\n");

for (j = 0; j < 5; j++) {

scanf("%d", &a[j]);

}

printf("Enter item to search:\n");

scanf("%d", &item);

while (i < 5) {

if (a[i] == item) {

printf("Item found at location: %d\n", i);

break; // Added to exit the loop once the item is found

}

i++;

}

if (i == 5) {

printf("Item not found\n");

}

getch();

}

TIME COMPLEXITY:- O(|n)

DAA PRACTICAL

noreply@blogger.com (HACKTECH) — Tue, 19 Dec 2023 12:29:00 -0800

LINEAR SEARCH:-

ALGORITHM:-

STEP 1. Begin

STEP 2. set a[5] {10,20,30,40,50}

STEP3. set i=0

STEP4. input searching item

STEP5. repeat step 6 & 7 while i<5

STEP6. if a [i]=item then print item found and location=i & exit

STEP 7. i=i+1

STEP8. if i>5 then print item not found

STEP 9. EXIT

CODE :-

#include<stdio.h>

#include<conio.h>

void main() {

int a[5], i = 0, j, item;

clrscr();

printf("Enter array elements:\n");

for (j = 0; j < 5; j++) {

scanf("%d", &a[j]);

}

printf("Enter item to search:\n");

scanf("%d", &item);

while (i < 5) {

if (a[i] == item) {

printf("Item found at location: %d\n", i);

break; // Added to exit the loop once the item is found

}

i++;

}

if (i == 5) {

printf("Item not found\n");

}

getch();

}

INSERTION IN ARRAY:-

ALGORITHM:-

STEP 1. set j=n

STEP2. repeat step 3 and 4 while j>=k

STEP3. set LA[j+1];=LA[J]

STEP4. SET J:= J-1

STEP5. SET LA[K]:=ITEM

STEP6. SET N:=N+1

STEP7. EXIT

CODE :-

#include<stdio.h>
#include<conio.h>

void main() {
    int a[5], i = 0, j, position, value, size = 5;
    clrscr();
     printf("Enter array elements:\n");
    
    for (j = 0; j < 5; j++) {
        scanf("%d", &a[j]);
    }
    
    printf("Enter the position to insert (0-based index): ");
    scanf("%d", &position);
    
    if (position < 0 || position > size) {
        printf("Invalid position. Insertion failed.\n");
    } else {
        printf("Enter the value to insert: ");
        scanf("%d", &value);
        for (i = size - 1; i >= position; i--) {
            a[i + 1] = a[i];
        }
        a[position] = value;
        size++;
        printf("Array after insertion:\n");
        for (i = 0; i < size; i++) {
            printf("%d ", a[i]);
        }
        printf("\n");
    }

    getch();
}

TRAVERSING ARRAY:-

ALGORITHM:-

STEP1. SET K=LB

STEP2. REPEAT STEP 3 & 4 WHILE K<=UB

STEP3. VISIT ELEMENT LA[K]

SET K :=K|+1

STEP4. EXIT

CODE:-.

#include<stdio.h>

#include<conio.h>

void main() {

int a[5], i, size = 5;

clrscr();

printf("Enter array elements:\n");

for (i = 0; i < size; i++) {

scanf("%d", &a[i]);

}

printf("Array elements during traversal:\n");

for (i = 0; i < size; i++) {

printf("%d ", a[i]);

}

printf("\n");

getch();

}

INSERTION SORT :-

ALGORITHM:=

STEP1. SET A[0]:= INFINITY

STEP2. REPEAT STEP 3 TO 5 FOR K =2,3,...N

STEP3. SET TEMP:= A[K] AND PTR:=K-1

STEP 4. REPEAT WHILE TEMP<A[PTR]

A) SET A[PTR+1]:=A[PTR]

B) set PTR:=PTR-1

STEP5. SET A[PTR+1];=TEMP

STEP6. RETURN

CODE:-

#include<stdio.h>
#include<conio.h>
void insertionSort(int arr[], int size) {
    int i, j, key;
    for (i = 1; i < size; i++) 
    {
        key = arr[i];
        j = i - 1;
        while (j >= 0 && arr[j] > key) {
            arr[j + 1] = arr[j];
            j = j - 1;
        }

        arr[j + 1] = key;
    }
}

void main() {
    int a[5], i, size = 5;
    clrscr();
    printf("Enter array elements:\n");
    for (i = 0; i < size; i++) {
        scanf("%d", &a[i]);
    }
    printf("Array before sorting:\n");
    for (i = 0; i < size; i++) {
        printf("%d ", a[i]);
    }
    printf("\n");
    insertionSort(a, size);
    printf("Array after insertion sort:\n");
    for (i = 0; i < size; i++) {
        printf("%d ", a[i]);
    }
    printf("\n");
    getch();
}

DELETION IN ARRAY:-

ALGORITHM:-

STEP 1. SET ITEM := LA[K]

STEP 2. REPEAT FOR J=K TO N-1

SET LA[J]:- LA[J+1]

STEP 3. SET N:= N-1

STEP 4. EXIT

CODE:-

#include <stdio.h>
#include <conio.h>
int main() {
    int i, n, arr[20], k;
    printf("Enter the size of the array: ");
    scanf("%d", &n);
    for (i = 0; i < n; i++)
     {
        printf("Enter array element: ");
        scanf("%d", &arr[i]);
    }
    printf("Array entered: ");
    for (i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    printf("\nEnter the position to delete (1-based index): ");
    scanf("%d", &k);
    if (k <= 0 || k > n) {
        printf("Entered wrong position.\n");
    } else 
    {
      for (i = k - 1; i < n - 1; i++) {
            arr[i] = arr[i + 1];
        }
        n--; 
        printf("Array after deletion: ");
        for (i = 0; i < n; i++) {
            printf("%d ", arr[i]);
        }
        printf("\n");
    }
    getch();
    return 0;
}

BUBBLE SORT:-

ALGORITHM:-

STEP 1. REPEAT STEP 2 & 3 FOR K=1 TO N-1

STEP 2. SET PTR:= 1

STEP 3. REPEAT WHILE PTR <= N-K

A) IF DATA [PTR]>DATA[PTR+1] THEN INTERCHANGE DATA[PTR] & DATA[PTR+1]

B) SET PTR:= PTR+1

STEP 4. EXIT

CODE:-

#include<stdio.h>
#include<conio.h>
int main()
{
    int i,j,n,arr[20],temp;
    int flag;
    clrscr();
    printf("Enter the size of array : ");
    scanf("%d",&n);
    printf("\n");
    for(i=0; i<n; i++)
    {
    printf("enter array element : ");
    scanf("%d",&arr[i]);
    }
    printf("\nUnsorted Array : ");
    for(i=0; i<n; i++)
    {
    printf ("%d   ",arr[i]);
    }

    for(i=0;i<n-1;i++)
    {   flag=0;
    for(j=0;j<n-1;j++)
    {
        if(arr[j]>=arr[j+1])
        {
        temp = arr[j];
        arr[j] = arr[j+1];
        arr[j+1] = temp;
        flag=1;
        }
    }
    if(flag==0)
    {
        break;
    }
    }

    printf("\n\nHere's the sorted Array : ");
    for(i=0;i<n;i++)
    {
    printf("%d   ",arr[i]);
    }
    printf("\n");
    getch();
    return 0;

}

SELECTION SORT

ALGORITHM:-

STEP 1. REPEAT STEP 2 & 3 FOR K=1,2...N-1

STEP 2. MIN(A,K,N,LOC)

STEP 3. SET TEMP:=A[K],A[K]:=A[LOC] AND A[LOC];=TEMP

STEP 4. EXIT

CODE:-

#include<stdio.h>

#include<conio.h>

int main()

{

int i,j,n,arr[20],min=0,temp=0;

clrscr();

printf("Enter the size of array : ");

scanf("%d",&n);

printf("\n");

for(i=0; i<n; i++)

{

printf("enter array element : ");

scanf("%d",&arr[i]);

}

printf("\nThe Unsorted array you entered : \n");

for(i=0; i<n; i++)

{

printf("%d ",arr[i]);

}

printf("\n");

for(i=0;i<n-1;i++)

{

min=i;

for(j=i+1;j<n;j++)

{

if(arr[j]<arr[min])

{

min=j;

}

temp=arr[i];

arr[i]=arr[min];

arr[min]=temp;

}

printf("\nThe Sorted array we got using Selection sort : \n");

for(i=0;i<n;i++)

{

printf("%d ",arr[i]);

}

getch();

return 0;

}

MERGE SORT:-

ALGORITHM:-

STEP 1. SET L:=1

STEP 2. REPEAT STEP 3 TO 6 WHILE L<N;

STEP 3. CALL MERGEPASS (A,N,L,B)

STEP 4. CALL MERGEPASS(B,N,2*L,A)

STEP 5. SET L:=4*L

STEP 6. EXIT

CODE:-

#include<stdio.h>

#include<conio.h>

int main()

{

int i,j,n1,n2,a1[20],a2[20],m[20];

clrscr();

printf("enter size of first array : ");

scanf("%d",&n1);

printf("\n");

for(i=0;i<n1;i++)

{

printf("enter array element : ");

scanf("%d",&a1[i]);

}

printf("\n");

printf("enter size of second array : ");

scanf("%d",&n2);

printf("\n");

for(i=0;i<n2;i++)

{

printf("enter array element : ");

scanf("%d",&a2[i]);

}

printf("\n\n the first array : ");

for(i=0;i<n1;i++)

{

printf("%d ",a1[i]);

}

printf("\n\n the second array : ");

for(i=0;i<n2;i++)

{

printf("%d ",a2[i]);

}

for(i=0;i<n1;i++)

{

m[i]=a1[i];

}

for(i=n1;i<n1+n2;i++)

{

m[i]=a2[i-n1];

}

printf("\n\n merged array : ");

for(j=0;j<n1+n2;j++)

{

printf("%d ",m[j]);

}

getch();

return 0;

}

BINARY SEARCH:-

ALGORITHM:-

STEP 1. SET BEG:=LB,END:=UB AND MID =INT(BEG+END)/2)

STEP 2. REPEAT STEP 3 & 4 WHILE BEG<=END AND DATA[MID] is not equal to ITEM

STEP 3. IF ITEM <DATA[MID],THEN

SET END:=MID-1

ELSE

SET BEG:=MID+1

STEP 4. SET MID:= INT(BEG+END)/2

STEP 5. IF DATA [MID] =ITEM, THEN

SET LOC;=MID

ELSE

SET LOC:=NULL

STEP 6. EXIT

CODE:-

MERGING AND SORTING:-

CODE:-

#include<stdio.h>

#include<conio.h>

int main()

{

int i, j, n1, n2, k, a1[20], a2[20], m[20];

clrscr();

printf("enter size of first array : ");

scanf("%d", &n1);

printf("\n");

for (i=0; i<n1; i++)

{

printf("enter array element :");

scanf( "%d", &a1[i] );

}

printf("\n");

printf("enter size of second array :");

scanf( "%d", &n2 );

printf("\n");

for(j=0; j<n2; j++)

{

printf("enter array element :");

scanf( "%d", &a2[j] );

}

printf("\n\n The first array :");

for(i=0; i<n1; i++)

{

printf("%d ", &a1[i]);

}

printf("\n\n The Second array :");

for(j=0; j<n2; j++)

{

printf("%d ", &a2[j]);

}

k=0;

i=0; j=0;

while(i<n1 && j<n2)

{

if(a1[i]<a2[j])

{

m[k++] = a1[i++];

}

else

{

m[k++] = a2[j++];

}

while(i<n1)

m[k++] = a1[i++];

while(j<n2)

m[k++] = a2[j++];

printf("\n\n Array after merging and sorting :");

for(i=0; i<n1+n2; i++)

{

printf("%d ",m[i]);

}

getch();

return 0;

}

Madhav Kaushik as a Cyber security consultant

noreply@blogger.com (HACKTECH) — Thu, 7 Oct 2021 07:05:00 -0700

visit my blog to see full content and its a humble request to follow the blog so you can get the latest postings which are going to be uploaded soon on the blog.

hacktech3551

click on above link for the blog.

Thanks for visiting.

MADHAV KAUSHIK- LEARN ETHICAL HACKING (FULL COURCE)

noreply@blogger.com (HACKTECH) — Sun, 28 Feb 2021 00:17:00 -0800

HELLO EVERYONE MY SELF MADHAV KAUSHIK.

TODAY I HAVE CROSSED THE VIEW LIST OF 1.5 MILLION PEOPLE. THANKS FOR VISITING MY BLOG.

I AM COMING WITH AN ETHICAL HACKING COURCE FOR YOU, FOR BEGINNERS LEVEL ITS FREE BBUT FOR HIGHER LEVEL YOU HAVE TO PAY A LITTLE AMOUNT OF RS 150/ YEAR.

HERE YOU CAN EARN DIFFERENT KIND OF HACKS SUCH AS HACKING OF A PC. MOBILE, ROUTERS AND GAMES.

THIS BLOG IS FOR EDUCATIONAL PURPOSE. PLS LEARN YOUR HACKING ON YOUR OWN DEVICES. HACK SOMONES DEVICES WITHOUT TAKING PERMISSION IS ILLEGAL. WE DIDN'T SUPPORT ANY KIND OF ILLEGAL HACKING.

Blog link:- www.ethicalhacking998.blogspot.com

Places where you can feel rich and enjoy a luxurious lifestyle

noreply@blogger.com (HACKTECH) — Mon, 25 Jan 2021 01:36:00 -0800

1.Zimbabwe : 1 INR = 5.85 ZWD

1.00 INR is equal to 5.85 Zimbabwe dollars, making this a pretty cheap getaway, in terms of immediate gratification. The stay might not be cheap, but that is offset by the fact that food and generally everything else is unimaginably low priced. This is due to their 1000% inflation rate in recent times. Yes... one thousand percent inflation! The US dollar has been adopted as their official currency since 2010 but the exchange rate above gives us an idea of their hyperinflation situation.

2.Pakistan : 1 INR = 1.58 Pakistani Rupee

Combine that currency difference with the fact that it is supported by the US dollar and you're in dreamland, at least in terms of food, petrol and things like snickers dark, which cost a bomb here. Real estate is also very affordable here.

3.Nepal

Nestled amidst the mighty Himalayas, Nepal is a beautiful country of snow peaks and streams, yaks and yetis, monasteries and magic. Nepal offers the calm and serene atmosphere for anyone who wants to take a break from the hustle and bustle of the city life, and for the adventure junkies it is the perfect location to experience an adrenaline rush – and all without burning a hole in the pocket. It is one of the cheapest countries to visit from India!

4.Vietnam

Vietnam, a country with nothing but ample natural beauty, rich history and unique heritage is nothing short of paradise. The must visit place for backpackers all around the world, this is one of the most cheap countries to travel from India.

5.Laos

The Southeast Asian country known for its mountainous terrain, Buddhist monasteries, and the beautiful French architecture can be your next destination if you want to travel to a cheap country from India!

6.Malaysia

One of the most popular tourist destinations for Indians especially for its budget-friendliness, Malaysia has a lot to offer. From pristine scenarios to the pleasant climate and marvelous beaches – you are never going to get bored in here.

7.Seychelles

Seychelles is an archipelago of 115 islands in the Indian Ocean, off East Africa. Famous for the beautiful beaches, natural beauty, and coral reef, it is an abode for anyone who wants to travel to the cheapest countries to visit from India.

8.Cambodia

Has watching a sunrise at the Angkor Wat always been at the top of your bucket list? Your dream can easily come true, given that 1 INR equals 61.57 Riel! Yes folks, Cambodia is actually one of the best places to visit where the Indian currency value is higher. Rent a bicycle and spend a few days taking the time to explore the glorious Khmer ruins at Angkor Wat. Visit Siem Reap and party it up in this vibrant city. The Siem Reap night market is a great place for a good bargain. Unwind on the sandy beaches of Sihanoukville, a 4–5 hour bus ride from Phnom Penh.

9.Paraguay

The Paraguayan Guarani is about 85.75 to 1 INR, which means immersing yourself in Guarani culture, soccer, and yummy South American food is quite inexpensive. The capital city of Asuncion is a mix of old world charm, historical buildings, and modern restaurants and bars. Visit the Palacio de los Lopez at dusk when the lights come on, and catch a show at the Teatro Municipal. Take a trip to Encarnacion, Paraguay’s “Capital de Carnaval”, 370 km from Asuncion. The attractive city’s river beach is a huge draw, making it a perfect getaway to unwind in. Encarnacion is also the base for visiting the famous Jesuit reducciones of Trinidad and Jesus, a UNESCO world heritage site. Flights to Paraguay from India are upwards of INR.1,00,000 but you may be able to land a cheaper deal if you book well in advance.

10. Indonesiya

Where else will you find a perfect mix of sandy beaches, lush paddy fields, mysterious temples with scintillating architecture, rejuvenating massages that make you forget all your worries, the Komodo dragon, active volcanoes that you can climb and world-class water sports facilities, all in one country?

Madhav kaushik

noreply@blogger.com (HACKTECH) — Tue, 17 Dec 2019 02:02:00 -0800

Madhav Kaushik:- I am going to start a new business of clothing.Need your sport🙏

My government certificates

noreply@blogger.com (HACKTECH) — Fri, 28 Dec 2018 03:12:00 -0800

Here are some certificates from Indian government.

Happy diwali

noreply@blogger.com (HACKTECH) — Sat, 24 Nov 2018 06:45:00 -0800

Wishing you all a happy diwali

My new certificates

noreply@blogger.com (HACKTECH) — Fri, 2 Nov 2018 22:56:00 -0700

Guys I have got new certificates see it

noreply@blogger.com (HACKTECH) — Fri, 19 Oct 2018 08:16:00 -0700

I AM A JAGUAR LOVER

too know more

noreply@blogger.com (HACKTECH) — Sat, 29 Sep 2018 09:55:00 -0700

guys visit my other websites.

madhav00.blogspot.com

madhav000.blogspot.com

Ledger

noreply@blogger.com (HACKTECH) — Mon, 6 Aug 2018 09:30:00 -0700

A ledger^[1] is the principal book or computer file for recording and totaling economic transactions measured in terms of a monetary unit of account by account type, with debits and credits in separate columns and a beginning monetary balance and ending monetary balance for each account.

A ledger can have the following two formats.

Physical ledgerEdit

This type of ledger is made up of paper. It can be physically touched. It was very common in the early years for business transactions as the digital ledgers were not fully developed.

Digital ledgerEdit

This type of ledger is based on digital medium.

Definition of ledger

1: a book containing accounts to which debits and credits are posted from books of original entry

The ledger is a permanent summary of all amounts entered in supporting journalswhich list individual transactions by date. Every transaction flows from a journal to one or more ledgers. A company's financial statements are generated from summary totals in the ledgers.

Page

noreply@blogger.com (HACKTECH) — Fri, 20 Jul 2018 09:35:00 -0700

https://www.blogger.com/blogger.g?blogID=7524278684745741726#editor/target=page;pageID=709384160885836920;onPublishedMenu=pages;onClosedMenu=pages;postNum=0;src=pagename