Recent questions tagged gateit-2007

Synchronization in the classical readers and writers problem can be achieved through use of semaphores. In the following incomplete code for readers-writers problem, two ...

Consider the following pseudo-code:IF ((A B) AND (C D)) THEN A = A + 1 B = B + 1 ENDIFThe cyclomatic complexity of the pseudo-code is2345

Consider the CPM activity chart where an arc connecting two milestones is labeled with a task identifier and the time taken in days. For example in order to go from A to ...

In the simplified flowchart given below, the shaded boxes represent code that is executed during a test case.The Branch coverage is3/42/31/23/8

Given the following algorithm for sorting an array X and N numbers: SUBROUTINE SHORT (X, N) IF (N < 2) RETURN FOR (i = 2) TO N INCREMENT BY 1) FOR (j = 1)...

The following table shows the time between failures for a software system.Error Number12345Time since last failure(hours)64856The reliability of the system for one hour o...

Consider the following finite automata $P$ and $Q$ over the alphabet $\{a, b, c\}$. The start states are indicated by a double arrow and final states are indicated by a d...

Consider the following grammars. Names representing terminals have been specified in capital letters.$$\begin{array}{|llll|}\hline G1 : & \text{stmnt} & \rightarrow & \...

Consider the grammar given below:$S \rightarrow x \ B \mid y \ A$$A \rightarrow x \mid x \ S \mid y \ A \ A$$B \rightarrow y \mid y \ S \mid...

Consider the following DFA in which $S_0$ is the start state and $S_1$, $S_3$ are the final states.What language does this $\textsf{DFA}$ recognize?All strings of $x$ and...

The two grammars given below generate a language over the alphabet $\{x, y, z\}$$G1 : S \rightarrow x \mid z \mid x \ S \mid z \ S \mid y \ B$$\qquad B \rightarrow y \...

The line $T$ in the following figure is permanently connected to the ground.Which of the following inputs $(X_1 X_2 X_3 X_4)$ will detect the fault ?$0000$$0111$$1111$Non...

A hard disk system has the following parameters :Number of tracks $= 500$Number of sectors/track $= 100$Number of bytes /sector $= 500$Time taken by the head to move from...

An error correcting code has the following code words: $00000000, 00001111, 01010101, 10101010, 11110000$. What is the maximum number of bit errors that can be corrected?...

$(C012.25)_H - (10111001110.101)_B =$$(135103.412)_o$$(564411.412)_o$$(564411.205)_o$$(135103.205)_o$

Following table indicates the latencies of operations between the instruction producing the result and instruction using the result.$$\begin{array}{|l|l|c|} \hline \textb...

What is the final value stored in the linear feedback shift register if the input is $101101$?$0110$$1011$$1101$$1111$

Data forwarding techniques can be used to speed up the operation in presence of data dependencies. Consider the following replacements of LHS with RHS. $R1→ Loc, Loc→ R2 ...

The following expression was to be realized using $2$-input AND and OR gates. However, during the fabrication all $2$-input AND gates were mistakenly substituted by $2$-i...

Consider a Direct Mapped Cache with 8 cache blocks (numbered $0-7$). If the memory block requests are in the following order$3, 5, 2, 8, 0, 63, 9,16, 20, 17, 25, 18, 30, ...

The floating point unit of a processor using a design $D$ takes $2t$ cycles compared to $t$ cycles taken by the fixed point unit. There are two more design suggestions $D...

Early binding refers to a binding performed at compile time and late binding refers to a binding performed at execution time. Consider the following statements:Static sco...

Consider the program below in a hypothetical programming language which allows global variables and a choice of static or dynamic scoping.int i; program main() { i = 10; ...

Consider the program below in a hypothetical language which allows global variable and a choice of call by reference or call by value methods of parameter passing. ...

Consider the following C program: #include <stdio.h #define EOF -1 void push (int); /* push the argument on the stack */ int pop (void); /* pop the top of the stack */ vo...

Consider the C program given below : #include <stdio.h int main () { int sum = 0, maxsum = 0, i, n = 6; int a [] = {2, -2, -1, 3, 4, 2}; for (i = 0; i < n; i++) { if (i =...

Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are:$\text{isEmpty (Q)}$ — returns true if the queue is ...

When searching for the key value $60$ in a binary search tree, nodes containing the key values $10, 20, 40, 50, 70, 80, 90$ are traversed, not necessarily in the order gi...

Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collide...

The function f is defined as follows:int f (int n) { if (n <= 1) return 1; else if (n % 2 == 0) return f(n/2); else return f(3n - 1); }Assuming that arbitrarily large int...