Dark Mode

Recent activity by Vicky Bajoria

2 answers

1

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$

answered in CO and Architecture Apr 29, 2016

8.3k views

5 answers

2

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$

answered in CO and Architecture Apr 29, 2016

7.7k views

6 answers

3

GATE IT 2006 | Question: 63, ISRO2015-57
A router uses the following routing table: \begin{array}{|l|l|l|} \hline \textbf {Destination} & \textbf { Mask} & \textbf{Interface} \\\hline \text {144.16.0.0} & \text{255.255.0.0} & \text{eth$0$} \\\hline\text { ... address $144.16.68.117$ arrives at the router. On which interface will it be forwarded? eth$0$ eth$1$ eth$2$ eth$3$

commented in Computer Networks Nov 4, 2015

10.2k views

5 answers

4

GATE IT 2008 | Question: 36
Consider the following two finite automata. $M_1$ accepts $L_1$ and $M_2$ accepts $L_2$. $M_1$ $M_2$ Which one of the following is TRUE? $L_1 = L_2$ $L_1 \subset L_2$ $L_1 \cap L_{2}^{C} = \varnothing $ $L_1 \cup L_2 \neq L_1$

commented in Theory of Computation Mar 3, 2015

10.0k views

5 answers

5

GATE CSE 2006 | Question: 16, ISRO-DEC2017-27
Let S be an NP-complete problem and Q and R be two other problems not known to be in NP. Q is polynomial time reducible to S and S is polynomial-time reducible to R. Which one of the following statements is true? R is NP-complete R is NP-hard Q is NP-complete Q is NP-hard

commented in Algorithms Jan 31, 2015

16.4k views

10 answers

6

GATE CSE 2003 | Question: 38
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows: ... $(x, y)$ that satisfy the equations) is $0$ $1$ $2$ $3$

answered in Set Theory & Algebra Jan 29, 2015

5.6k views

1 answer

7

GATE CSE 2004 | Question: 13
Let $R_1 \left(\underline{A}, B, C\right)$ and $R_2\left(\underline{D}, E \right) $ be two relation schema, where the primary keys are shown underlined, and let C be a foreign key in $R_1$ referring to $R_2$. Suppose there is no violation of the above ... $\Pi_D \left(r_1 \bowtie_{C \neq D}r_2\right)$ $\Pi_C \left(r_1 \bowtie_{C = D}r_2\right)$

answered in Databases Jan 26, 2015

5.7k views

10 answers

8

GATE CSE 2014 Set 3 | Question: 28
An $IP$ router with a $\text{Maximum Transmission Unit (MTU)}$ of $1500$ bytes has received an $IP$ packet of size $4404\text{ bytes}$ with an $IP$ header of length $20\text{ bytes}$. The values of the relevant fields in the header of the third $IP$ ... $1,$ Datagram Length$: 1500;$ Offset$: 370$ $\text{MF bit}$: $0,$ Datagram Length$: 1424;$ Offset$: 2960$

commented in Computer Networks Jan 22, 2015

17.8k views

9 answers

9

GATE CSE 2014 Set 3 | Question: 14
You have an array of $n$ elements. Suppose you implement quicksort by always choosing the central element of the array as the pivot. Then the tightest upper bound for the worst case performance is $O(n^2)$ $O(n \log n)$ $\Theta(n\log n)$ $O(n^3)$

commented in Algorithms Jan 22, 2015

27.7k views

8 answers

10

GATE CSE 2014 Set 3 | Question: 12
Consider the following rooted tree with the vertex labeled $P$ as the root: The order in which the nodes are visited during an in-order traversal of the tree is $SQPTRWUV$ $SQPTUWRV$ $SQPTWUVR$ $SQPTRUWV$

commented in DS Jan 22, 2015

13.4k views

2 answers

11

GATE CSE 2014 Set 3 | Question: GA-10
Consider the equation: $(7526)_8 − (Y)_8 = (4364)_8$, where $(X)_N$ stands for $X$ to the base $N$. Find $Y$. $1634$ $1737$ $3142$ $3162$

commented in Quantitative Aptitude Jan 22, 2015

4.4k views

3 answers

12

GATE CSE 2014 Set 3 | Question: GA-4
Which number does not belong in the series below? $\qquad2, 5, 10, 17, 26, 37, 50, 64$ $17$ $37$ $64$ $26$

commented in Quantitative Aptitude Jan 22, 2015

2.2k views

4 answers

13

GATE CSE 2014 Set 2 | Question: 25
In the diagram shown below, $L1$ is an Ethernet LAN and $L2$ is a Token-Ring LAN. An $IP$ packet originates from sender $S$ and traverses to $R$, as shown. The links within each $\text{ISP}$ and across the two $\text{ISP}$s, are all ... $\text{TTL}$ field is $32$. The maximum possible value of the $\text{TTL}$ field when $R$ receives the datagram is _______.

commented in Computer Networks Jan 20, 2015

15.0k views

3 answers

14

GATE CSE 2014 Set 2 | Question: 29
Consider the following schedule S of transactions $T1, T2, T3, T4:$ ... S is not conflict-serializable but is recoverable S is both conflict-serializable and recoverable S is neither conflict-serializable not is it recoverable

commented in Databases Jan 20, 2015

24.6k views

5 answers

15

GATE CSE 2014 Set 2 | Question: 27
An IP machine $Q$ has a path to another $IP\ machine\ H$ via three $IP\ routers \ R1, R2,$ and $R3$. $Q-R1-R2-R3-H$ $H$ acts as an $\text{HTTP}\ server$, and $Q$ connects to $H$ via $\text{HTTP}$ and downloads a file. Session layer ... $R2$ alone? Only $I1$ and $I2$ Only $I1$ Only $I2$ and $I3$ Only $I3$ and $I4$

