All categories

3 years ago

What are some professionals that complete network administrator

Computers and Technology

1 answer:

Jobisdone [24]3 years ago

8 0

Answer:

The professionals that complete network administrator are following:

CompTIA A+ Certification.

CompTIA Network+ Certification.

CompTIA Security+ Certification.

Cisco CCNA Certification.

Cisco CCNP Certification.

Microsoft Certified Solutions Associate (MCSA)

Microsoft Certified Solutions Expert (MCSE)

VMware Certified Professional (VCP)

Explanation:

A network administrator is accountable concerning running an organization’s workstation channels up-to-date and functioning as supposed. Each corporation or industry that manages various mechanisms or software programs needs a chain admin to adjust and attach the various systems.

You might be interested in

Write a C program to multiply matrix A and matrix B of variable. For both A and B, the size of the matrix will be given along wi

victus00 [196]

Answer:

Code:

#include <iostream>

#include <fstream>

#include <cctype>

#include <cmath>

#include <vector>

#include <float.h>

using namespace std;

typedef vector<vector<double> > C2DArray;

void Matrix_Mult(bool* error_flag, const int mRows, const int nCols, const int pCols, const C2DArray A_Matrix, const C2DArray B_Matrix, C2DArray& C_Matrix) {

int i = A_Matrix.size(), j = A_Matrix[0].size(), k = B_Matrix[0].size();

double dummy;

if ((j != B_Matrix.size()) || (i != mRows) || (j != nCols) || (k != pCols)) *error_flag = true;

if ((C_Matrix.size() != i) || (k != C_Matrix[0].size())) *error_flag = true;

if (!(*error_flag)){

for (k = 0; k < mRows; k++) { // Do each row of A with each column of B

for (i = 0; i < pCols; i++) {

dummy = 0.0;

for (j = 0; j < nCols; j++) {

dummy += A_Matrix[k][j]*B_Matrix[j][i];

} // End for j

C_Matrix[k][i] = dummy;

} // End for i

} // End for k

}

return;

} // End Matrix_Mult

int main()

{char rflag = 0; //Readiness flag

cout << " Mat_Mul1 (7 June 2013)\n";

cout << "=========================================================================== \n";

cout << "This program multiplies two matrices, [A] and [B]: [A][B] = [C].\n";

cout << "[A] is M X N, [B] is N X P, and [C] is M X P\n";

cout << "The dimensions of the [A] and [B] matrices, M, N, and P, should \n";

cout << "have been saved beforehand in a file named mulmatdat.\n";

cout << "mulmatdat should be in the same folder as the Mat_Mul1 executable.\n";

cout << "The next values of mulmatdat should be the entries for matrix [A],\n";

cout << "with data for row 1 first, then row 2, then row 3, etc.\n";

cout << "The entries for the [B] matrix should follow, in the same order.\n";

cout << "\nThe data is assumed to be of type double. Variables used within this program\n";

cout << "are type double.\n";

cout << "\nThe output is written to the file mulmatout.txt.\n";

cout << "\nIs everything ready (are you ready to continue?)? If yes, Enter y. \n";

cout << "Otherwise Enter any other key. \n";

cin >> rflag;

if (toupper(rflag) == 'Y') {

C2DArray A, B, C; // A, B, and C Matrices

int i, j, mDim, nDim, pDim; // Array index variables and matrix dimensions

bool erFlag = false; // Error flag

ifstream in("mulmatdat.txt", ios::in);

if (!in) {

cout << "\nCannot open the input file.\n";

cout << "\nEnter any key to continue. \n";

cin >> rflag;

return 0;

}

in >> mDim >> nDim >> pDim; //Input the Matrices' dimensions from the file

if ((mDim < 1) || (nDim < 1) || (pDim < 1)){

cout << "\nInvalid dimension entered. Program terminated. \n";

cout << "\nEnter any key to continue. \n";

cin >> rflag;

in.close(); //Close the input file before terminating

return 0;

}

ofstream out("mulmatout.txt", ios::out);

if (!out) {

cout << "\nCannot open the output file. Program terminated.\n";

cout << "\nEnter any key to continue. \n";

cin >> rflag;

in.close(); //Close the input file before terminating

return 0;

}

// Beginning of try block, if vector re-sizing unsuccessful

try {

// Resize the arrays to the appropriate sizes

A.resize(mDim); // M rows

B.resize(nDim); // N rows

C.resize(mDim); // M rows

for (i = 0; i < mDim; i++){

A[i].resize(nDim); // M columns

C[i].resize(pDim); // P columns

} // End for i

for (i = 0; i < nDim; i++){

B[i].resize(pDim); // P columns

} // End for i

} // End of try block

catch (bad_alloc& xa) { // Catch block, for exceptions

in.close();

out.close();

cerr << "\nIn catch block, so an exception occurred: " << xa.what() << "\n";

cout << "\nEnter any key to continue. \n";

cin >> rflag;

return 0;

} // End of catch block

for (i = 0; i < mDim; i++){ //Input the A Matrix from the file

for (j = 0; j < nDim; j++){

in >> A[i][j];

}//End for j

}//End for i

for (i = 0; i < nDim; i++){ //Input the B Matrix from the file

for (j = 0; j < pDim; j++){

in >> B[i][j];

}//End for j

}//End for i

in.close(); //Close the input file

Matrix_Mult(&erFlag, mDim, nDim, pDim, A, B, C);

if (erFlag){

cout << "Inconsistent data sent to Matrix_Mult routine. Matrix multiplication NOT performed. Check data before running again.\n";

}

else {

out.precision(DBL_DIG);

out << "\nThe A matrix follows:\n";

out << "\n";

for (i = 0; i < mDim; i++){

for (j = 0; j < nDim; j++){

out << A[i][j] << " ";

} // End for j

out << "\n";

}//End for i

out << "\nThe B matrix follows:\n";

out << "\n";

for (i = 0; i < nDim; i++){

for (j = 0; j < pDim; j++){

out << B[i][j] << " ";

} // End for j

out << "\n";

}//End for i

out << "\nThe product matrix, C, follows:\n";

out << "\n";

for (i = 0; i < mDim; i++){

for (j = 0; j < pDim; j++){

out << C[i][j] << " ";

} // End for j

out << "\n";

}//End for i

cout << "\nDone! The solution is in the text file mulmatout.txt \n";

} // End else !erFlag

out.close();

}

else cout << "\nNot ready. Try again when ready with information. \n";

cout << "\nEnter any key to continue. \n";

cin >> rflag;

return 0;

}

