All categories

2 years ago

What would this look like if you were to write the pseudocode but for c++?

Computers and Technology

1 answer:

makvit [3.9K]2 years ago

5 0

Answer:

when make a task list you would not include commands that are for any specific language like C++

Explanation:

pseudocode should be universal. So when creating the task list, you would not include commands that are for any specific language like C++, java, C#, or perl. The point of pseudocode is to design a program that can be translated in to any language.

You might be interested in

A hub transmits all incoming messages to all of its ports except the port where the messages came in. A switch usually sends mes

leonid [27]

Answer:

MAC Addresses (Destination and Source MAC address)

Explanation:

A switch has 3 primary functions:

Forward frames
Learn addresses
Avoid loops

An Ethernet frame has the header, data and trailer and there are two specific fields in the header that helps the switch to know where to send data in future transmissions.

destination MAC address
source MAC address

every Ethernet frame has this and when the frame hits a switch or any device, any device can look at it ( an Ethernet frame ) and know where it is suppose to go and where it came from.

Every switch has a MAC address table where it stores MAC addresses of different computers on the network.

Example:

When a PC1 sends a frame to PC2 through a switch, the switch looks at the header of the Ethernet frame for the source mac address and adds the source MAC address to its MAC address table and also the port that it came through.

simply put:

A switch looks at the source MAC address to see if it knows it already, if it does. Great! no need to add it again to it's address table.

If it doesn't, it adds it's source address and the port that the frame came from.

This basically how the switch populates its MAC address table.

3 0

3 years ago

Read 2 more answers

Text that is heavier or darker than other text in the document is considered _____.

kvv77 [185]

The text that is heavier or darker than other text in a document is considered Bold.

Hope this helped!~

7 0

3 years ago

Read 2 more answers

Given two 2x3 (2 rows, 3 columns) arrays of integer , x1 and x2, both already initialized , two integer variables , i and j, and

Gnesinka [82]

JAVA programming was employed...

What we have so far:
* Two 2x3 (2 rows and 3 columns) arrays. x1[i][j] (first 2x3 array) and x2[i][j] (second 2x3 array) .
* Let i = row and j = coulumn.
* A boolean vaiable, x1rules

Solution:

for(int i=0; i<2; i++)
{
for(int j=0; j<3; j++)
{
x1[i][j] = num.nextInt();
}
}// End of Array 1, x1.

for(int i=0; i<2; i++)
{
for(int j=0; j<3; j++)
{
x2[i][j] = num.nextInt();
}
}//End of Array 2, x2
This should check if all the elements in x1 is greater than x2:

x1rules = false;
if(x1[0][0]>x2[0][0] && x1[0][1]>x2[0][1] && x1[0][2]>x2[0][2] && x1[1][0]>x2[1][0] && x1[1][1]>x2[1][1] && x1[1][2]>x2[1][2])
{
x1rules = true;
system.out.print(x1rules);
}
else
{
system.out.print(x1rules);
}//Conditional Statement

7 0

3 years ago

When considering changing the content of a cell which button should you press to leave the cell as it originally was?

densk [106]

Esc key or cancel .........

7 0

2 years ago

Read 2 more answers

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