Morality

Integrity

Honesty

Section B

Answer:

**Answer: Ethics **

**Explanation:**

Ethics is the basic principle for the personal code. The code of the ethics is basically designed for outline the values in the organization with honesty and integrity.

The ethics is basically depend upon the principle of core value of the organization. The code of the ethics basically guide the core value in the organization and breaking the rule of ethics can also cause termination from the organization.

Morality, integrity and honesty are all the sub part of the ethics vale in the organization. Therefore, ethics is the correct option.

Edhisive 3.5 code practice

Jenae helps maintain her school web site and needs to create a web site poll for students. Which tool will she use?

Which tool, Wireshark or NetWitness, provides information about the wireless antenna strength during a captured transmission?

People convicted of cyberbullying in most statesface no punishment for their actions.face varying degrees of punishment.are taught how to use technology positively.are forced to do community service.

as a technician, you have been tasked with increasing the ram memory on a laptop by adding a so-dimm module to an empty memory slot. which of the following processes seats the module in the slot?

Jenae helps maintain her school web site and needs to create a web site poll for students. Which tool will she use?

Which tool, Wireshark or NetWitness, provides information about the wireless antenna strength during a captured transmission?

People convicted of cyberbullying in most statesface no punishment for their actions.face varying degrees of punishment.are taught how to use technology positively.are forced to do community service.

as a technician, you have been tasked with increasing the ram memory on a laptop by adding a so-dimm module to an empty memory slot. which of the following processes seats the module in the slot?

Picking the largest one of input or partitioned data as pivot value

Median of input or partitioned data is expensive to calculate

Data is sorted already and always pick the median as pivot

Choose the incorrect statement:

When the median is always picked as pivot in input/partitioned data, then quicksort achieves the best-case time complexity.

Mergesort has O(N(log(N)) time complexity for its worst case, average case and best case

Insertionsort reaches its best-case time complexity O(N log(N)) when the input data is pre-sorted

Quicksort is practically fast and frequently used sorting algorithm.

Choose the incorrect statement:

In the lower bound analysis by using decision tree, each branch uses one comparison to narrow down possible cases

In the lower bound analysis by using decision tree, he number of required comparisons can be represented by height of decision tree

A decision tree to sort N elements must have N^2 leaves

O(N log(N)) lower bound means that comparison-based algorithm cannot achieve a time complexity better than O(N log(N))

Choose the incorrect statement regarding time complexity of union-find operation:

Inverse Ackermann function does not depend on N and is a constant factor.

When we use arbitrary union and simple find for union-find operation, the worst-case time complexity is O(MN) for a sequence of M operations and N elements

Union-by-size and Union-by-rank both improve the time complexity to O(M log(N)) for a sequence of M operations and N elements

To finish the entire equivalence class computation algorithm, we need to go over each pair of elements, so if we use union-by-rank with path compression for find operation, then the overall time complexity is O(N^2 log*N), where log*N denotes the inverse Ackermann function.

Choose the incorrect statement regarding Dijstraâs algorithm

Dijstraâs algorithm is a greedy algorithm

Dijstraâs algorithm requires to dynamically update distance/costs/weights of paths.

To begin with, Dijstraâs algorithm initializes all distance as INF

Dijstraâs algorithm can be implemented by heaps, leading to O(|E|+|V| log(|V|)) time complexity, where, particularly, log(|V|) is due to "insert" operation in heaps.

i) Picking the largest one of input or partitioned data as pivot value.

ii) Insertion sort reaches its best-case time complexity O(N log(N)) when the input data is pre-sorted

iii) A decision tree to sort N elements must have N^2 leaves

iv)** Inverse Ackermann **function does not depend on N and is a constant factor.

v) Dijstraâs algorithm requires to dynamically update distance/costs/weights of paths.

- Quicksort is an efficient
**sorting algorithm**used to sort items in an array. It is an in-place algorithm, meaning it does not require any additional memory for sorting. - The algorithm works by choosing a
**pivot element**from the array and partitioning the array based on the pivot. - All elements that are less than the pivot are placed before it, and all elements that are greater than the pivot are placed after it. This is repeated until the array is completely sorted.
- Quicksort is considered one of the fastest sorting algorithms and is used in many applications, such as sorting data in databases.
- It is also used in many programming languages, including C, Java, and Python.
- Quicksort is an example of a divide-and-conquer algorithm, as it splits the array into smaller pieces which are easier to sort.

