Technical Questions

Q:

The following SQL is which type of join: SELECT CUSTOMER_T. CUSTOMER_ID, ORDER_T. CUSTOMER_ID, NAME, ORDER_ID FROM CUSTOMER_T,ORDER_T ;

A) Equi-join B) Natural join
C) Outer join D) Cartesian join
 
Answer & Explanation Answer: D) Cartesian join

Explanation:
Report Error

View Answer Workspace Report Error Discuss

Filed Under: Database

7 5023
Q:

 The load and index is which of the following?

A) A process to reject data from the data warehouse and to create the necessary indexes B) A process to load the data in the data warehouse and to create the necessary indexes
C) A process to upgrade the quality of data after it is moved into a data warehouse D) A process to upgrade the quality of data before it is moved into a data warehouse
 
Answer & Explanation Answer: B) A process to load the data in the data warehouse and to create the necessary indexes

Explanation:
Report Error

View Answer Workspace Report Error Discuss

Filed Under: Database

0 4902
Q:

 When three or more AND and OR conditions are combined, it is easier to use the SQL keyword(s):

A) LIKE only. B) IN only.
C) NOT IN only. D) Both IN and NOT IN.
 
Answer & Explanation Answer: D) Both IN and NOT IN.

Explanation:
Report Error

View Answer Workspace Report Error Discuss

Filed Under: Database

2 4851
Q:

What is cladding?

Answer

A layer of a glass surrounding the center fiber of glass inside a fiber-optic cable.

Report Error

View answer Workspace Report Error Discuss

Subject: Networking
Job Role: Network Engineer

6 4782
Q:

Explain the popular multiprocessor thread-scheduling strategies.

Answer

  1. Load Sharing: Processes are not assigned to a particular processor. A global queue of threads is maintained. Each processor, when idle, selects a thread from this queue. Note that load balancing refers to a scheme where work is allocated to processors on a more permanent basis.

  2. Gang Scheduling: A set of related threads is scheduled to run on a set of processors at the same time, on a 1-to-1 basis. Closely related threads / processes may be scheduled this way to reduce synchronization blocking, and minimize process switching. Group scheduling predated this strategy.

  3. Dedicated processor assignment: Provides implicit scheduling defined by assignment of threads to processors. For the duration of program execution, each program is allocated a set of processors equal in number to the number of threads in the program. Processors are chosen from the available pool.

  4. Dynamic scheduling: The number of thread in a program can be altered during the course of execution.

Report Error

View answer Workspace Report Error Discuss

8 4659
Q:

When does the condition 'rendezvous' arise?

Answer

In message passing, it is the condition in which, both, the sender and receiver are blocked until the message is delivered.

Report Error

View answer Workspace Report Error Discuss

11 4632
Q:

If the binary equivalent of 5.375 in normalised form is 0100 0000 1010 1100 0000 0000 0000 0000, what would be the output of the following program?

main()

{

    float a = 5.375 ;

    char *p;

    int i;

    p = ( char* ) &a ;

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

          printf ( " %02x ", (unsigned char ) p[i] );

}

Answer

00 00 AC 40

Report Error

View answer Workspace Report Error Discuss

Subject: Programming

3 4550
Q:

Draw a Transmission Gate-based D-Latch?

Answer

The Transmission-Gate's input is connected to the D_LATCH data input (D), the control input to the Transmission-Gate is connected to the D-Latch enable inputs (EN) and the Transmission-Gate outputs is the D_LATCH output(Q)

Report Error

View answer Workspace Report Error Discuss

Subject: Hardware

2 4550