with the aid of examples explain the differences between open source software and licensed software​

Answer:

hope this helps if not srry

Answer:

True

Explanation:

a program is basicly just a list of commands you can run over and over again.

Answer:

please translate

Thank you ✌️

Explanation:

1) the quality of purchased good may be low

2) there might me fraud and cheaters

3) it might be risky

4) we may not get our orders on time

There are many drawbacks of purchasing online, some of them are as follows,

These are some of the drawbacks of purchasing something online.

Learn more: https://brainly.com/question/24504878

Answer:

The answer is below

Explanation:

Causes of ####error in Microsoft Excel can be traced to multiple sources. The major causes of #### error in Microsoft Excel, however, are the following:

1. When the column is not wide enough to show all values or figures of the cell contents.

2. When there are too many decimal places of the figure in a cell

3. When the date value in the cell is negative

4. When the time value in the cell is negative.

Answer: You sort table data with commands that are displayed when you click a header arrow button. Hope it help's :D

Answer:

Explanation:

Threads allow an applications to run faster because they allow various tasks to run at the same time instead of doing one at a time and having to wait for one to finish before starting the next task. However, if too many threads are running at the same time, or a thread has a very large task or requires another task to finish before finishing its own then this can drastically impact performance. Mainly because too many resources are being used at a single moment. The following code is a small example of how threads work in Python.

import threading

import time

def thread_function(name):

   print("Thread {name}: starting")

   time.sleep(2)

   print("Thread {name}: finishing")

thread1 = threading.Thread(target=thread_function, args=(1,))

thread1.start()

time.sleep(1)

thread2 = threading.Thread(target=thread_function, args=(2,))

thread2.start()

thread2.join()

Answer:

C

Explanation:

Answer:

B6A

Explanation:

I think you want to convert binary to hex.

Hexadecimal or "hex" is a numbering system which uses 16 different numerals. We saw that decimal used ten numerals from 0 to 9. Hex expands on this by adding six more, the capital letters A, B, C, D, E and F.

0...1...2...3...4...5...6...7...8...9...A...B...C...D...E...F

Steps to Convert Binary to Hex

1. Start from the least significant bit (LSB) at the right of the binary number and divide it up into groups of 4 digits. (4 digital bits is called a "nibble").

2.Convert each group of 4 binary digits to its equivalent

hex value .

3.Concatenate the results together, giving the total hex number.

Answer:

Answer:

hansnmakqkai8aiaiakqklqlqlqlqlqqqw

Answer:

The function is as follows:

def square_list(myList):

   for i in range(len(myList)):

       myList[i] = myList[i]**2

   print(myList)

Explanation:

This defines the function

def square_list(myList):

This iterates through the list elements

   for i in range(len(myList)):

This squares each list element

       myList[i] = myList[i]**2

This prints the mutated list

   print(myList)

Answer:

ae

Explanation:

The pseudo-code that corresponds to the given assembly code is:

b) if (c < 0)

print (yes);

else

print (maybe);

In assembly code, the command cmp AH, c checks if the high byte of the EAX register (AH) has the same value as the variable c. Then, if the value in AH is more than the value in c, the instruction jg option1 will move to option1.

Therefore, In the pseudo-code, one can check if c is smaller than 0. If it happens, we say "yes". If not, we say "maybe"

Read more about   pseudo-code here:

https://brainly.com/question/24953880

#SPJ2

Answer:

when did it take place..

Answer:

Explanation:

260 cost units, Big O(n) complexity for a push

Answer:

The program in Python is as follows:

myList = []

num = int(input())

count = 0

while num>=0:

   myList.append(num)

   count+=1

   num = int(input())

myList.sort()

mid = int((count-1)/2)

print(myList[mid])

Explanation:

This initializes the list

myList = []

This gets the first input

num = int(input())

This initializes count to 0

count = 0

The following is repeated until the user inputs a negative number

while num>=0:

This appends the input number to the list

   myList.append(num)

This increments count by 1

   count+=1

This gets another input

   num = int(input())

This sorts the list

myList.sort()

