Programs in Computer Engineering

Insertion Sort > Java Program import java.io.DataInputStream; class InsertionSort { public static void main(String args[ ]) { int i,n=0; int x[]=new int[25];

Binary Search Tree > Java Program import java.util.Scanner; class TreeNode { TreeNode left,right; int info; public TreeNode(int data) {

Analysis of Algorithms 8 Queens Problem > Java Program import java.io.*; class operation {

Sorting Quick Sort, Heap Sort, Insertion Sort, Radix Sort, Merge Sort > C Program #include<stdio.h> #include<conio.h> #define MAX 50

Analysis of Algoritm To Perform Binary Search > C Program #include<stdio.h> #include<conio.h> int binarysearch(int arr[],int n,int x); void main() {

Analysis of Algorithm Quick Sort > C Program #include<stdio.h> #include<conio.h> void quick(int a[],int lb,int ub); int partition(int a[],int lb,int ub); void main() {       

Analysis of Algorithm Selection Sort > C Program #include<stdio.h> #include<conio.h> void select(int x[],int n); void main() {

Analysis of Algorithm Fibonacci Series > Java Program import java.util.*;  class Fibonacci  {   public static void main(String args[])throws Exception   {   

Analysis of Algorithm Merge Sort (Non Recursive) > C Program #include<stdio.h> #include<conio.h> void merge(int x[],int lb1,int ub1,int ub2) {

Analysis of Algorithm Merge Sort (Recursive) > C Program #include<stdio.h> #include<conio.h> void merge(int x[],int lb1,int ub1,int ub2) {

Analysis of Algorithm Knapsack Problem > Java Program import java.io.*;  class knapsack  {  public static void main(String args[])throws IOException  { 

Analysis of Algorithm Hamiltonian Cycle > Java Program import java.io.*;  public class Hamiltonian  {  static boolean found = false;  public static void main(String args[]) throws IOException  { 

Analysis of Algorithm Merge Sort > Java Program import java.io.*;   class MergeSort   {   public static void main(String args[ ])   {  

Analysis of Algorithm Kruskal's Algorithm > Java Program import java.io.*;  class kruskal  {  p ublic static void main(String args[])throws IOException  { 

Analysis of Algorithm Prim's Algorithm > Java Program import java.io.*; class prim { public static void main(String args[])throws IOException {

Analysis of Algorithm Graph Coloring > Java Program import java.util.*;  class GraphColoring  {   private int adj[][],x[],m,n;   public GraphColoring()   {   

Analysis of Algorithm To Perform Strassen's Matrix Multiplication > C Program #include<stdio.h> #include<conio.h>     int main() {

To implement NQueen Problem > C Program Analysis of Algorithm, Artificial Intelligence Program: #include<stdio.h> #include<conio.h> #include<stdlib.h> #include<math.h> int *x; int place(int k,int i) {

Analysis of Algorithm Finding Longest Common Sub-sequence > C Program #include<stdio.h> #include<conio.h> #include<string.h> char b[20][20]; int c[20][20]; int m,n; void lcs(char x[],char y[]) {

Analysis of Algorithm All Pair Shortest Path Algorithm > C Program #include<stdio.h> #include<conio.h> int cost[10][10],a[10][10],i,k,j,c; int min(int a,int b) {