All categories

2 years ago

To review a printout of a table before printing, on the ____ tab, click print, and then click print preview.

1 answer:

4 0

To review a printout of a table before printing, on the FILE tab, click print, and then click print preview. By doing this, you can check, evaluate and do some modifications or changes on your files before having a hardcopy or printouts.

You might be interested in

If I was to sort the months of the year in ASCENDING order alphabetically, which

bogdanovich [222]

The answer is C.) April

5 0

3 years ago

Consider the following high-level recursive procedure: long long int flong long int n, long long int k long long int b b k+2; if

Stolb23 [73]

Answer:

f(long long, long long):

push rbp

mov rbp, rsp

push rbx

sub rsp, 40

mov QWORD PTR [rbp-40], rdi

mov QWORD PTR [rbp-48], rsi

mov rax, QWORD PTR [rbp-48]

add rax, 2

mov QWORD PTR [rbp-24], rax

cmp QWORD PTR [rbp-40], 0

jne .L2

mov QWORD PTR [rbp-24], 8

jmp .L3

.L2:

mov rax, QWORD PTR [rbp-40]

lea rdx, [0+rax*4]

mov rax, QWORD PTR [rbp-24]

lea rbx, [rdx+rax]

mov rax, QWORD PTR [rbp-48]

lea rdx, [rax+1]

mov rax, QWORD PTR [rbp-40]

sub rax, 1

mov rsi, rdx

mov rdi, rax

call f(long long, long long)

add rax, rbx

mov QWORD PTR [rbp-24], rax

.L3:

mov rdx, QWORD PTR [rbp-24]

mov rax, QWORD PTR [rbp-48]

add rax, rdx

add rsp, 40

pop rbx

pop rbp

ret

Explanation:

8 0

2 years ago

Write the logical Expression and Draw the Truth table for the <br> following questions

Alja [10]

The logical expressions are

(X NOR Y ) OR Z ⇒ $(\bar X \bar + \bar Y) + Z$
(A NAND B) AND NOT C ⇒ $(\bar A \bar \cdot\bar B) \cdot \bar C$

<h3>How to determine the logical expressions?</h3>

<u>Logical expression 1</u>

X and Y are linked by the NOR gate.

So, we have:

X NOR Y

The X NOR Y is linked to Z by the OR gate.

So, we have:

(X NOR Y) OR Z

Hence, the logical expression is (X NOR Y ) OR Z ⇒ $(\bar X \bar + \bar Y) + Z$

<u>Logical expression 2</u>

A and B are linked by the NAND gate.

So, we have:

A NAND B

The A NAND B is linked to C by the AND gate.

So, we have:

(A NAND B) AND C

Hence, the logical expression is (A NAND B) AND NOT C ⇒ $(\bar A \bar \cdot\bar B) \cdot \bar C$

See attachment for the truth tables

Read more about truth tables at:

brainly.com/question/27989881

#SPJ1

6 0

1 year ago

Given an list of N integers, Insertion Sort will, for each element in the list starting from the second element: Compare the ele

Elena L [17]

Answer:

def insSort(arr):

ct=0;

for i in range(1, len(arr)):

key = arr[i]

j = i-1

while j >=0 and key < arr[j] :

arr[j+1] = arr[j]

j -= 1

ct=ct+1;

arr[j+1] = key

return arr,ct;

print(insSort([2,1]))

Output of the program is also attached.

8 0

3 years ago

Write a function DrivingCost() with input parameters drivenMiles, milesPerGallon, and dollarsPerGallon, that returns the dollar

posledela

Answer:

#include <iostream>

using namespace std;

double DrivingCost(int drivenMiles,double milesPerGallon,double dollarsPerGallon)

{

double dollarsperMile=dollarsPerGallon/milesPerGallon;//calculating dollarsperMile.

return dollarsperMile*drivenMiles;//returning thr driving cost..

}

int main() {

double ans;

int miles;

cout<<"Enter miles"<<endl;

cin>>miles;

ans=DrivingCost(miles,20.0,3.1599);

cout<<ans<<endl;

return 0;

}

Output:-

Enter miles

1.57995

Enter miles

7.89975

Enter miles

100

15.7995

Explanation:

In the function first I have calculated the dollars per mile and after that I have returned the product of dollarspermile and driven miles.This will give the cost of the Driving.

4 0

2 years ago