1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
evablogger [386]
2 years ago
5

Complete the sentence. A text messaging application is an example of a _____ application.

Computers and Technology
2 answers:
Ne4ueva [31]2 years ago
3 0

Answer:

chat application

Explanation:

Illusion [34]2 years ago
3 0

Answer:

Communication

Explanation:

You might be interested in
True or false? because you have made it a practice to never access the
Flauer [41]

Answer: False

Explanation: Even if the internet service is not connected with the operating system while accessing the database, it is still on risk and can be vulnerable to get attacked. Devices of the system like USB drive can happen to have the malware which creates the risk towards database.

The computer system can get invoked with the virus or other attack while the user connects the internet afterwards when he/she is not accessing the database, these malware get stored in system once they get invoked and corrupt the system and its database even when the internet connection is not present .Thus, the statement given is false.

6 0
3 years ago
The Hazard Communication Standard, commonly called the “Right-to-Know” law, gives you the right to know what information?
statuscvo [17]
Lets you know if their are any certain hazards or messes on the property like mold or ants
8 0
3 years ago
Your job as a researcher for a college is going well. You have gained confidence and skill at pulling data and you are not makin
Georgia [21]

Answer:

Check the explanation

Explanation:

Following are the things to be implemented immediately

Database should be maintained centralized manner so that any one can access data. Number should be given at the time of admission it should contain year of admission,course of admission …etc in the form of code eg. 2015FW1001 means year 2015 Fashion studies Winter admission no 1001. At the time of admission only they have to give the details of military status. Department which taking care of this issue should only have the permission to modify and delete the data. All the departments should be connected to the server by internet/intranet/network. Students should be given user id and password

Same database should be connected and given access through internet also with limited privileges so that user can update their status of military by submitting proof. By these information uploaded centralized administrative department update the status if they satisfied with the documents uploaded.

We can overcome the problem of mil status by giving the freedom to the student update their military status by uploading the documents.

7 0
3 years ago
Define a class called TreeNode containing three data fields: element, left and right. The element is a generic type. Create cons
m_a_m_a [10]

Answer:

See explaination

Explanation:

// Class for BinarySearchTreeNode

class TreeNode

{

// To store key value

public int key;

// To point to left child

public TreeNode left;

// To point to right child

public TreeNode right;

// Default constructor to initialize instance variables

public TreeNode(int key)

{

this.key = key;

left = null;

right = null;

key = 0;

}// End of default constructor

}// End of class

// Defines a class to crate binary tree

class BinaryTree

