Recent questions tagged gateit-2007 / GATE Overflow for GATE CSE

36 votes

5 answers

31

GATE IT 2007 | Question: 56
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 binary semaphores mutex and wrt are used to obtain synchronization wait (wrt) writing is performed signal ... mutex), wait (mutex), signal (wrt) signal (mutex), wait (mutex), signal (mutex), wait (mutex)

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 ...

Ishrat Jahan

10.5k views

Ishrat Jahan asked Oct 30, 2014

5 votes

3 answers

32

GATE IT 2007 | Question: 55, UGCNET-June2012-III: 40
Consider the following pseudo-code: IF ((A > B) AND (C > D)) THEN A = A + 1 B = B + 1 ENDIF The cyclomatic complexity of the pseudo-code is 2 3 4 5

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

Ishrat Jahan

6.2k views

Ishrat Jahan asked Oct 30, 2014

1 votes

2 answers

33

GATE IT 2007 | Question: 54
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 B, task T1 takes 180 days. A dashed line depicts an additional dependency that is equivalent to a zero time task. The ... T1, T3, T8, T10 T1, T2, T3, T4, T5, T6, T7, T8, T9, T10 T1, T4, T5, T7, T8, T10

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 ...

Ishrat Jahan

1.3k views

Ishrat Jahan asked Oct 30, 2014

2 votes

1 answer

34

GATE IT 2007 | Question: 53
In the simplified flowchart given below, the shaded boxes represent code that is executed during a test case. The Branch coverage is 3/4 2/3 1/2 3/8

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

Ishrat Jahan

1.6k views

Ishrat Jahan asked Oct 30, 2014

0 votes

1 answer

35