To learn more about **quicksort** refer to:

#SPJ4

**Answer:**

Prolog program are used in the artificial intelligence and the web development in a systematic manner process. As, it is also sometimes known as declarative language which basically consist of some facts and list. Prolog program are divided into the sections that are:

- Domain sections
- Clauses sections
- Predicates sections
- Goal sections

We need each section of the prolog program because all the sections introduced the systematic program and performed there particular functions so by using all these processing steps an efficient function are formed.

class DebugNine1

{

public static void main(String[] args)

{

Scanner input = new Scanner(System.in);

String[][] books = new String[6][2];

books[0][0] = "Ulysses";

books[0][1] = "James Joyce";

books[1][0] = "Lolita"

books[1][1] = "Vladimir Nabokov";

books[2][1] = "Huckleberry Finn";

books[2][1] = "Mark Twain";

books[3][0] = "Great Gatsby";

books[3][2] = "F. Scott Fitzgerald";

books[4][0] = "1984";

books[4][1] = "George Orwell";

books[5][5] = "Sound and the Fury";

books[5][1] = "William Faulkner";

String entry,

shortEntry,

message ="Enter the first three characters of a book title omitting \"A\" or \"The\" ";

int num, x;

boolean isFound = true;

while(!isFound)

{

System.out.println(message);

entry = input.next();

shortEntry = entry.substring(0,3);

for(x = 0; x < books.length; ++x)

if(books[x][0].startsWith(shortEntry))

{

isFound = true;

System.out.println(books[x][x] + " was written by " + books[x][1]);

x = books.length;

}

if(isFound)

System.out.println("Sorry - no such book in our database);

}

}

}

**Answer:**

What's the question?

**Explanation:**

until the price of goods reflects equal supply and demand.

Supply and demand us an economic model of price determination in a market if demand increses and supply remains unchanged then it leads to higher equalibrium price and higher quantity if demand decreases s and supply remains unchanged then it lead to lower equilibrium price and lower quantity hope this helps XD

**Answer:**

public class Main

{

public static void main(String[] args) {

minMax(1, 2, 3);

minMax(100, 25, 33);

minMax(11, 222, 37);

}

public static void minMax(int n1, int n2, int n3){

int max, min;

if(n1 >= n2 && n1 >= n3){

max = n1;

}

else if(n2 >= n1 && n2 >= n3){

max = n2;

}

else{

max = n3;

}

if(n1 <= n2 && n1 <= n3){

min = n1;

}

else if(n2 <= n1 && n2 <= n3){

min = n2;

}

else{

min = n3;

}

System.out.println("The max is " + max + "\nThe min is " + min);

}

}

**Explanation:**

*The code is in Java.

Create a function named minMax() that takes three integers, n1, n2 and n3

Inside the function:

Declare the min and max

Check if n1 is greater than or equal to n2 and n3. If it is set it as max. If not, check if n2 is greater than or equal to n1 and n3. If it is set it as max. Otherwise, set n3 as max

Check if n1 is smaller than or equal to n2 and n3. If it is set it as min. If not, check if n2 is smaller than or equal to n1 and n3. If it is set it as min. Otherwise, set n3 as min

Print the max and min

Inside the main:

Call the minMax() with different combinations

Ex: If the input is:

Enter the number of integers in your list: 5

Enter the 5 integers:

50

60

140

200

75

Enter the threshold value: 100

the output is:

The integers that are less than or equal to 100 are:

50

60

75

The 5 indicates that there are five integers in the list, namely 50, 60, 140, 200, and 75. The 100 indicates that the program should output all integers less than or equal to 100, so the program outputs 50, 60, and 75. Such functionality is common on sites like Amazon, where a user can filter results. Your code must define and call the following two functions: def get_user_values() def output_ints_less_than_or_equal_to_threshold(user_values, upper_threshold) Utilizing functions will help to make your main very clean and intuitive.

**Answer:**

def output_ints_less_than_or_equal_to_threshold(user_values, upper_threshold):

for value in user_values:

if value < upper_threshold:

print(value)

def get_user_values():

n = int(input())

lst = []

for i in range(n):

lst.append(int(input()))

return lst

if __name__ == '__main__':

userValues = get_user_values()

upperThreshold = int(input())

output_ints_less_than_or_equal_to_threshold(userValues, upperThreshold)

**Explanation:**