All categories

3 years ago

In a linked chain implementation of a queue, the performance of the enqueue operation

Computers and Technology

1 answer:

alexdok [17]3 years ago

4 0

Answer:

A.O(1)

Explanation:

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.

You might be interested in

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

Guys im getting the ps5 tomorrow :)

Paha777 [63]

Answer:

lucky mf

Explanation:

5 0

2 years ago

Read 2 more answers

The machine should not be oiled until the

kicyunya [14]

The machine should not be oiled until the recommended time between oilings is up.

6 0

3 years ago

What subsection of the Internet requires specialized browser to access and is frequently used by cyber criminals and underground

kotykmax [81]

Answer:

c. Dark Web

Explanation:

Surface web is also called visible web is a part of world wide web that can be easily searchable using search engines as its contents are indexed by the search engines such as Google and its contents are accessible by public using standard web browsers. So a is not a suitable choice.

Deep Web is called invisible web as it is not accessible or searchable to standard search engines like Google. Search engines cannot index the contents of these sites. However such sites do not requires specialized browsers to access. So b is not a suitable choice.

Dark Web: It is a part of Deep Web sites but it requires specialized software and browsers to access. These sites cannot be indexed and cannot be searchable through standard search engines. This is also called dark side of the world wide web darker which is frequently used by criminals, hackers, black markets, hit-men. Illegal activities on a massive level is takes place in the dark web such as access to stolen sensitive information, malware, drug trade and terrorist operations. These sites are temporary and keep changing addresses to lessen the risk of getting caught by govt agencies or security officials. So c is the suitable choice.

Crypto-Net is a kind of neural network which works with encrypted data which can make a prediction based on the data without disclosing the data and prediction to the 3rd party. So d is not a suitable option.

6 0

3 years ago

Write a complete Java program called Rooter that gets a positive integer called "start" from the user at the command line and th

Nataly_w [17]

Answer:

The program in Java is as follows:

import java.util.*;

import java.lang.Math;

public class Rooter{

public static void main(String[] args) {

Scanner input = new Scanner(System.in);

int start;

System.out.print("Start: ");

start = input.nextInt();

while(start<=0){

System.out.print("Number must be positive\nStart: ");

start = input.nextInt(); }

while(start>=0){

System.out.println(Math.sqrt(start));

start--; }

}

Explanation:

This declares start as integer

int start;

This prompts the user for input

System.out.print("Start: ");

This gets input for start

start = input.nextInt();

The following is repeated until the user input is valid i.e. positive

while(start<=0){

System.out.print("Number must be positive\nStart: ");

start = input.nextInt(); }

The following while loop prints the square root of each number till 0

while(start>=0){

System.out.println(Math.sqrt(start));

start--; }

4 0

2 years ago