Assume the number of inputs is odd, the middle element is calculated as

mid = int((count-1)/2)

This prints the middle element

print(myList[mid])

From the complete question. the condition that ends the loop is a negative integer input

Answer:

please translate

Thank you✌️

Answer:

Hence the answer is Option A Encrypt all communication with TLS 1 3.

Explanation:    

Transportation Layer Security (TLS 1 3)---->TLS stands for Transport Layer Security and is the successor to SSL (Secure Sockets Layer). TLS provides secure communication between web browsers and servers. The connection itself is secure because symmetric cryptography is used to encrypt the transmitted data.  

SNMPv3 Security with 256 bit AES encryption is not available for all devices. The net-snmp agent does not support AES256 with SNMPv3.so it is not the correct option.  

The best choice is an option a because TLS 1 3 because,  

TLS version 1 3 helped in removing all the insecure features such as:  

SHA-1

RC4

DES

3DES

AES-CBC

Answer:

CryptArithmetic or verbal arithmetic is a class of mathematical puzzles in which the digits are replaced by letters of the alphabet or other symbols. Usually it is required that each letter would be replaced by a unique digit. Each letter having different value from the other letters.

Explanation:

Cryptarithm now denotes mathematical problems usually calling for addition, subtraction, multiplication, or division and replacement of the digits by letters of the alphabet or some other symbols. ... Since D × B has only one digit, B must be 3 or less. The only two possibilities are 0 and 2.

Answer:

It assigns the two values in the initialization list to the first two elements and default values to the other elements.

Explanation:

Given

The array initialization

Required

Interpret the statement

double gallons[6] implies that the length/size of the array gallons is 6.

In other words, the array will hold 6 elements

{12.75, 14.87} implies that only the first two elements of the array are initialized ; the remain 4 elements will be set to default 0.

Answer:

ITS A SIMPLE ANSWER BUT THE PROBLEM IS TOO BIG!

Explanation:

The phishing email might contain a link which on clicking will take you to a fake web page. For example, the link might take you to a fake bank website which looks very legitimate but in reality is just a lookalike. If the victim falls for the scam and enters his/her account details on the website, the details will actually go to the hacker's server instead of going to the bank and the hacker will have all the information that the victim has provided on the website.

Answer:

The output file is given below.

Explanation:

Please visit gotit-pro.com to get complete working code.

Solution :

It is given that I am using a microcomputer at home along with  DSL modem as well as a telephone network for the internet. My company has internet and has local area network and also a mainframe network.

Therefore, the different network connections involved are :

Answer:

Managed devices

Explanation:

hope it helps u

Answer:

os, operating system is very important

Answer:

#include <iostream>

using namespace std;

struct entry

{

int number;

entry* next;

};

void orderedInsert(entry** head_ref,entry* new_node);

void init_node(entry *head,int n)

{

head->number = n;

head->next =NULL;

}

void insert(struct entry **head, int n)

{

entry *nNode = new entry;

nNode->number = n;

nNode->next = *head;

*head = nNode;

}

entry *searchNode(entry *head, int n)

{

entry *curr = head;

while(curr)

{

if(curr->number == n)

return curr;

curr = curr->next;

}

}

bool delNode(entry **head, entry *ptrDel)

{

entry *curr = *head;

if(ptrDel == *head)

{

*head = curr->next;

delete ptrDel;

return true;

}

while(curr)

{

if(curr->next == ptrDel)

{

curr->next = ptrDel->next;

delete ptrDel;

return true;

}

curr = curr->next;

}

return false;

}

void display(struct entry *head)

{

entry *list = head;

while(list!=NULL)

{

cout << list->number << " ";

list = list->next;

}

cout << endl;

cout << endl;

}

//Define the function to sort the list.

void insertionSort(struct entry **h_ref)

{

// Initialize the list

struct entry *ordered = NULL;

// Insert node to sorted list.

struct entry *current = *h_ref;

while (current != NULL)

{

struct entry *next = current->next;

// insert current in the ordered list

orderedInsert(&ordered, current);

// Update current

current = next;

}

// Update the list.

*h_ref = ordered;

}

