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
LUCKY_DIMON [66]
3 years ago
15

Necesito 7 innovaciones tecnológicas de la informática para 2021

Computers and Technology
1 answer:
Sonja [21]3 years ago
3 0

‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍  ‍

You might be interested in
What are motion graphics?
AysviL [449]
D)Animated abstract shapes
3 0
3 years ago
The Knowledge Consistency Checker (KCC) ensures the maximum number of hops between any two domain controllers does not exceed wh
Katarina [22]

Answer:

Three (3)

Explanation:

Explanation of the three basic terms here - Knowledge consistency checker, hops and domain controller - will give a clearer answer and explanation to the question as follows;

<em>Domain controller</em> : is a server controller that gives access or controls to users on computer networks by first responding to their authentication requests and verifying those users. In other words, a domain controller is a network security manager.

<em>Hop</em> : A hop is simply the passage of data packets from one network to another. As  a packet moves from its source to destination, it moves from router to router. The number of such routers that the packet passes through is called a hop.

<em>The Knowledge Consistency Checker (KCC)</em> :  It is the job of the KCC to ensure that these domain controllers participate in the replication promptly and orderly. Replication means copying data from one location to another (within a network or among networks). The KCC ensures that the maximum number of hops permitted is does not exceed 3. i.e no domain controller is more than 3 hops from any other domain controller within a network.

Note: Replication is of two types - intrasite (among all domain controllers within a site) and intersite (among all domain controllers in different sites), and the KCC can manage both type of replication. Also, by default, at every 15 minutes interval, a domain controller generates a replication topology (a logical map that dictates the domain controllers that will replicate with each other).

<em>Hope this helps!</em>

3 0
3 years ago
Alternating Current or AC is better for use in ___________, while DC direct current is needed in _________ .
PIT_PIT [208]
<span>C electric power transmisson and electronics</span>
6 0
3 years ago
Read 2 more answers
How bridges are built over water
Black_prince [1.1K]
It’s all depending on what method
4 0
2 years ago
A perfect binary tree is a complete binary tree with all levels fully filled. Add a method in the BST class to return true if th
algol [13]

Answer:

class BST {

static class Node

{

int val;

Node left, right;

}

static boolean checkPerfectBT(Node node, int h, int d)

{

if (node == null)

return true;

 

if (node.left == null && node.right == null)

{

if(h==d+1)

return true;

else

return false;

}

 

if (node.left == null || node.right== null)

return false;

 

return checkPerfectBT(node.left, h, d+1) && checkPerfectBT(node.right, h, d+1);

}

static int height(Node node)

{

int dep = 0;

while (node != null)

{

node = node.right;

dep=dep+1;

}

return dep;

}

static boolean isPerfectBT(Node node)

{

int h = height(node);

return checkPerfectBT(node, h, 0);

}

 

static Node addNode(int x)

{

Node node = new Node();

node.val= x;

node.right = null;

node.left = null;

return node;

}

public static void main(String args[])

{

int i,j,k;

Node node= null;

node = addNode(34);

node.left = addNode(2);

node.right = addNode(322);

 

node.left.left = addNode(21);

node.left.right = addNode(23);

node.right.left = addNode(37);

node.right.right = addNode(54);

 

if (isPerfectBT(node) == true)

System.out.println("This is a Perfect Binary tree");

else

System.out.println("This is Not a perfect Binary Tree");

}

}

Explanation:

  • Calculate the depth of BST by using a while loop until it reaches a null value.
  • In the addNode method, make an object of Node class.
  • In the main method, pass the values to addNode method.
  • Finally display the relevant message to show if it's Perfect or not.
6 0
3 years ago
Other questions:
  • For local travel addresses and street names should be
    14·1 answer
  • According to the appendix what was the purpose of newspeak
    12·1 answer
  • An ______ is a simplified image. [4 letters]​
    7·2 answers
  • Used prevalently on the web, it allows for secure messages to be sent between parties without having to agree on, or share, a se
    7·2 answers
  • An example of an electrical insulator is _____.
    15·1 answer
  • Which type of CPU instruction performs arithmetic calculations and stores the results in memory?
    14·2 answers
  • A user reports that nothing happens when he or she attempts to print from the computer at his desk. This points to a possible pr
    15·1 answer
  • Which of the following statements is true of a server? Question 18 options: A) It supports processing requests from remote compu
    11·1 answer
  • Lesson 3 - Calling All Operators
    6·1 answer
  • PLEASE HELP I mainly only need the answer for 4.
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!