3. Write an ALP to arrange given N numbers in ascending order using 8086

Question

Question

4. Write an ALP to find cube of N 8-bit numbers in an array using 8086

engineering Computer-Science

Answer 1

Answer #1

3.ACCENDING OFARRAY

4.CUBE OF ARRAYS

Answer 2

Similar Homework Help Questions

. Write an 8086 assembly language program to find the prime numbers among 100 bytes of...

. Write an 8086 assembly language program to find the prime numbers among 100 bytes of data in an array stored from the address 4000H: 1000H in the data segment and store the result from the address 4000H: 3000H. write the code using 8086 assembly language only i do not want any other language If you Do not sure please do not solve it
Suppose the array begins with 0, followed by the remaining even numbers in ascending order, followed...

Suppose the array begins with 0, followed by the remaining even numbers in ascending order, followed by the odd numbers in descending order. (For n = 8, the array would be [0,2,4,6,8,7,5,3,1].) How many comparisons will insertion sort perform while sorting this array? (Do not assume n = 8.)
C programing Write a program to sort numbers in either descending or ascending order. The program...

C programing Write a program to sort numbers in either descending or ascending order. The program should ask the user to enter positive integer numbers one at a time(hiting the enter key after each one) The last number entered by the user should be -1, to indicate no further numbers will be entered. Store the numbers in an array, and then ask the user how to sort the numbers (either descending or ascending). Call a function void sortnumbers ( int...

Question 23: Write a python code to sort the given set of numbers in ascending order....

Question 23: Write a python code to sort the given set of numbers in ascending order. You must not use any built-in functions of python
Arrange the following functions in ascending order of asymptotic growth rate; that is if function g(n)...

Arrange the following functions in ascending order of asymptotic growth rate; that is if function g(n) immediately follows function f(n) in your list, then it should be the case that f(n) is O(g(n)): 2 Squareroot log n, 2^n, n^4/3, n(log n)^3, n log n, 2 2^n, 2^n^2. Justify your answer.
Write an 8086 assembly language program to find the prime numbers among 100 bytes of data...

Write an 8086 assembly language program to find the prime numbers among 100 bytes of data in an array stored from the address 4000H: 1000H in the data segment and store the result from the address 4000H: 3000H.

Using the concepts of 8086 Answer the following questions in 2 or 3 lines: 1) What...

Using the concepts of 8086 Answer the following questions in 2 or 3 lines: 1) What are the contents of CS and IP registers immediately after the reset of the 8086? 2) WhatistheminimumtimeforwhichtheResetinputmustbeactivatedforproperresetof the 8086? 3) What is the maximum frequency and duty cycle of the clock signal given to the 8086? 4) Which pin of the 8086 is used to synchronize the slowly operating peripherals with the 8086? 5) What is the role of status line S4 and S3...
Arrange the following functions in ascending order of growth rate. That is, if function g(n) immediately...

Arrange the following functions in ascending order of growth rate. That is, if function g(n) immediately follows function f(n) in your list, then it should be the case that f(n) -O(gln) fl (n) = n/i f2 (n)- 3" fs (n)-nIg(n') JA (n)- ()+54 More specifically, match the functions f? through fe to the corresponding positions a through f to illustrate the correct asymptotic order: I Choose ] I Choose ] Choose ] Choose ] I Choose ] I Choose ]
using c++ Write a function that returns true if a given integer array is sorted(in ascending...

using c++ Write a function that returns true if a given integer array is sorted(in ascending order) and false if it is not. The function should perform no more than "size" comparisons. bool isSorted(int A[], int size);

Given two arrays A and B of n integers both of which are sorted in ascending...

Given two arrays A and B of n integers both of which are sorted in ascending order. Write an algorithm to check whether or not A and B have an element in common. Find the worst case number of array element comparisons done by this algorithm as a function of n and its Big-O complexity