Blog Feed: MU | IT | ENGINEERS

Kolmogorov-Smirnov Test

Published on 2011-11-27 06:33:00

RANDOM NUMBER GENERATION Test for Random Numbers Testing for UniformityRefer : Kolmogorov-Smirnov Goodness-of-Fit Test for more detail explanation.Q) Write a program for implementation of Testing for Uniformity in Kolmogorov-Smirnov Test using C++ .ANS. /* Program for Kolmogorov-Smirnov Test */ #include #include void main() { clrscr(); int n,i; float r[100]; float cvalue,d,dplus,dminus,tplus,tminus; dplus=0; dminus=0; coutcvalue; coutn; for(i=0;i>r[i]; [..] > read more

Runs Up and Runs Down

Published on 2011-11-27 06:18:00

RANDOM NUMBER GENERATION Test for Random Numbers Testing for IndependenceRuns Up and Runs DownQ) Write a program for implementation of Testing for Independence in Runs Up and Runs Down using C++ .ANS. /* Program for Runs Up and Runs Down */ #include #include int main() { float N[10]; int n, count=0,1; int c[10]; float mean , variance, variancesq, z0, za, z; couta; coutza; coutn; cout > read more

Stack Using Array Implementation In Java

Published on 2011-02-28 12:41:00

Stack Using Array Implementation In Javaimport java.io.*; class stk { int st[]; int max; int top; stk(int n) { max=n; st=new int[n]; top=-1; } void push(int a) { int b; b=a; if(top==max-1) { System.out.println("tt*****stack is overflow!!!!!******n > read more

Stack Using Array Implementation In Java

Published on 2011-02-28 12:41:00

Stack Using Array Implementation In Javaimport java.io.*; class stk { int st[]; int max; int top; stk(int n) { max=n; st=new int[n]; top=-1; } void push(int a) { int b; b=a; if(top==max-1) { System.out.println("tt*****stack is overflow!!!!!******n > read more

Selection Sort Implementation In JAVA

Published on 2011-02-28 12:39:00

Selection Sort Implementation In JAVASorting Techniquesimport java.io.DataInputStream; class SelectionSortImpl { private static void swap(int data[], int left, int right) { int temp = data[left > read more

Selection Sort Implementation In JAVA

Published on 2011-02-28 12:39:00

Selection Sort Implementation In JAVASorting Techniquesimport java.io.DataInputStream; class SelectionSortImpl { private static void swap(int data[], int left, int right) { int temp = data[left > read more

Radix Sort Implementation In Java

Published on 2011-02-28 12:36:00

Radix Sort Implementation In Java Sorting Techniques import java.io.*; class node1 { int data; node1 next; &nb > read more

Radix Sort Implementation In Java

Published on 2011-02-28 12:36:00

Radix Sort Implementation In Java Sorting Techniques import java.io.*; class node1 { int data; node1 next; &nb > read more

Quick SOrt Recursive Implementation In Java

Published on 2011-02-28 12:34:00

Quick Sort Recursive Implementation In Java Sorting Techniquesimport java.io.*; class QuickSortImple { static void swap(int data[], int left, int right) { int temp = data[left]; data[left] = data[right]; data[right] = temp; } private stati > read more

Quick SOrt Recursive Implementation In Java

Published on 2011-02-28 12:34:00

Quick Sort Recursive Implementation In Java Sorting Techniquesimport java.io.*; class QuickSortImple { static void swap(int data[], int left, int right) { int temp = data[left]; data[left] = data[right]; data[right] = temp; } private stati > read more

Quick Sort Implementation In Java

Published on 2011-02-28 12:32:00

Quick Sort Implementation In JavaSorting Techniquesimport java.io.*; class quick { public static int a[]; public static void main(String args[]) throws IOException { int a[],n; BufferedReader b=new Buffere > read more

Quick Sort Implementation In Java

Published on 2011-02-28 12:32:00

Quick Sort Implementation In JavaSorting Techniquesimport java.io.*; class quick { public static int a[]; public static void main(String args[]) throws IOException { int a[],n; BufferedReader b=new Buffere > read more

Queue Using Array Implementation In JAVA

Published on 2011-02-28 12:29:00

Queue Using Array Implementation In JAVAimport java.io.*; class queue { int q[]; int front; int rear; int temp; int max; queue(int n) { max=n; q=new int[max]; front=0; rear=-1; } void push(int a) { int b; b=a; if(rear>=max-1) { System.out.pr > read more

Queue Using Array Implementation In JAVA

Published on 2011-02-28 12:29:00

Queue Using Array Implementation In JAVAimport java.io.*; class queue { int q[]; int front; int rear; int temp; int max; queue(int n) { max=n; q=new int[max]; front=0; rear=-1; } void push(int a) { int b; b=a; if(rear>=max-1) { System.out.pr > read more

Queue Implementation In JAVA

Published on 2011-02-28 12:26:00

Queue Implementation In JAVAimport java.io.*; class Queue { int size = 10; int que[]; int rear, front;   > read more

Queue Implementation In JAVA

Published on 2011-02-28 12:26:00

Queue Implementation In JAVAimport java.io.*; class Queue { int size = 10; int que[]; int rear, front;   > read more

Prims Algorithms Implementation In Java

Published on 2011-02-28 12:23:00

Prims Algorithms Implementation In JavaMINIMUM COST SPANNING TREEimport java.io.*; import java.util.*; class Graph { int weight[][]=new int[20][20]; int visited[]=new int [20]; int d[]=new > read more

Prims Algorithms Implementation In Java

Published on 2011-02-28 12:23:00

Prims Algorithms Implementation In JavaMINIMUM COST SPANNING TREEimport java.io.*; import java.util.*; class Graph { int weight[][]=new int[20][20]; int visited[]=new int [20]; int d[]=new > read more

Merge Recursive Sort Implementation In Java

Published on 2011-02-28 12:19:00

Merge Recursive Sort Implementation In JavaSorting Techniques import java.io.*; class MergeSort { private static void merge(int data[], int temp[], int low, int middle,int high) { &n > read more

Merge Recursive Sort Implementation In Java

Published on 2011-02-28 12:19:00

Merge Recursive Sort Implementation In JavaSorting Techniques import java.io.*; class MergeSort { private static void merge(int data[], int temp[], int low, int middle,int high) { &n > read more

Merge Sort Implementation In Java

Published on 2011-02-28 12:15:00

Merge Sort Implementation In JavaSorting Techniquesimport java.io.*; class merge { public static int a[]; public static void main(String args[]) throws IOException { int n; BufferedReader b=new BufferedR > read more

Merge Sort Implementation In Java

Published on 2011-02-28 12:15:00

Merge Sort Implementation In JavaSorting Techniquesimport java.io.*; class merge { public static int a[]; public static void main(String args[]) throws IOException { int n; BufferedReader b=new BufferedR > read more