When did the military develop video game-style simulations to help train military personnel? 1980s 1990s 2000s 2010s

A distribution of software that simplifies administration by identifying dependencies, automatically updating configuration file

emmasim [6.3K]

Answer:

Package

Explanation:

In a conventional kind of definition, a software package is basically several applications or code modules that work hand-in-hand to meet a range of goals and objectives. One of the most well-known examples is package like the Microsoft Office package, which consist of individual applications such as Excel, Word, Access and PowerPoint.

It can also be said to be numerous individual files or resources that are packed together as a software set which is meant to provides specific functionality as part of a larger system.

6 0

2 years ago

Write the recursive function max_depth; it is passed a binary (any binary tree, not necessarily a binary search tree) and a valu

OleMash [197]

Answer:

A python code was used in writing of the recursive function max_depth; and passed a binary (any binary tree, not necessarily a binary search tree) and a value as arguments.

Explanation:

Solution

To solve this given question we make use of Python programming language.

Thus

THE CODE:

class BinaryTreeNode:

def __init__(self, value, left=None, right=None):

self.value = value

self.left = left

self.right = right

# recursive max_depth function implementation

def max_depth(tree, value):

if tree == None:

return -1

# recursive calls to this function

leftDepth = max_depth(tree.left, value)

rightDepth = max_depth(tree.right, value)

# return the maximum depth

if tree.value == value or leftDepth > -1 or rightDepth > -1:

return 1 + max(leftDepth, rightDepth)

else:

return max(leftDepth, rightDepth)

btn1 = BinaryTreeNode(2)

btn2 = BinaryTreeNode(3, None, btn1)

btn3 = BinaryTreeNode(3)

btn4 = BinaryTreeNode(3)

btn5 = BinaryTreeNode(2, btn2, btn3)

btn6 = BinaryTreeNode(1, btn4)

tree = BinaryTreeNode(3, btn5, btn6)

print('max_depth(tree, 1):',max_depth(tree, 1))

print('max_depth(tree, 2):',max_depth(tree, 2))

print('max_depth(tree, 3):',max_depth(tree, 3))

Note: Kindly find an attached copy of the Implementation of max_depth() function, Code to test the max_depth() function and the sample output below.

8 0

2 years ago

Developed by ibm and refined by symantec, the __________ provides a malware detection system that will automatically capture, an

Nadya [2.5K]

Digital Immune System (DIS)

6 0

2 years ago

The birthday paradox says that the probability that two people in a room will have the same birthday is more than half, provided

poizon [28]

Answer:

The Java code is given below with appropriate comments for explanation

Explanation:

// java code to contradict birth day paradox

import java.util.Random;

public class BirthDayParadox

{

public static void main(String[] args)

{

Random randNum = new Random();

int people = 5;

int[] birth_Day = new int[365+1];

// setting up birthsdays

for (int i = 0; i < birth_Day.length; i++)

birth_Day[i] = i + 1;

int iteration;

// varying number n

while (people <= 100)

{

System.out.println("Number of people: " + people);

// creating new birth day array

int[] newbirth_Day = new int[people];

int count = 0;

iteration = 100000;

while(iteration != 0)

{

count = 0;

for (int i = 0; i < newbirth_Day.length; i++)

{

// generating random birth day

int day = randNum.nextInt(365);

newbirth_Day[i] = birth_Day[day];

}

// check for same birthdays

for (int i = 0; i < newbirth_Day.length; i++)

{

int bday = newbirth_Day[i];

for (int j = i+1; j < newbirth_Day.length; j++)

{

if (bday == newbirth_Day[j])

{

count++;

break;

}

iteration = iteration - 1;

}

System.out.println("Probability: " + count + "/" + 100000);

System.out.println();

people += 5;

}

4 0

2 years ago

Write a program that reads an integer and displays, using asterisks, a filled diamond of the given side length. For example, if

zaharov [31]

Answer:

import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int l = 1;
for(int i=1; i <= n; i++){
for(int j=1; j<= l; j++){
System.out.print("*");
}
System.out.println();
l = l + 2;
}
l = l - 4;
for(int i=1; i < n; i++){
for(int j=1; j <= l; j++){
System.out.print("*");
}
System.out.println();
l = l-2;
}
}
}

Explanation:

The solution code is written in Java.

Firstly use a Scanner object to accept an input integer (Line 5-6).

Create the first set of inner loops to print the upper part of the diamond shape (Line 8-14). The variable l is to set the limit number of asterisk to be printed in each row.

Next, create another inner loops to print the lower part of the diamond shape (Line 17-23). The same variable l is used to set the limit number of asterisk to be printed in each row.

3 0

2 years ago

Read 2 more answers