GATE IT 2007 | Question: 52
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) TO i INCREMENT BY 1) IF (X [i] > X [j]) CONTINUE TEMP = X[i] X[i] = X[j] X[j] = TEMP END FOR END SUBROUTINE A good approximation of Halstead`s estimated program length is 20 50 80 110

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)...

Ishrat Jahan

874 views

Ishrat Jahan asked Oct 30, 2014

1 votes

1 answer

36

GATE IT 2007 | Question: 51
The following table shows the time between failures for a software system. Error Number 1 2 3 4 5 Time since last failure(hours) 6 4 8 5 6 The reliability of the system for one hour of operation assuming an exponential model is : 0.45 0.63 0.84 0.95

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...

Ishrat Jahan

2.0k views

Ishrat Jahan asked Oct 30, 2014

71 votes

6 answers

37

GATE IT 2007 | Question: 50
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 double circle. Let the languages recognized by them be denoted by $L(P)$ and $L(Q)$ respectively. The automation which recognizes the language $L(P) \cap L(Q)$ is :

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...

Ishrat Jahan

14.8k views

Ishrat Jahan asked Oct 30, 2014

67 votes

3 answers

38

GATE IT 2007 | Question: 49
Consider the following grammars. Names representing terminals have been specified in capital letters. ... $G_1$ and $G_2$ are regular Both $G_1$ and $G_2$ are context-free but neither of them is regular

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

Ishrat Jahan

12.8k views

Ishrat Jahan asked Oct 30, 2014

27 votes

2 answers

39

GATE IT 2007 | Question: 48
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 x \ B \ B$ Consider the following strings. $xxyyx$ $xxyyxy$ $xyxy$ $yxxy$ $yxx$ $xyx$ Which of the above strings are generated by the grammar ? i, ii and iii ii, v and vi ii, iii and iv i, iii and iv

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...

Ishrat Jahan

7.5k views

Ishrat Jahan asked Oct 30, 2014

29 votes

8 answers

40

GATE IT 2007 | Question: 47
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 $y$ All strings of $x$ and $y$ which have either even number of $x$ and even number of ... $x$ and $y$ with either even number of $x$ and odd number of $y$ or odd number of $x$ and even number of $y$

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...

Ishrat Jahan

6.5k views

Ishrat Jahan asked Oct 30, 2014

25 votes

5 answers

41

GATE IT 2007 | Question: 46
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$ $B \rightarrow y \mid z \mid y \ B \mid z \ B$ ... : Every $x$ is followed by at least one $y$ $G1$ : No $y$ appears after any $x$ $G2$ : Every $y$ is followed by at least one $x$

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$ ...

Ishrat Jahan

5.7k views

Ishrat Jahan asked Oct 29, 2014

39 votes

8 answers

42

GATE IT 2007 | Question: 45
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$ None of these

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...

Ishrat Jahan

12.2k views

Ishrat Jahan asked Oct 29, 2014

62 votes

5 answers

43

GATE IT 2007 | Question: 44, ISRO2015-34
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 one track to adjacent track $= 1 \ ms$ Rotation speed $= 600 \ rpm$. What is ... time taken for transferring $250$ bytes from the disk ? $300.5 \ ms$ $255.5 \ ms$ $255 \ ms$ $300 \ ms$

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...

Ishrat Jahan

23.0k views

Ishrat Jahan asked Oct 29, 2014

39 votes

7 answers

44

GATE IT 2007 | Question: 43
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? $0$ $1$ $2$ $3$

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?...

Ishrat Jahan

25.8k views

Ishrat Jahan asked Oct 29, 2014

31 votes

2 answers

45

GATE IT 2007 | Question: 42
$(C012.25)_H - (10111001110.101)_B =$ $(135103.412)_o$ $(564411.412)_o$ $(564411.205)_o$ $(135103.205)_o$

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

Ishrat Jahan

6.9k views

Ishrat Jahan asked Oct 29, 2014

56 votes

5 answers

46

GATE IT 2007 | Question: 41
Following table indicates the latencies of operations between the instruction producing the result and instruction using the result. ... to execute the above code segment assuming each instruction takes one cycle to execute? $7$ $10$ $13$ $14$

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...

Ishrat Jahan

25.0k views

Ishrat Jahan asked Oct 29, 2014

23 votes

6 answers

47

GATE IT 2007 | Question: 40
What is the final value stored in the linear feedback shift register if the input is $101101$? $0110$ $1011$ $1101$ $1111$

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

Ishrat Jahan

6.5k views

Ishrat Jahan asked Oct 29, 2014

30 votes

1 answer

48

GATE IT 2007 | Question: 39
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 \quad ≡ R1→ R2, R1 → Loc$ $R1→ Loc, Loc→ R2 \quad ≡ R1→ R2$ ... RHS be the same as executing the LHS irrespective of the instructions that follow ? i and iii i and iv ii and iii ii and iv

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→...

Ishrat Jahan

6.0k views

Ishrat Jahan asked Oct 29, 2014

30 votes

2 answers

49

GATE IT 2007 | Question: 38
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$-input NAND gates. $(a.b).c + (a'.c).d + (b.c).d + a. d$ What is the function finally ... $a' + b' + c' + d'$ $a' + b + c' + d'$ $a' + b' + c + d'$

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...

Ishrat Jahan

6.3k views

Ishrat Jahan asked Oct 29, 2014

16 votes

3 answers

50

GATE IT 2007 | Question: 37
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, 24, 2, 63, 5, 82,17, 24.$ Which of the following memory blocks will not be in the cache at the end of the sequence ? $3$ $18$ $20$ $30$

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, ...

Ishrat Jahan

8.0k views

Ishrat Jahan asked Oct 29, 2014

31 votes

2 answers

51

GATE IT 2007 | Question: 36
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_1$ and $D_2$. $D_1$ uses $30\%$ more cycles for fixed point unit but $30\%$ less cycles for floating ... $D_1 > D > D_2$ $D_2 > D > D_1$ $D > D_2 > D_1$ $D > D_1 > D_2$

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...

Ishrat Jahan

5.9k views

Ishrat Jahan asked Oct 29, 2014

7 votes

1 answer

52

GATE IT 2007 | Question: 35
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 scope facilitates w1 bindings. Dynamic scope requires w2 bindings. Early bindings w3 ... , decrease, increase Late, early, increase, decrease Late, early, decrease, increase Early, late, increase, decrease

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...

Ishrat Jahan

5.2k views

Ishrat Jahan asked Oct 29, 2014

15 votes

3 answers

53

GATE IT 2007 | Question: 34, UGCNET-Dec2012-III: 52
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; call f(); } procedure f() { int i = 20; call g (); } procedure g() { print i; } Let $x$ be the ... . Then, $x$ and $y$ are: $x=10, y=20$ $x=20, y=10$ $x=10, y=10$ $x=20, y=20$

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; ...

Ishrat Jahan

7.6k views

Ishrat Jahan asked Oct 29, 2014

25 votes

1 answer

54

GATE IT 2007 | Question: 33
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. int i ; program main () { int j = 60; i = 50; call f (i, j); print i, j; } procedure f (x, y) { i = 100; x ... :$ i = 100, j = 60$ Call by value : $i = 100, j = 60$; Call by reference :$ i = 10, j = 70$

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. ...

Ishrat Jahan

8.5k views

Ishrat Jahan asked Oct 29, 2014

25 votes

2 answers

55

GATE IT 2007 | Question: 32
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 */ void flagError (); int main () { int c, m, n, r; while ((c = getchar ()) != EOF) { if ( ... is the output of the program for the following input? $5 \ 2 \ * \ 3 \ 3 \ 2 \ + * +$ $15$ $25$ $30$ $150$

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...

Ishrat Jahan

6.9k views

Ishrat Jahan asked Oct 29, 2014

32 votes

5 answers

56

GATE IT 2007 | Question: 31
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 == 0 || a [i] < 0 || a [i] < a [ ... } if (sum > maxsum) maxsum = sum ; printf ("%d\n", maxsum); } What is the value printed out when this program is executed? $9$ $8$ $7$ $6$

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 =...

Ishrat Jahan

10.8k views

Ishrat Jahan asked Oct 29, 2014

41 votes

11 answers

57

GATE IT 2007 | Question: 30
Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: $isEmpty (Q)$ - returns true if the queue is empty, false otherwise. $delete (Q)$ - deletes the element at the front of the queue ... the front of the queue $Q$ and inserts it at the rear keeping the other elements in the same order Empties the queue $Q$

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

Ishrat Jahan

16.3k views

Ishrat Jahan asked Oct 29, 2014

174 votes

13 answers

58

GATE IT 2007 | Question: 29
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 given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value $60$? $35$ $64$ $128$ $5040$

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...

Ishrat Jahan

39.3k views

Ishrat Jahan asked Oct 29, 2014

62 votes

11 answers

59

GATE IT 2007 | Question: 28
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 collides with an existing one exceed $0.5$. $5$ $6$ $7$ $10$

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...

Ishrat Jahan

29.3k views

Ishrat Jahan asked Oct 29, 2014

49 votes

5 answers

60

GATE IT 2007 | Question: 27
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 integers can be passed as a parameter to the function, consider the following ... values of $n \geq 1$. Which one of the following options is true of the above? i and iii i and iv ii and iii ii and iv

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...

Ishrat Jahan

13.0k views

Ishrat Jahan asked Oct 29, 2014

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true