Learn more about our help with Assignments: Programming
Search
Algorithms
Question 2
a) Discuss decision tree applications and generate a model to predict when its
appropriate to play European’s Premier League.
a) Discuss decision tree applications and generate a model to predict when its
appropriate to play European’s Premier League.
C++
Write a program using two dimensional arrays that searches a number and display the number of times it occurs on the list of 12 input values.
Algorithms
onsider the below algorithm:
for (i=1;i < n;i++)
for (j=1;j < m;j++){
Alloc[i][j]=(2*(i+1)%7)+j%i
}
For n=13 and m=6 answer the following questions
What value Alloc[2][4] will store?
for (i=1;i < n;i++)
for (j=1;j < m;j++){
Alloc[i][j]=(2*(i+1)%7)+j%i
}
For n=13 and m=6 answer the following questions
What value Alloc[2][4] will store?
Assembler
Show how array data can be located using base-plus-index addressing.
Assembler
Suppose, DS= 1015 H, BX= 1015 H, DI= 15 H, Table= 15H. Then, calculate the
physical address of the source for the following instruction in real mode:
MOV AX, Table[BX+ DI].
physical address of the source for the following instruction in real mode:
MOV AX, Table[BX+ DI].
Using a pointer list, a structure of type node (contains an integer element called data,
and a pointer to a structure of type node called next_node), which has been initialized
to the address of node1, write C statements which will cycle through the list and print
out the value of each nodes data field.
and a pointer to a structure of type node called next_node), which has been initialized
to the address of node1, write C statements which will cycle through the list and print
out the value of each nodes data field.
Algorithms
Let, AAA={34,12,56,22,43,60}
Apply bubble sort operation in AAA and show each step’s result for each pass value in
a table.
Apply bubble sort operation in AAA and show each step’s result for each pass value in
a table.
Algorithms
Search the Value 125 from the following array using Binary Search algorithm. Show
the values of BEG, END and MID at each step.
11 22 30 33 40 44 55 60 66 77 80 88 99 125 150 200
the values of BEG, END and MID at each step.
11 22 30 33 40 44 55 60 66 77 80 88 99 125 150 200
Algorithms
Consider a 420 x 680 matrix array SCORE. Suppose Base (SCORE) = 1001 and there
are 2 words per memory cell. Assume that the first element of the array is SCORE
[1,1]. Find the address of SCORE [100, 260] when the array is stored in
i. row major order
ii. column major order.
are 2 words per memory cell. Assume that the first element of the array is SCORE
[1,1]. Find the address of SCORE [100, 260] when the array is stored in
i. row major order
ii. column major order.
Algorithms
Consider the linear array BBB[100] where lower bound is -10.
Suppose Base (BBB) = 300 and w = 4 words per memory cell for BBB. Find the
address of BBB [-10], BBB [0] and BBB [15].
Suppose Base (BBB) = 300 and w = 4 words per memory cell for BBB. Find the
address of BBB [-10], BBB [0] and BBB [15].
