Dark Mode

Recent questions tagged gatecse-2007

64 votes

15 answers

1

GATE CSE 2007 | Question: 15, ISRO2016-26
Consider the following segment of C-code: int j, n; j = 1; while (j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any $n > 0$ is: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$

Arjun asked in Algorithms Jul 6, 2016

by Arjun

36.9k views

30 votes

2 answers

2

GATE CSE 2007 | Question: 73
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... the execution of the instruction INC R3 , what return address will be pushed on to the stack? $1005$ $1020$ $1024$ $1040$

go_editor asked in CO and Architecture Apr 23, 2016

9.9k views

35 votes

5 answers

3

GATE CSE 2007 | Question: 72
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... is word addressable. After the execution of this program, the content of memory location $2010$ is: $100$ $101$ $102$ $110$

go_editor asked in CO and Architecture Apr 23, 2016

9.4k views

27 votes

3 answers

4

GATE CSE 2007 | Question: 75
Consider the following Finite State Automaton: The minimum state automaton equivalent to the above FSA has the following number of states: $1$ $2$ $3$ $4$

go_editor asked in Theory of Computation Apr 23, 2016

8.4k views

29 votes

2 answers

5

GATE CSE 2007 | Question: 77
Suppose the letters $a, \,b, \,c, \,d, \,e, \,f$ have probabilities $\dfrac{1}{2}, \dfrac{1}{4}, \dfrac{1}{8}, \dfrac{1}{16}, \dfrac{1}{32}, \dfrac{1}{32}$, respectively. What is the average length of the Huffman code for the letters $a, \,b, \,c, \,d, \,e, \,f$? $3$ $2.1875$ $2.25$ $1.9375$

go_editor asked in Algorithms Apr 23, 2016

14.1k views

29 votes

4 answers

6

GATE CSE 2007 | Question: 79
Consider the CFG with $\left\{S, A, B\right\}$ as the non-terminal alphabet, $\{a, b\}$ as the terminal alphabet, $S$ as the start symbol and the following set of production rules: $S \rightarrow aB$ $S \rightarrow bA$ $B \rightarrow b$ ... $B \rightarrow aBB$ $S \rightarrow bAA$ For the string $aabbab$, how many derivation trees are there? $1$ $2$ $3$ $4$

go_editor asked in Compiler Design Apr 23, 2016

8.3k views

41 votes

5 answers

7

GATE CSE 2007 | Question: 81
Consider a machine with a byte addressable main memory of $2^{16}$ bytes. Assume that a direct mapped data cache consisting of $32$ lines of $64$ bytes each is used in the system. A $50$ x $50$ two-dimensional array of bytes is stored in the main memory starting from memory ... time? line $4$ to line $11$ line $4$ to line $12$ line $0$ to line $7$ line $0$ to line $8$

go_editor asked in CO and Architecture Apr 23, 2016

10.0k views

16 votes

4 answers

8

GATE CSE 2007 | Question: 83
A process, has been allocated $3$ ... above reference string, how many more page faults occur with LRU than with the optimal page replacement policy? $0$ $1$ $2$ $3$

go_editor asked in Operating System Apr 23, 2016

6.5k views

36 votes

5 answers

9

GATE CSE 2007 | Question: 85
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move to either $(i + 1, j)$ or $(i,j + 1)$. Suppose that the robot is not allowed to traverse the ... $^{20}\mathrm{C}_{10} - ^{8}\mathrm{C}_{4}\times ^{11}\mathrm{C}_{5}$

go_editor asked in Combinatory Apr 23, 2016

9.4k views

21 votes

7 answers

10

GATE CSE 2007 | Question: 5
Consider the DAG with $V = \{1,2,3,4,5,6\}$ shown below. Which of the following is not a topological ordering? $1$ $2$ $3$ $4$ $5$ $6$ $1$ $3$ $2$ $4$ $5$ $6$ $1$ $3$ $2$ $4$ $6$ $5$ $3$ $2$ $4$ $1$ $6$ $5$

pC asked in Algorithms Dec 21, 2015

by pC

7.7k views

97 votes

11 answers

11

GATE CSE 2007 | Question: 59
Information about a collection of students is given by the relation $\text{studInfo(}\underline{\text{studId}},\text{ name, sex)}$. The relation $\text{enroll(}{\text{studId}},{\text{ courseId}})$ gives which student has enrolled for ... Courses in which a proper subset of female students are enrolled. Courses in which only male students are enrolled. None of the above

Aravind asked in Databases Oct 4, 2014

20.4k views

48 votes

8 answers

12

GATE CSE 2007 | Question: 84
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move to either $(i + 1, j)$ or $(i,j + 1)$. How many distinct paths are there for the ... $(10,10)$ starting from the initial position $(0,0)$? $^{20}\mathrm{C}_{10}$ $2^{20}$ $2^{10}$ None of the above

Kathleen asked in Combinatory Sep 21, 2014

12.5k views

16 votes

4 answers

13

GATE CSE 2007 | Question: 82
A process has been allocated $3$ page frames. Assume that none of the pages of the process are available in the memory initially. The process makes the following sequence of page references (reference string): $\mathbf{1, 2, 1, 3, 7, 4, 5, 6, 3, 1}$ If optimal page replacement policy is used, how many page faults occur for the above reference string? $7$ $8$ $9$ $10$

Kathleen asked in Operating System Sep 21, 2014

9.4k views

93 votes

10 answers

14

GATE CSE 2007 | Question: 80
Consider a machine with a byte addressable main memory of $2^{16}$ bytes. Assume that a direct mapped data cache consisting of $32$ lines of $64$ bytes each is used in the system. A $50 \times 50$ two-dimensional array of bytes is stored in the main ... data cache do not change in between the two accesses. How many data misses will occur in total? $48$ $50$ $56$ $59$

Kathleen asked in CO and Architecture Sep 21, 2014

32.3k views

27 votes

2 answers

15

GATE CSE 2007 | Question: 78
Consider the CFG with $\left\{S, A, B\right\}$ as the non-terminal alphabet, $\{a, b\}$ as the terminal alphabet, $S$ as the start symbol and the following set of production rules: $S \rightarrow aB$ $S \rightarrow bA$ ... $S \rightarrow bAA$ Which of the following strings is generated by the grammar? $aaaabb$ $aabbbb$ $aabbab$ $abbbba$

Kathleen asked in Compiler Design Sep 21, 2014

10.9k views

29 votes

1 answer

16

GATE CSE 2007 | Question: 76
Suppose the letters $a, \,b, \,c, \,d, \,e, \,f$ have probabilities $\frac{1}{2}, \frac{1}{4}, \frac{1}{8}, \frac{1}{16}, \frac{1}{32}, \frac{1}{32}$, respectively. Which of the following is the Huffman code for the letter $a, \,b, \,c, \,d, \,e, \,f$? $0$ ... $011$, $010$, $001$, $000$ $11$, $10$, $01$, $001$, $0001$, $0000$ $110$, $100$, $010$, $000$, $001$, $111$

Kathleen asked in Algorithms Sep 21, 2014

10.8k views

43 votes

6 answers

17

GATE CSE 2007 | Question: 74
Consider the following Finite State Automaton: The language accepted by this automaton is given by the regular expression $b^*ab^*ab^*ab^*$ $(a + b)^*$ $b^*a(a+b)^*$ $b^*ab^*ab^*$

Kathleen asked in Theory of Computation Sep 21, 2014

13.3k views

54 votes

5 answers

18

GATE CSE 2007 | Question: 71
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... word addressable. The number of memory references for accessing the data in executing the program completely is $10$ $11$ $20$ $21$

Kathleen asked in CO and Architecture Sep 21, 2014

22.0k views

27 votes

4 answers

19

GATE CSE 2007 | Question: 70
Match the following: ... $\text{P - 1, Q - 4, R - 2, S - 5}$ $\text{P - 2, Q - 4, R - 1, S - 3}$

Kathleen asked in Computer Networks Sep 21, 2014

13.8k views

56 votes

10 answers

20

GATE CSE 2007 | Question: 69
The distance between two stations $M$ and $N$ is $L$ kilometers. All frames are $K$ bits long. The propagation delay per kilometer is $t$ seconds. Let $R$ bits/second be the channel capacity. Assuming that the processing delay is negligible, the $\text{minimum}$ number ... $\lceil \log_2 \frac{2LtR +K}{K} \rceil$ $\lceil \log_2 \frac{2LtR +2K}{2K} \rceil$

Kathleen asked in Computer Networks Sep 21, 2014

17.9k views

27 votes

4 answers

21

GATE CSE 2007 | Question: 68, ISRO2016-73
The message $11001001$ is to be transmitted using the CRC polynomial $x^3 +1$ to protect it from errors. The message that should be transmitted is: $11001001000$ $11001001011$ $11001010$ $110010010011$

Kathleen asked in Computer Networks Sep 21, 2014

33.7k views

60 votes

13 answers

22

GATE CSE 2007 | Question: 67, ISRO2016-72
The address of a class $\text{B}$ host is to be split into subnets with a $6\;\text{-bit}$ subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet? $62$ subnets and $262142$ hosts. $64$ subnets and $262142$ hosts. $62$ subnets and $1022$ hosts. $64$ subnets and $1024$ hosts.

Kathleen asked in Computer Networks Sep 21, 2014

35.5k views

11 votes

1 answer

23

GATE CSE 2007 | Question: 66, ISRO2016-71
In a token ring network the transmission speed is $10^7$ bps and the propagation speed is $200\;\text{meters}/\mu \text{s}.$ The $1$-bit delay in this network is equivalent to: $500$ meters of cable. $200$ meters of cable. $20$ meters of cable. $50$ meters of cable.

Kathleen asked in Computer Networks Sep 21, 2014

16.9k views

32 votes

7 answers

24

GATE CSE 2007 | Question: 65
There are $n$ stations in slotted LAN. Each station attempts to transmit with a probability $p$ in each time slot. What is the probability that ONLY one station transmits in a given time slot? $np(1-p)^{n-1}$ $(1-p)^{n-1}$ $p(1-p)^{n-1}$ $1-(1-p)^{n-1}$

Kathleen asked in Computer Networks Sep 21, 2014

13.8k views

27 votes

5 answers

25

GATE CSE 2007 | Question: 64
Consider the following schedules involving two transactions. Which one of the following statements is TRUE? $S_1 :r_1(X); r_1(Y); r_2(X); r_2(Y); w_2(Y); w_1(X)$ ... is not conflict serializable. $S_1$ is not conflict serializable and $S_2$ is conflict serializable. Both $S_1$ and $S_2$ are not conflict serializable.

Kathleen asked in Databases Sep 21, 2014

9.4k views

44 votes

6 answers

26

GATE CSE 2007 | Question: 63, ISRO2016-59
The order of a leaf node in a $B^+$ - tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is $1K\;\text{bytes}$, data record pointer is $7\;\text{bytes}$ long, the value field is $9\;\text{bytes}$ long and a block pointer is $6 \;\text{bytes}$ long, what is the order of the leaf node? $63$ $64$ $67$ $68$

Kathleen asked in Databases Sep 21, 2014

23.3k views

70 votes

6 answers

27

GATE CSE 2007 | Question: 62, UGCNET-June2014-II: 47
Which one of the following statements is $\text{FALSE}$? Any relation with two attributes is in $\text{BCNF}$ A relation in which every key has only one attribute is in $\text{2NF}$ A prime attribute can be transitively dependent on ... a $\text{3 NF}$ relation A prime attribute can be transitively dependent on a key in a $\text{BCNF}$ relation

Kathleen asked in Databases Sep 21, 2014

24.0k views

69 votes

5 answers

28

GATE CSE 2007 | Question: 61
Consider the table employee(empId, name, department, salary) and the two queries $Q_1, \, Q_2$ below. Assuming that department $5$ has more than one employee, and we want to find the employees who get higher salary than anyone in the department $5,$ ... $Q_1$ and $Q_2$ produce the same answer Neither $Q_1$ nor $Q_2$ is the correct query

Kathleen asked in Databases Sep 21, 2014

26.6k views

95 votes

6 answers

29

GATE CSE 2007 | Question: 60
Consider the relation employee(name, sex, supervisorName) with name as the key, supervisorName gives the name of the supervisor of the employee under consideration. What does the following Tuple Relational Calculus query produce? ... immediate male subordinates. Names of employees with no immediate female subordinates. Names of employees with a female supervisor.

Kathleen asked in Databases Sep 21, 2014

23.4k views

57 votes

10 answers

30

GATE CSE 2007 | Question: 58
Two processes, $P1$ and $P2$, need to access a critical section of code. Consider the following synchronization construct used by the processes: /* P1 */ while (true) { wants1 = true; while (wants2 == true); /* Critical ... waiting. It requires that processes enter the critical section in strict alteration. It does not prevent deadlocks, but ensures mutual exclusion.

Kathleen asked in Operating System Sep 21, 2014

27.3k views

Page:

1
2
3
next »

Recent questions tagged gatecse-2007