Data Analysis and Algorithm
File
Submitted By :- Aditya Aurnab
Dawn
Course:- Bachelor of Technology
(Computer Science
Engineering)
ERP NO. :- 22/2411
Year:- 3rd year (5th Semester)
Submitted To:-Mr Amit
Singh
Java Code File
Submitted By :- Aditya Aurnab
Dawn
Course:- Bachelor of Technology
(Computer Science
Engineering)
ERP NO. :- 22/2411
Year:- 3rd year (5th Semester)
Submitted To:-Mr Sandeep
Singh
S. No. Program Date Signatu
re
1. Write a program for iterative and
recursive binary search.
2. Write a program to sort a given set of
elements using the quick sort/merge
sort/ selection sort method and
determine the time required to sort
the elements.
3. Write a program for implementation
of fractional knapsack problem using
greedy method and 0/1 knapsack
problem using dynamic
programming.
4. Write a program to find the shortest
path from a given vertex to other
vertices in a weighted connected
graph using Dijkstra’s algorithm.
5. Write a program to find the minimum
cost spanning tree (MST) of a given
undirected graph using kruskal’s/
prim’s algorithms.
6. Write a program to implement N-
Queens problem using back tracking.
7. Write a program to check whether a
given graph is connected or not
using DFS method.
8. Write a program to implement the
Travelling Salesman Problem (TSP).
S. Programs Date Signature
No.
1. Create a java program to
implement stack and queue
concept.
2. Write a java package to show
dynamic polymorphism and
interfaces.
3. Write a java program to show
multithread producer and
consumer application
4. Create a customized exception
and also make use of all the 5
exception keywords.
5. Convert the content of a given
file into the upper case
content of the same file.
6. Develop an analog clock using
applet.
7. Develop a scientific calculator
using swings
8. Create an editor like MS- word
using swings.
9. Create a servlet that uses
cookies to store the number of
times a user has visited your
servlet.
10. Create a simple java bean
having bound and constrained
properties.
S.N Program Date Signature
o.
1. Write Assembly language program to
add too hexadecimal number 12H and
7AH. Store sum to memory location
C000H
2. Write a ALP to add the content of
memory location C000H with the
content of memory location D000H and
store the 8 bit result in E000H
3. Write an ALP to add the content of
memory location C000H with the
content of memory location C001H and
store the 8 bit result in C002H.
4. Write an ALP to add two 16 bit number
the first number stored at C030H and
C031H and the second number stored
at C032H and C033H store 16 bit result
at memory location C034H and C035H.
5. Write an ALP to find 1’s complement of
8 bit number stored in memory location
C000H, store result at memory location
C001H.
6. Write an ALP to find 2’s complement of
8 bit number stored in memory location
C001H.
7. Write an ALP to find 1’s complement of
16 bit number stored at memory
location C000H and C001H and store
result at memory location C002H and
C003H
8. A hexadecimal number is stored at
location AB00H. Write an ALP to
interchange its digits and the new
number is to be stored at AB01H. Add
original number with new number and
store result at location ABCDH.
9. Write n ALP to separate Nibble of a
number stored at memory location
2000H and store result at 2001H.
10. Calculate physical address for following
instruction DS=1000H SS=7000H
ES=4000H BP=0100H SI=0020H
DI=0200H BX=0700H value
displacement=0500H
(i) MOV AX,[BX][SI]
(ii) ADD AL,[BP+40H]
(iii) MOV CX, values[BP]
(iv) MOV ES:[1000H],20H