{

// Creates root node

TreeNode root;

int numberElement;

// Default constructor to initialize root

public BinaryTree()

{

this.root = null;

numberElement = 0;

}// End of default constructor

// Method to insert key

public void insert(int key)

{

// Creates a node using parameterized constructor

TreeNode newNode = new TreeNode(key);

numberElement++;

// Checks if root is null then this node is the first node

if(root == null)

{

// root is pointing to new node

root = newNode;

return;

}// End of if condition

// Otherwise at least one node available

// Declares current node points to root

TreeNode currentNode = root;

// Declares parent node assigns null

TreeNode parentNode = null;

// Loops till node inserted

while(true)

{

// Parent node points to current node

parentNode = currentNode;

// Checks if parameter key is less than the current node key

if(key < currentNode.key)

{

// Current node points to current node left

currentNode = currentNode.left;

// Checks if current node is null

if(currentNode == null)

{

// Parent node left points to new node

parentNode.left = newNode;

return;

}// End of inner if condition

}// End of outer if condition

// Otherwise parameter key is greater than the current node key

else

{

// Current node points to current node right

currentNode = currentNode.right;

// Checks if current node is null

if(currentNode == null)

{

// Parent node right points to new node

parentNode.right = newNode;

return;

}// End of inner if condition

}// End of outer if condition

}// End of while

}// End of method

// Method to check tree is balanced or not

private int checkBalance(TreeNode currentNode)

{

// Checks if current node is null then return 0 for balanced

if (currentNode == null)

return 0;

// Recursively calls the method with left child and

// stores the return value as height of left sub tree

int leftSubtreeHeight = checkBalance(currentNode.left);

// Checks if left sub tree height is -1 then return -1

// for not balanced

if (leftSubtreeHeight == -1)

return -1;

// Recursively calls the method with right child and

// stores the return value as height of right sub tree

int rightSubtreeHeight = checkBalance(currentNode.right);

// Checks if right sub tree height is -1 then return -1

// for not balanced

if (rightSubtreeHeight == -1) return -1;

// Checks if left and right sub tree difference is greater than 1

// then return -1 for not balanced

if (Math.abs(leftSubtreeHeight - rightSubtreeHeight) > 1)

return -1;

// Returns the maximum value of left and right subtree plus one

return (Math.max(leftSubtreeHeight, rightSubtreeHeight) + 1);

}// End of method

// Method to calls the check balance method

// returns false for not balanced if check balance method returns -1

// otherwise return true for balanced

public boolean balanceCheck()

{

// Calls the method to check balance

// Returns false for not balanced if method returns -1

if (checkBalance(root) == -1)

return false;

// Otherwise returns true

return true;

}//End of method

// Method for In Order traversal

public void inorder()

{

inorder(root);

}//End of method

// Method for In Order traversal recursively

private void inorder(TreeNode root)

{

// Checks if root is not null

if (root != null)

{

// Recursively calls the method with left child

inorder(root.left);

// Displays current node value

System.out.print(root.key + " ");

// Recursively calls the method with right child

inorder(root.right);

}// End of if condition

}// End of method

}// End of class BinaryTree

// Driver class definition

class BalancedBinaryTreeCheck

{

// main method definition

public static void main(String args[])

{

// Creates an object of class BinaryTree

BinaryTree treeOne = new BinaryTree();

// Calls the method to insert node

treeOne.insert(1);

treeOne.insert(2);

treeOne.insert(3);

treeOne.insert(4);

treeOne.insert(5);

treeOne.insert(8);

// Calls the method to display in order traversal

System.out.print("\n In order traversal of Tree One: ");

treeOne.inorder();

if (treeOne.balanceCheck())

System.out.println("\n Tree One is balanced");

else

System.out.println("\n Tree One is not balanced");

BinaryTree

BinaryTree treeTwo = new BinaryTree();

treeTwo.insert(10);

treeTwo.insert(18);

treeTwo.insert(8);

treeTwo.insert(14);

treeTwo.insert(25);

treeTwo.insert(9);

treeTwo.insert(5);

System.out.print("\n\n In order traversal of Tree Two: ");

treeTwo.inorder();

if (treeTwo.balanceCheck())

System.out.println("\n Tree Two is balanced");

else

System.out.println("\n Tree Two is not balanced");

}// End of main method

}// End of driver class

5 0
3 years ago
Becca is working on a program that will store data. The program will need quick access to data and data persistence is not impor
tester [92]

Answer:

A developer wants to take existing code written by another person and add some features specific to their needs.

Explanation:

pls Mark as Brain list

3 0
2 years ago
Other questions:
  • If you sort by Last Name, Ascending, which of the following last names would come first in the list?
    12·1 answer
  • Which of the following about if statement is true? A. The condition is a Boolean expression B. A Boolean expression is something
    15·1 answer
  • An ironworker standing 30 feet in the air is safe wearing a full body harness that is not tied off
    15·2 answers
  • What is the first thing you should do when troubleshooting a computer problem
    5·2 answers
  • Portable Document Format (PDF) is a file format that provides an electronic image of a document and can be viewed, printed, and
    12·2 answers
  • Join me to play mm2<br><br><br>in r0bl0x​
    6·2 answers
  • which of these tools stick to the edge of an image, thus making it easy to select the shape of an image
    6·1 answer
  • If 2 people use my code D9R2M on fetch reward and scan receipts I will give brainliest ​
    13·2 answers
  • Does kohl's sell homecoming dresses?? And if do you know what the price rage would be !!
    5·1 answer
  • Hexadecimal to denary gcse method
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!