Programs in Computer Engineering

Full Adder > Java Program Computer Organization and Architecture import java.util.*; class FULLADDER { public static void main(String args[]) { int a[],b[]; Scanner sc=new Scanner(System.in); System.out.println(“ENTER NUMBER OF BITS : “); int n=sc.nextInt(); a=new int[n]; b=new int[n];

Binary Division using Non Restoring Algorithm Computer Organization and Architecture import java.io.*; class NONRESTORING { public static int[] lshift(int s1[],int s2) { int s[]=new int [4]; for(int i=0;i<3;i++) { s[i]=s1[i+1]; } s[3]=s2; return(s); }

Binary Division using Restoring Algorithm > Java Program Computer Organization and Architecture import java.util.*; class RESTORING { public static void lshift(int a[],int q[]) {

Booth's Algorithm > Java Program Computer Organization and Architecture import java.util.*; class BOOTH { public static int[] add(int a[],int m1[]) { int carry=0; int sum[]=new int [4];

Computer Networks CRC Cyclic Redundancy Check > Java Program import java.util.Scanner; class CRC { public static void main(String args[]) { Scanner sc=new Scanner(System.in); int m,g[],n,d[],z[],r[],msb,i,j,k;

Computer Networks Client Server > Java Program TCPClient.java File import java.io.*; import java.net.*; class TCPClient { public static void main(String argv[]) throws Exception {

Computer Networks Checksum > Java Program import java.io.*; import java.util.*; class checksum { public static void main(String args[]) {

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