commented in Computer Networks Jan 20, 2015

12.2k views

8 answers

16

GATE CSE 2014 Set 2 | Question: GA-10
At what time between $6$ a. m. and $7$ a. m. will the minute hand and hour hand of a clock make an angle closest to $60^{\circ}$? $6: 22$ a.m. $6: 27$ a.m. $6: 38$ a.m. $6: 45$ a.m.

commented in Quantitative Aptitude Jan 20, 2015

8.5k views

5 answers

17

GATE CSE 2014 Set 1 | Question: 41
Consider the following C function in which size is the number of elements in the array E: int MyX(int *E, unsigned int size) { int Y = 0; int Z; int i, j, k; for(i = 0; i< size; i++) Y = Y + E[i]; for(i=0; i < size; ... in any sub-array of array E. sum of the maximum elements in all possible sub-arrays of array E. the sum of all the elements in the array E.

commented in Algorithms Jan 19, 2015

10.1k views

11 answers

18

GATE CSE 2014 Set 1 | Question: 12
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is $O(n^a\log^bn)$. Then the value of $a+10b$ is __________.

answered in DS Jan 18, 2015

19.5k views

4 answers

19

GATE CSE 2014 Set 1 | Question: 6
Let the function ... $\theta \in (\frac{\pi}{6},\frac{\pi}{3})$ such that $f'(\theta)\neq 0$ I only II only Both I and II Neither I nor II

commented in Calculus Jan 18, 2015

10.8k views

3 answers

20

GATE CSE 2014 Set 1 | Question: 3
Let $G=(V,E)$ be a directed graph where $V$ is the set of vertices and $E$ the set of edges. Then which one of the following graphs has the same strongly connected components as $G$ ? $G_1$ = $(V,E_1)$ ... $u$ to $v$ in $E\}$ $G_4$ = $(V_4,E)$ where $V_4$ is the set of vertices in $G$ which are not isolated

commented in DS Jan 18, 2015

14.1k views

3 answers

21

GATE CSE 2014 Set 1 | Question: 2
Suppose you break a stick of unit length at a point chosen uniformly at random. Then the expected length of the shorter stick is ________ .

commented in Probability Jan 18, 2015

14.7k views

3 answers

22

GATE CSE 2014 Set 1 | Question: GA-2
Choose the most appropriate word from the options given below to complete the following sentence. She could not understand the judges awarding her the first prize, because she thought that her performance was quite _________. superb medium mediocre exhilarating

commented in Verbal Aptitude Jan 18, 2015

3.1k views

6 answers

23

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 :

commented in Theory of Computation Jan 17, 2015

11.4k views

4 answers

24

GATE CSE 2005 | Question: 15
Consider the following circuit. Which one of the following is TRUE? $f$ is independent of $x$ $f$ is independent of $y$ $f$ is independent of $z$ None of $x, y, z$ is redundant

commented in Digital Logic Jan 16, 2015

7.1k views

4 answers

25

GATE IT 2006 | Question: 79
A pipelined processor uses a 4-stage instruction pipeline with the following stages: Instruction fetch (IF), Instruction decode (ID), Execute (EX) and Writeback (WB). The arithmetic operations as well as the load and store operations are carried out in the EX ... is used. The number of clock cycles required to complete the sequence of instructions is $10$ $12$ $14$ $16$

commented in CO and Architecture Jan 16, 2015

13.8k views

9 answers

26

GATE IT 2006 | Question: 69
A program on machine $X$ attempts to open a $UDP$ connection to port $5376$ on a machine $Y$, and a $TCP$ connection to port $8632$ on machine $Z$. However, there are no applications listening at the corresponding ports on $Y$ and $Z$. An $ICMP$ Port Unreachable error will be generated by $Y$ but not $Z$ $Z$ but not $Y$ Neither $Y$ nor $Z$ Both $Y$ and $Z$

commented in Computer Networks Jan 16, 2015

11.7k views

8 answers

27

GATE IT 2006 | Question: 68
On a wireless link, the probability of packet error is $0.2$. A stop-and-wait protocol is used to transfer data across the link. The channel condition is assumed to be independent of transmission to transmission. What is the average number of transmission attempts required to transfer $100$ packets? $100$ $125$ $150$ $200$

answered in Computer Networks Jan 16, 2015

10.6k views

5 answers

28

GATE IT 2006 | Question: 67
A link of capacity $100$ $\text{Mbps}$ is carrying traffic from a number of sources. Each source generates an on-off traffic stream; when the source is on, the rate of traffic is $10$ $\text{Mbps}$, and when the source is off, the rate of traffic is zero. The duty cycle, which ... $\text{and}$ $30$ $12$ $\text{and}$ $25$ $5$ $\text{and}$ $33$ $15$ $\text{and}$ $22$

answered in Computer Networks Jan 16, 2015

9.0k views

3 answers

29

GATE IT 2006 | Question: 61
In a database file structure, the search key field is $9$ $bytes$ long, the block size is $512$ $bytes$, a record pointer is $7$ $bytes$ and a block pointer is $6$ $bytes$. The largest possible order of a non-leaf node in a$ B+$ tree implementing this file structure is $23$ $24$ $34$ $44$

comment edited in Databases Jan 15, 2015

5.6k views

6 answers

30

GATE IT 2006 | Question: 46
Which of the following is the correct decomposition of the directed graph given below into its strongly connected components? $\left \{ P, Q, R, S \right \}, \left \{ T \right \},\left \{ U \right \}, \left \{ V \right \}$ ... $\left \{ P, Q, R, S, T, U, V \right \}$

answered in Algorithms Jan 14, 2015

9.6k views