4 0

4 years ago

Although the original BBS system was simple, it increased people's ability to communicate

777dan777 [17]

Answer:

across long distances.

Explanation:

BBS is an acronym for bulletin board system and it can be defined as an application or computer system which is typically used for the sharing and dissemination of user informations or data such as messages or files over a network. It is generally considered to be an alternative to the world wide web (www) in the 1980s and early 1990s before the advancement of the internet.

Hence, the bulletin board system (BBS) was typically accessed using a Telnet or a dial-up modem.

Although the original BBS system was simple, it increased people's ability to communicate across long distances because users didn't have to be physically present to exchange messages or files.

5 0

4 years ago

The computer architecture is broken into these three components

GalinKa [24]

Answer:

CPU, memory and input/output.

Explanation:

The computer architecture is broken into these three components;

I. CPU: this is known as the central processing unit and it is considered to be the brain of a computer system. It is the system unit where all of the processing and logical control of a computer system takes place.

II. Memory: it is the location used by the computer system to hold or store data. A computer memory comprises of random access memory (RAM) and read only memory (ROM).

III. Input/output: this unit is also known as peripherals and it comprises of all of the input and output devices that are interconnected with the CPU. It includes keyboards, speakers, monitor, printer, scanner etc.

7 0

3 years ago

Write a method reverse( ) for OurLinkedList class. The method should return a new OurLinkedList object that is the reverse of th

Salsk061 [2.6K]

Answer:

See explaination

Explanation:

class OurLinkedList<E> { // The head is the first node of the LinkedList private Node<E> head; /** * No argument constructor, as mentioned in question to initialize the head pointer with null */ public OurLinkedList() { head=null; } public void addFront(E e) { if(head==null) { head=new Node<E>(e);//forgot <E> } else { Node<E> temp=head; Node<E> n=new Node<E>(e); //forgot <E> n.setNext(temp); head=n; } } /* * The add(E data) method add the node to the end of the linked List, It first checks if the Linked List is empty or not >> If the * Linked list is not empty then, * the temp pointer traverses to the end of the linked List and inserts a new Node with data that is * passes as argument at the end of the linked List * */ public void add(E data) { if(head == null) { return; } Node<E> temp = head; Node<E> nodeToAdd = new Node<>(data); /* Moving temp pointer to end of the linked list where next pointer is null */ while(temp.getNext() != null) { temp.setNext(temp.getNext()); } // adding nodeToadd to the end of the linked List temp.setNext(nodeToAdd); } /** * This method checks if the head of the Linked List is null it returns TRUE otherwise it return FALSE */ public boolean isEmpty() { if(head==null) { return true; } return false; } /** * the method remove, removes the first node of the list. If the list is empty is does nothing, if the List is not empty * then it removes the first element of the linked List. */ public void remove() { if (!isEmpty()) { Node<E> toRemoved = head; head = head.getNext(); toRemoved.setNext(null); } } /** * the size() method returns the size of the Linked List, * this method calculates the size of the linkedList by traversing through each node and incrementing the * length variable value */ public int size() { int length = 0; Node<E> current = head; while (current != null) { current = current.getNext(); length++; } return length; } public String toString() { if(isEmpty()) { return "head ==> null"; } Node<E> temp=head; String s="head ==> "; while(temp!=null) { s+=temp.getData()+" ==> "; temp=temp.getLink(); } s+=" null"; return s; } /* method to reverse the Linked List */ Node<E> reverse() { Node<E> prev = null; Node<E> current = head; Node<E> next = null; while (current != null) { next = current.getNext(); current.setNext(prev); prev = current; current = next; } head = prev; return head; } }

Node.java

/* this file contains the Implementation of Node class, * Node class contains if pointer of Node type which points to next Node * and a variable to hold the data */ public class Node<E> { private E data; private Node<E> next; public Node(E data) { this.data = data; next = null; } public void setNext(Node<E> next) { this.next=next; } public Node<E> getLink() { return next; } public E getData() { return data; } public void setData(E data) { this.data = data; } public Node<E> getNext() { return next; } }

Main.java <Contains the drive code for the program>

/* This class is the driver class of the program, this file contains the * code which checks the working of other components of the program * */ public class Main { public static void main(String[] args) { OurLinkedList<Integer> llist=new OurLinkedList<Integer>(); // checking if linked list id empty System.out.println("is empty: "+llist.isEmpty()); // after adding first element to list llist.addFront(10); System.out.println("is empty: "+llist.isEmpty()); // adding more elements to th elist llist.addFront(20); llist.addFront(30); llist.addFront(40); // printing the list using toString() method System.out.println("\n\nBefore Reversing the list:\n"+llist.toString()); // calling the reverse method llist.reverse(); System.out.println("\n\nAfter Reversing the list:\n"+llist.toString());

}

8 0

3 years ago

Once you complete your profile on LinkedIn, the next step is to

Cerrena [4.2K]

Make it stand out. Add a pic and stuff

7 0

4 years ago

Read 2 more answers