Technical Questions

Q:

What is Beaconing?

Answer

The process that allows a network to self-repair networks problems. The stations on the network notify the other stations on the ring when they are not receiving the transmissions. Beaconing is used in Token ring and FDDI networks.

Report Error

View answer Workspace Report Error Discuss

Subject: Networking
Job Role: Network Engineer

2 3408
Q:

What are the best way to prevent a computer virus from entering your computer?

Answer

1.Logout of your computer each time you have finished using it


2.Install and use anti-virus software on your computer 


3.Do not use emails on your machine


4.Make sure all your files are safely stored to your floppy disks

Report Error

View answer Workspace Report Error Discuss

Subject: Hardware

2 3390
Q:

The "curse of dimensionality" relates to which problem of using operational data for BI reporting?

A) Dirty data B) Inconsistent data
C) Too much data D) Non-integrated data
 
Answer & Explanation Answer: C) Too much data

Explanation:
Report Error

View Answer Report Error Discuss

Filed Under: Database

0 3382
Q:

What is the difference between routable and non- routable protocols?

Answer

Routable protocols can work with a router and can be used to build large networks. Non-Routable protocols are designed to work on small, local networks and cannot be used with a router

Report Error

View answer Workspace Report Error Discuss

Subject: Networking
Job Role: Database Administration

0 3369
Q:

In the context of memory management, what are placement and replacement algorithms?

Answer

Placement algorithms determine where in available real-memory to load a program. Common methods are first-fit, next-fit, best-fit. Replacement algorithms are used when memory is full, and one process (or part of a process) needs to be swapped out to accommodate a new program. The replacement algorithm determines which are the partitions to be swapped out.

Report Error

View answer Workspace Report Error Discuss

3 3354
Q:

How would you dynamically allocate a 2-D array of integers?

Answer

#include "alloc.h"


#define MAXROW 3


#define MAXcol 4


main()


{


        int *p, i, J;


        p = (int *) malloc (MAXROW * MAXCOL * sizeof (int));


         for ( i=0; i < MaxROW ; i++)


         {


                for (j=0; j < MAXCOL ; j++)


                { 


                      p [ i * MAXCOL + j] = i;


                       printf ( "%d", p [i * MAXCOL + j] );


                 }


                  printf ("\n");


          }


}

Report Error

View answer Workspace Report Error Discuss

Subject: Programming

0 3353
Q:

What are the sub-components of I/O manager in Windows NT?

Answer

- Network redirector/ Server


- Cache manager.


- File systems


- Network driver


- Device driver

Report Error

View answer Workspace Report Error Discuss

0 3346
Q:

What is the name of the law for the storage and use of data in the UK?

Answer

Data Protection Act

Report Error

View answer Workspace Report Error Discuss

Subject: Hardware

0 3338