INDEX SL.N O
DATE
NAME OF THE EXPERIMENT
1.
15-7-09
8-BIT ADDITION
2.
15-7-09
16-BIT ADDITION
3.
15-7-09
32-BIT ADDITION
4.
15-7-09
8-BIT SUBTRACTION
5.
15-7-09
16-BIT SUBTRACTION
6.
15-7-09
32-BIT SUBTRACTION
7.
22-7-09
8-BIT MULTIPLICATION
8.
22-7-09
16-BIT MULTIPLICATION
9.
22-7-09
8-BIT DIVISION
10.
22-7-09
16-BIT DIVISION
11.
29-7-09
MULTIBYTE ADDITION (1 ARRAY)
12.
29-7-09
MULTIBYTE ADDITION (2 ARRAYS)
13.
29-7-09
MULTIBYTE ADDITION (3 ARRAYS)
14.
29-7-09
MULTIBYTE SUBTRACTION (1 ARRAY)
15.
29-7-09
MULTIBYTE SUBTRACTION (2 ARRAYS)
16.
29-7-09
MULTIBYTE SUBTRACTION (3 ARRAYS)
17.
5-8-09
SORTING THE DATA ASCENDING ORDER
18.
5-8-09
SORTING THE DATA DESCENDING ORDER
19.
5-8-09
TO FIND LARGEST NUMBER
20.
5-8-09
TO FIND SMALLEST NUMBER
21.
5-8-09
MOVE A BLOCK OF DATA FROM ONE MEMORY LOCATION TO ANOTHER
22.
12-8-09
VERIFY NUMBER IS ODD/EVEN
SWAMI VIVEKANANDA INSTITUTE OF TECHNOLOGY
Pg. NO.
REMARKS
INDEX PARITY 23.
12-8-09
VERIFY NUMBER IS POSITIVE/NEGATIVE
24.
12-8-09
AVERAGE OF NUMBERS IN AN ARRAY
25.
26-8-09
8-BIT BCD PACKED ADDITION
26.
26-8-09
8-BIT BCD PACKED SUBTRACTION
27.
26-8-09
16-BIT BCD PACKED ADDITION
28.
26-8-09
16-BIT BCD PACKED SUBTRACTION
29.
26-8-09
8-BIT BCD UNPACKED ADDITION
30.
26-8-09
8-BIT BCD UNPACKED SUBTRACTION
31.
26-8-09
16-BIT BCD UNPACKED ADDITION
32.
26-8-09
16-BIT BCD UNPACKED SUBTRACTION
33.
2-9-09
CONVERT PACKED BCD TO UNPACKED BCD
34.
16-9-09
35.
16-9-09
36.
16-9-09
MOVE A BLOCK OF MESSAGE FROM ONE MEMORY LOCATION TO ANOTHER
37.
30-9-09
SORTING A STRING ASCENDING ORDER
38.
30-9-09
SORTING A STRING DESCENDING ORDER
39.
7-10-09
INSERTING A CHARACTER INTO A STRING
40.
7-10-09
DELETING A CHARACTER FROM A STRING
41.
14-10-09
LENGTH OF A STRING
SWAMI VIVEKANANDA INSTITUTE OF TECHNOLOGY
INDEX 42.
14-10-09
REVERSE OF A STRING
43.
14-10-09
VERIFY STRING IS PALINDROME / NOT
44.
21-10-09
FIND GIVEN STRINGS EQUAL / NOT
45.
21-10-09
CHECK GIVEN CHARACTER IS PRESENT IN A GIVEN STRING OR NOT
SWAMI VIVEKANANDA INSTITUTE OF TECHNOLOGY