All categories

4 years ago

Which option will automatically update copied data?

2 answers:

8 0

Hello Jorgeciriza80

Question: Which option will automatically update copied data?

Answer: After copying, click Paste. (A)

Have a wonderful day
-Chris

Damm [24]4 years ago

5 0

Answer:A)After copying, click Paste.

Explanation:

You might be interested in

What are the first and the last physical memory addressesaccessible using

Misha Larkins [42]

Answer

For First physical memory address,we add 00000 in segment values.

For Last physical memory address,we add 0FFFF in segment values.

NOTE-For addition of hexadecimal numbers ,you first have to convert it into binary then add them,after this convert back it in hexadecimal.

a)1000

For First physical memory address, we add 00000 in segment value

We add 0 at the least significant bit while calculating.

10000 +00000 = 10000 (from note)

For Last physical memory address,We add 0 at the least significant bit while calculating.

we add 0FFFF in segment value

10000 +0FFFF =1FFFF (from note)

b)0FFF

For First physical memory address,we add 00000 in segment value

We add 0 at the least significant bit while calculating.

0FFF0 +00000=0FFF0 (from note)

For Last physical memory address,We add 0 at the least significant bit while calculating.

we add 0FFFF in segment value

0FFF0 +0FFFF =1FFEF (from note)

c)0001

For First physical memory address,we add 00000 in segment value

We add 0 at the least significant bit while calculating.

00010 +00000=00010 (from note)

For Last physical memory address,We add 0 at the least significant bit while calculating.

we add 0FFFF in segment value

00010 +0FFFF =1000F (from note)

d) E000

For First physical memory address,we add 00000 in segment value

We add 0 at the least significant bit while calculating.

E0000 +00000=E0000 (from note)

For Last physical memory address,We add 0 at the least significant bit while calculating.

we add 0FFFF in segment value

E0000 +0FFFF =EFFFF (from note)

e) 1002

For First physical memory address,we add 00000 in segment value

We add 0 at the least significant bit while calculating.

10020 +00000=10020 (from note)

For Last physical memory address,We add 0 at the least significant bit while calculating.

we add 0FFFF in segment value

10020 +0FFFF =2001F (from note)

6 0

3 years ago

Most file managers include a way to create a folder through the save dialog box. true or false?

Illusion [34]

Answer:

false because most of the file managers just keep Everything organized by dates, years, and everything like that

Explanation:

5 0

3 years ago

Write an assembly language program with a loop and indexed addressing that calculates the sum of all the gaps between successive

PSYCHO15rus [73]

Answer:

Description: Write a MASM 32bit program with a loop and indexed addressing that calculates the sum of all thegaps between successive array elements. The array elements are doublewords, sequenced in nondecreasing order.

;Include Irvine32.inc file used with link library for 32 bit applications

.386

.model flat,stdcall

.stack 4096

ExitProcess proto,dwExitCode:dword

INCLUDE Irvine32.inc

.data

myArray DWORD 0,2,5,9,10

arrSize = ($-myArray)/TYPE myArray

gapArr DWORD arrSize-1 DUP(?)

sum DWORD ?

.code

main PROC

;Call the procedure

call Clrscr

;Initialize ESI pointer

mov esi, 0

mov ecx, arrSize

dec ecx

L1:

mov eax, myArray[esi+4]

sub eax, myArray[esi]

mov gapArr[esi], eax

inc esi

loop L1

;Calculate the sum of gaps between array elements

mov sum, 0

mov esi, 0

mov ecx, arrSize

dec ecx

; move gapArr[esi] to a temporary register and then add that register value to sum

L2:

mov edx, gapArr[esi]

add sum, edx

inc esi

loop L2

INVOKE ExitProcess,0

main ENDP

END main

Explanation:

7 0

3 years ago

For each of the following application areas state whether or not the tree data structure appears to be a good fit for use as a s

Cerrena [4.2K]

Answer:

a) Chess game moves:- Tree data structure is not a good fit.

b) Public transportation paths:- Tree data structure is not a good fit.

c) Relationshi[p among computer files and folders:- Tree data structure is a good fit.

d) Genealogical information:- Tree data structure is a good fit.

e) Parts of books:- Tree data structure is a good fit.

f) Programming language history:- Tree data structure is not a good fit.

g) Mathematical expression:- Tree data structure is a good fit.

Explanation:

a) Chess game moves:- Tree data structure is not a good fit. Since in tree data structure moving backward or sharing the node is not that much easy. Presume, In chess, you have to check any box is empty or not. Here, Graph is the best fit.

b) Public transportation paths:- Tree data structure is not a good fit. whenever shortest path, routes, broadcast come always graph is a good option. Because in the tree you don't know how many time you visit that node

c) Relationshi[p among computer files and folders:- Tree data structure is a good fit. Since they have a predefined route. Go to 'c' drive. Open a particular folder and open a particular file.

d) Genealogical information:- Tree data structure is a good fit. Since genealogical information also has a predefined route. Here, the Graph is not suitable.

e) Parts of books:- Tree data structure is a good fit. Since manages the chapters and topics are not that much complex. You can see any book index which is in a very pretty format.

f) Programming language history:- Tree data structure is not a good fit. To store the history of the programming language we need some unconditional jumps that's why the tree is not suitable.

g) Mathematical expression:- Tree data structure is a good fit. The tree is suitable in some cases. We have an expression tree for postfix, prefix.

5 0

3 years ago

Simpson is trying to solve an equation related to converting a decimal number to its hexadecimal form. He decides to utilize the

Murljashka [212]

Answer:

the answer is A.

6 0

3 years ago