In the implementation of queue by using linked chain the performance of the enqueue operation is O(1).We have to maintain two pointers one head and the other tailand for enqueue operation we have to insert element to the next of the tail and then make that element tail.Which takes O(1) time.

4 0

2 years ago

1. Write a function that will ask the user to enter a value in dollars. The function should calculate and display the equivalent

julia-pushkina [17]

Answer:

import java.util.Scanner;

public class Main

{

public static void main(String[] args) {

valueInDollars();

}

public static void valueInDollars() {

double currentMoney, quarters, dimes, nickels, pennies;

Scanner input = new Scanner(System.in);

System.out.print("Enter a value in dollars: ");

currentMoney = input.nextDouble();

currentMoney *= 100;

quarters = (int)currentMoney / 25;

currentMoney = currentMoney % 25;

dimes = (int)currentMoney / 10;

currentMoney = currentMoney % 10;

nickels = (int)currentMoney / 5;

currentMoney = currentMoney % 5;

pennies = currentMoney;

System.out.print("Quarters: " + quarters + "\n" + "Dimes: " + dimes + "\n" + "Nickels: " + nickels + "\n" + "Pennies: " + pennies);

}

Explanation:

Inside the function:

- Declare the variables

- Ask the user for a value in dollars

- Multiply that value by 100

- Find the amount of quarters, dimes, nickels, and pennies

- Print the values

Inside the main:

- Call the function

3 0

3 years ago

Which of the following tasks is least effective at preventing a computer virus A. Anti-virus's software up to date

MaRussiya [10]

C is your answer
hope that helps

4 0

2 years ago

Read 2 more answers

Homework 8 Matlab Write a function called fibonacciMatrix. It should have three inputs, col1, col2, and n. col1 and col2 are ver

Amiraneli [1.4K]

In this exercise we have to use the knowledge in computational language in python to write the following code:

We have the code can be found in the attached image.

So in an easier way we have that the code is:

function v = myfib(n,v)

if nargin==1

v = myfib(n-1,[0,1]);

elseif n>1

v = myfib(n-1,[v,v(end-1)+v(end)]);

end

function v = myfib(n,v)

if nargin==1

v = myfib(n-1,[0,1]);

elseif n>1

v = myfib(n-1,[v,v(end-1)+v(end)]);

elseif n<1

v = 0;

end

function [n] = abcd(x)

if (x == 1 || x==0)

n = x;

return

else

n = abcd(x-1) + abcd(x-2);

end

fibonacci = [0 1];

for i = 1:n-2

fibonacci = [fibonacci fibonacci(end)+fibonacci(end-1)];

end

>> myfib(8)

ans =

0 1 1 2 3 5 8 13

>> myfib(10)

ans =

0 1 1 2 3 5 8 13 21 34

See more about python at brainly.com/question/18502436

8 0

1 year ago