//Define the function to insert and traverse the ordered list

void orderedInsert(struct entry** h_ref, struct entry* n_node)

{

struct entry* current;

/* Check for the head end */

if (*h_ref == NULL || (*h_ref)->number >= n_node->number)

{

n_node->next = *h_ref;

*h_ref = n_node;

}

else

{

//search the node before insertion

current = *h_ref;

while (current->next!=NULL &&

current->next->number < n_node->number)

{

current = current->next;

}

//Adjust the next node.

n_node->next = current->next;

current->next = n_node;

}

}

int main()

{

//Define the structure and variables.

char ch;int i=0;

entry *newHead;

entry *head = new entry;

entry *ptr;

entry *ptrDelete;

//Use do while loop to countinue in program.

do

{

//Define the variables

int n;

int s;

int item;

char choice;

//Accept the user choice

cout<<"Enter your choice:"<<endl;

cout<<"a. Add a number"<<endl

<<"b. Delete a number"<<endl

<<"c. Search for a number"<<endl

<<"d. Display the whole list of numbers"<<endl;

cin>>choice;

//Check the choice.

switch(choice)

{

//Insert an item in the list.

case 'a' :

// cin>>item;

cout<<"Enter the element:"<<endl;

cin>>item;

//To insert the first element

if(i==0)

init_node(head,item);

//To insert remaining element.

else

{

ptr = searchNode(head,item);

//Check for Duplicate data item.

if(ptr==NULL)

{

insert(&head,item);

}

else

{

cout<<"Duplicate data items not allowed";

cout<<endl<<"EnterAgain"<<endl;

cin>>item;

insert(&head,item);

}

}

insertionSort(&head);

i=i+1;

break;

//Delete the item from the list

case 'b' :

int numDel;

cout<<"Enter the number to be deleted :"<<endl;

cin>>numDel;

//Locate the node.

ptrDelete = searchNode(head,numDel);

if(ptrDelete==NULL)

cout<<"Element not found";

else

{

if(delNode(&head,ptrDelete))

cout << "Node "<< numDel << " deleted!\n";

}

break;

//Serach the item in the list.

case 'c' :

cout<<"Enter the element to be searched :";

cout<<endl;

cin>>s;

ptr = searchNode(head,s);

if(ptr==NULL)

cout<<"Element not found";

else

cout<<"Element found";

break;

//Display the list.

case 'd' :

display(head);

break;

default :

cout << "Invalid choice" << endl;

break;

}

//Ask user to run the program again

cout<<endl<<"Enter y to countinue: ";

cin>>ch;

}while(ch=='y'||ch=='Y');

return 0;

}

output:

Answer:

8

Explanation:

Queues can be implemented using linear arrays; such that when items are added or removed from the queue, the queue repositions its front and rear elements.

The value of the REAR after adding 3 elements is 5

Given that:

[tex]REAR = 5[/tex] --- the rear value

[tex]n = 20[/tex] --- size of array

[tex]Elements = 3[/tex] --- number of elements to be added

When 3 elements are added, the position of the REAR element will move 3 elements backward.

However, the value of the REAR element will remain unchanged because the new elements that are added will only change the positioning of the REAR element and not the value of the REAR element.

Read more about queues at:

https://brainly.com/question/13150995

This is true for most modern computers

Answer:

CPU = Central prossing Unit

Answer:

The true statements are :

A. assertEquals(student1,student2)  

C. assertSame(student1,student3)

Explanation:

AssertEquals() asserts that the objects are equal, but assertSame() asserts that the passed two objects refer to the same object or not, if found same they return true, else return false.

Methods are collections of named code segments that are executed when evoked

The assertion method that will return true for the given code is: assertEquals(student1,student2)  

The code segment is given as:

Student student1 = new Student();

Student student2 = new Student();

Student student3 = student1;

In Java, the assertEquals() method returns true if two objects have equal values.

Assume student1 and student2 have equal values, the statement assertEquals(student1,student2) will return true

Read more about java methods at:

https://brainly.com/question/15969952