Consider the following C program segment struct CellNode {   struct CelINode *leftchild;   int element;   struct CelINode *rightChild; }    int Dosomething(struct CelINode *ptr) {     int… Read More

What is the result of evaluating the following two expressions using three-digit floating point arithmetic with rounding? (113. + -111.) + 7.51 113. + (-111.… Read More

The goal of structured programming is to: (A) have well indented programs (B) be able to infer the flow of control from the compiled code… Read More

In a packet switching network, packets are routed from source to destination along a single path having two intermediate nodes. If the message size is… Read More

A 5 stage pipelined CPU has the following sequence of stages: IF — Instruction fetch from instruction memory, RD — Instruction decode and register read,… Read More

Consider the following system of equations in three real variables x1, x2 and x3  2x1 - x2 + 3x3 = 1 3x1- 2x2 + 5x3… Read More

Which one of the following is a key factor for preferring B+ -trees to binary search trees for indexing database relations? (A) Database relations have… Read More

Normally user programs are prevented from handling I/O directly by I/O instructions in them. For CPUs having explicit I/O instructions, such I/O protection is ensured… Read More

The time complexity of computing the transitive closure of a binary relation on a set of n elements is known to be (A) O (n)… Read More

A CPU has a 32 KB direct mapped cache with 128-byte block size. Suppose A is a twodimensional array of size 512×512 with elements that… Read More

Barrier is a synchronization construct where a set of processes synchronizes globally i.e. each process in the set arrives at the barrier and waits for… Read More

The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n >= 6. Two vertices of G… Read More

The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n >= 6 . Two vertices of… Read More