Posts

Showing posts from July, 2016

To perform uninformed search using DFS Traversal > Python Program

To perform uninformed search using DFS Traversal > Python Program Artificial Intelligence Program: graph={'A':['B','C'],'B':['A','D','E'],'C':['A','E'],'D':['B','E'],'E':['D','B','C']}

To perform uninformed search using BFS Traversal > Python Program

To perform uninformed search using  BFS Traversal > Python Program Artificial Intelligence Program: graph={'A':['B','C'],'B':['A','D','E'],'C':['A','E'],'D':['B','E'],'E':['D','B','C']}

To solve Tower of Hanoi > Python Program

To solve Tower of Hanoi > Python Program Artificial Intelligence Program: #function of tower of hanoi

To find average of 2 Numbers > Python Program

To find average of Numbers > Python Program Artificial Intelligence # Function to make average of 2 nos

To add numbers using function > Python Program

To add numbers using functions > Python Program Artificial Intelligence Program: #function to add two nos

Additive Cipher > Java Program

Additive Cipher > Java Program Cryptography and System Security Program: import java.io.*; public class Adder {

Program demonstrating For loop and Functions > Matlab

Program demonstrating For loop and Functions > Matlab Soft Computing exp1.m clc clear all a=mysq(675); a b=fnew(10)

Extended Euclidean Algorithm for Modular Multiplicative Inverse > C Program

Extended Euclidean Algorithm for Modular Multiplicative Inverse > C Program Cryptography and System Security Program: #include<stdio.h> #include<conio.h> void main() {

Euclidean Algorithm to find GCD > C Program

Euclidean Algorithm to find GCD > C Program  Cryptography and Network Security  Program: #include<stdio.h> #include<conio.h> void main() { int a,b,x; clrscr(); printf("Enter 1st Number "); scanf("%d",&a); printf("Enter 2nd Number "); scanf("%d",&b); x=gcd(a,b); printf("GCD is %d",x); getch(); }