Fibonnaci Sequence of a given number (Assembly Language)

; Program to compute fibonnaci sequence of a given number DATA SEGMENT ;INITIALIZE DATA SEGMENT COUNT DW 0AH ;INITIALIZE COUNT TO 0AH ANY DATA RES DB 10 DUP(?) ;INITIALIZE RESULT DATA ENDS ;END OF DATA SEGMENT CODE SEGMENT ;INTIALIZE CODE SEGMENT START: ;START THE CODE ASSUME CS:CODE,DS:DATA ;ASSUMPTION OF CODE AND DATA MOV AX,DATA ;MOVE DATA INTO THE ACCUMULATOR AX REGISTER MOV DS,AX ;MOVE AX … Continue reading Fibonnaci Sequence of a given number (Assembly Language)

Compute 2x (Assembly Language)

; Program to compute 2x DATA SEGMENT ;INITIALIZE DATA SEGMENT NUM1 DD 0.5 ;INTIALIZE NUM AS 0.5H ;NOTE IN EXAM DONT INITIALIZE NUM1 MORE THAN 0.9 ;RANGE SHOULD BE 0.1-0.9H ONLY ;REASON BECAUSE THE COMMAND F2XM1 WHERE ;X SHOULD BE SPECIFIED WITHING 0 > X < 1 RES DD ? ;INITIALIZE RES DATA ENDS ;END OF DATA SEGMENT CODE SEGMENT ;INITIALIZE CODE SEGMENT START: ;START … Continue reading Compute 2x (Assembly Language)

Internet Checksum (Java)

Problem Definition: Write a program in Java to calculate the Internet Checksum and verify it at the Sender’s & Receiver’s side. import java.util.Scanner; class Checksum{ public static void main(String args[]){ Scanner sc = new Scanner(System.in); System.out.println(“**********SENDER**********”); System.out.print(“Enter the word: “); String input = sc.nextLine(); //Calculation of hex string String hex[]; if(input.length()%2 == 0){ //Even length input hex = new String[input.length()/2]; for(int i=0;i<hex.length;i++) hex[i] = Integer.toHexString(input.charAt(2*i))+Integer.toHexString(input.charAt(2*i+1)); }else{//odd … Continue reading Internet Checksum (Java)

Hamming Code (Java)

Problem Definition: Write a program in Java to compute the Hamming Code and detect & correct the error. import java.util.*; class DanHamming { public static void main(String arg[]) { Scanner sc=new Scanner(System.in); System.out.println(“Enter the 7-bit data code”); int d[]=new int[7]; for(int i=0;i<7;i++) { d[i]=sc.nextInt(); } int p[]=new int[4]; p[0]=d[0]^d[1]^d[3]^d[4]^d[6]; p[1]=d[0]^d[2]^d[3]^d[5]^d[6]; p[2]=d[1]^d[2]^d[3]; p[3]=d[4]^d[5]^d[6]; int c[]=new int[11]; System.out.println(“Complete Code Word is “); c[0]=p[0]; c[1]=p[1]; c[2]=d[0]; c[3]=p[2]; c[4]=d[1]; c[5]=d[2]; … Continue reading Hamming Code (Java)