Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by ankitrokdeonsns
56
votes
1
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$
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$$110010010...
34.1k
views
answered
Feb 2, 2015
Computer Networks
gatecse-2007
computer-networks
error-detection
crc-polynomial
normal
isro2016
+
–
102
votes
2
GATE CSE 2004 | Question: 40
Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among $\text{union, intersection, membership, cardinality}$ will be the slowest? $\text{union}$ only $\text{intersection, membership}$ $\text{membership, cardinality}$ $\text{union, intersection}$
Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among $\text{union, intersection, membership, cardinality}$ wil...
19.3k
views
answered
Feb 1, 2015
DS
gatecse-2004
data-structures
linked-list
normal
+
–
5
votes
3
GATE IT 2004 | Question: 69
Consider the following program module: int module1 (int x, int y) { while (x! = y) { if (x > y) x = x - y, else y = y - x; } return x; } What is Cyclomatic complexity of the above module? 1 2 3 4
Consider the following program module:int module1 (int x, int y) { while (x! = y) { if (x y) x = x - y, else y = y - x; } return x; }What is Cyclomatic complexity of the...
4.0k
views
answered
Jan 30, 2015
IS&Software Engineering
gateit-2004
is&software-engineering
cyclomatic-complexity
normal
+
–
1
votes
4
GATE IT 2005 | Question: 20
The Function Point (FP) calculated for a software project are often used to obtain an estimate of Lines of Code (LOC) required for that project. Which of the following statements is FALSE in this context. The relationship between FP and LOC depends ... + provides approximately 1.6 times the functionality of a single LOC of FORTRAN FP and LOC are not related to each other
The Function Point (FP) calculated for a software project are often used to obtain an estimate of Lines of Code (LOC) required for that project. Which of the following st...
5.2k
views
answered
Jan 30, 2015
IS&Software Engineering
gateit-2005
is&software-engineering
function-point-metric
+
–
20
votes
5
GATE IT 2005 | Question: 77
Assume that "host1.mydomain.dom" has an IP address of $145.128.16.8$. Which of the following options would be most appropriate as a subsequence of steps in performing the reverse lookup of $145.128.16.8$ ? In the following options "NS" is ... -addr.arpa domains Directly query a NS for $145.$in-addr.arpa and then a NS for $128.145.$in-addr.arpa domains
Assume that "host1.mydomain.dom" has an IP address of $145.128.16.8$. Which of the following options would be most appropriate as a subsequence of steps in performing the...
10.1k
views
answered
Jan 12, 2015
Computer Networks
gateit-2005
computer-networks
normal
application-layer-protocols
+
–
57
votes
6
GATE CSE 2000 | Question: 1.18, ISRO2015-25
The number of tokens in the following C statement is printf("i=%d, &i=%x", i, &i); $3$ $26$ $10$ $21$
The number of tokens in the following C statement isprintf("i=%d, &i=%x", i, &i);$3$$26$$10$$21$
36.7k
views
answered
Nov 23, 2014
Compiler Design
gatecse-2000
compiler-design
compiler-tokenization
easy
isro2015
+
–
0
votes
7
GATE CSE 2003 | Question: 16
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar? Removing left recursion alone Factoring the grammar alone Removing left recursion and factoring the grammar None of the above
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?Removing left recursion aloneFactoring the grammar aloneRemoving left recursion and factor...
27.3k
views
answered
Nov 23, 2014
Compiler Design
gatecse-2003
compiler-design
parsing
easy
+
–
30
votes
8
GATE IT 2004 | Question: 10
What is the minimum size of ROM required to store the complete truth table of an $8-bit \times 8-bit$ multiplier? $32 K \times 16$ bits $64 K \times 16$ bits $16 K \times 32$ bits $64 K \times 32$ bits
What is the minimum size of ROM required to store the complete truth table of an $8-bit \times 8-bit$ multiplier?$32 K \times 16$ bits$64 K \times 16$ bits$16 K \times 32...
6.5k
views
answered
Nov 23, 2014
Digital Logic
gateit-2004
digital-logic
normal
rom
+
–
6
votes
9
GATE CSE 2003 | Question: 59
Consider the syntax directed definition shown below. ... $t_1 = Y+Z; X=t_1$ $t_1 =Y; t_2=t_1 +Z; X=t_2$ $t_1 =Y; t_2=Z; t_3=t_1+t_2; X=t_3$
Consider the syntax directed definition shown below.$$\begin{array}{ll}S \rightarrow \mathbf{ id :=} E&\qquad \{gen(\mathbf{ id}.place = E.place;);\}\\E \rightarrow E_1 +...
8.6k
views
answered
Nov 23, 2014
Compiler Design
gatecse-2003
compiler-design
target-code-generation
normal
+
–
–3
votes
10
GATE CSE 2006 | Question: 32, ISRO2016-35
Consider the following statements about the context free grammar $G = \left \{ S \rightarrow SS, S \rightarrow ab, S \rightarrow ba, S \rightarrow \epsilon \right \} $ $G$ is ambiguous $G$ produces all strings with equal number of $a$'s ... combination below expresses all the true statements about $G$? I only I and III only II and III only I, II and III
Consider the following statements about the context free grammar$$G = \left \{ S \rightarrow SS, S \rightarrow ab, S \rightarrow ba, S \rightarrow \epsilon \right \} $$$G...
28.8k
views
answered
Nov 23, 2014
Compiler Design
gatecse-2006
compiler-design
context-free-language
normal
isro2016
+
–
56
votes
11
GATE CSE 2004 | Question: 9
Consider a program $P$ that consists of two source modules $M_1$ and $M_2$ contained in two different files. If $M_1$ contains a reference to a function defined in $M_2$ the reference will be resolved at Edit time Compile time Link time Load time
Consider a program $P$ that consists of two source modules $M_1$ and $M_2$ contained in two different files. If $M_1$ contains a reference to a function defined in $M_2$ ...
6.5k
views
answered
Nov 23, 2014
Compiler Design
gatecse-2004
compiler-design
easy
linker
+
–
1
votes
12
GATE CSE 2004 | Question: 38, ISRO2009-27
Assume that the operators $+, -, \times$ are left associative and $^\hat{}$ is right associative. The order of precedence (from highest to lowest) is $ \ ^\hat{}, \times, +, -$ ... $-+a\times bc \ \ \hat{} \ \ \ \hat{} \ \ def$
Assume that the operators $+, -, \times$ are left associative and $^\hat{}$ is right associative. The order of precedence (from highest to lowest) is $ \ ^\hat{}, \times,...
12.9k
views
answered
Nov 23, 2014
DS
gatecse-2004
stack
isro2009
infix-prefix
+
–
30
votes
13
GATE CSE 1998 | Question: 1.26
Which of the following statements is true? SLR parser is more powerful than LALR LALR parser is more powerful than Canonical LR parser Canonical LR parser is more powerful than LALR parser The parsers SLR, Canonical CR, and LALR have the same power
Which of the following statements is true?SLR parser is more powerful than LALRLALR parser is more powerful than Canonical LR parserCanonical LR parser is more powerful t...
12.8k
views
answered
Nov 23, 2014
Compiler Design
gate1998
compiler-design
parsing
normal
+
–
27
votes
14
GATE CSE 1998 | Question: 1.28
A linker reads four modules whose lengths are $200, 800, 600$ and $500$ words, respectively. If they are loaded in that order, what are the relocation constants? $0, 200, 500, 600$ $0, 200, 1000, 1600$ $200, 500, 600, 800$ $200, 700, 1300, 2100$
A linker reads four modules whose lengths are $200, 800, 600$ and $500$ words, respectively. If they are loaded in that order, what are the relocation constants?$0, 200, ...
5.9k
views
answered
Nov 23, 2014
Compiler Design
gate1998
compiler-design
runtime-environment
normal
+
–
9
votes
15
GATE CSE 2006 | Question: 55
Consider these two functions and two statements S1 and S2 about them. int work1(int *a, int i, int j) { int x = a[i+2]; a[j] = x+1; return a[i+2] - 3; } int work2(int *a, int i, int j) { int t1 = i+2; int t2 = a[t1]; a[j] = ... CPU time) of work2 compared to work1 S1 is false and S2 is false S1 is false and S2 is true S1 is true and S2 is false S1 is true and S2 is true
Consider these two functions and two statements S1 and S2 about them. int work1(int *a, int i, int j) { int x = a[i+2]; a[j] = x+1; return a[i+2] - 3; }int work2(int *a, ...
10.5k
views
answered
Nov 23, 2014
Compiler Design
gatecse-2006
compiler-design
code-transformation
normal
code-optimization
+
–
–5
votes
16
GATE CSE 2014 Set 2 | Question: 39
Consider the expression tree shown. Each leaf represents a numerical value, which can either be $0$ or $1$. Over all possible choices of the values at the leaves, the maximum possible value of the expression represented by the tree is ___.
Consider the expression tree shown. Each leaf represents a numerical value, which can either be $0$ or $1$. Over all possible choices of the values at the leaves, the max...
9.5k
views
answered
Nov 23, 2014
Compiler Design
gatecse-2014-set2
compiler-design
normal
expression-evaluation
numerical-answers
+
–
57
votes
17
GATE CSE 2011 | Question: 19
The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense? Finite state automata Deterministic pushdown automata Non-deterministic pushdown automata Turing machine
The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?Finite s...
13.8k
views
answered
Nov 23, 2014
Compiler Design
gatecse-2011
compiler-design
lexical-analysis
easy
+
–
0
votes
18
GATE CSE 2011 | Question: 27
Consider two binary operators $\text{ } \uparrow \text{'}$ and $\text{ } \downarrow \text{'}$ with the precedence of operator $\downarrow$ being lower than that of the operator $\uparrow$. Operator $\uparrow$ is right associative while operator ... Which one of the following represents the parse tree for expression $(7 \downarrow 3 \uparrow 4 \uparrow 3 \downarrow 2)$
Consider two binary operators $\text{‘} \uparrow \text{’}$ and $\text{‘} \downarrow \text{’}$ with the precedence of operator $\downarrow$ being lower than that ...
7.2k
views
answered
Nov 23, 2014
Compiler Design
gatecse-2011
compiler-design
parsing
normal
+
–
3
votes
19
GATE CSE 2011 | Question: 36
Consider evaluating the following expression tree on a machine with load-store architecture in which memory can be accessed only through load and store instructions. The variables $a, b, c, d,$ and $e$ are initially stored in memory. The binary operators used ... in memory, what is the minimum number of registers needed to evaluate this expression? $2$ $9$ $5$ $3$
Consider evaluating the following expression tree on a machine with load-store architecture in which memory can be accessed only through load and store instructions. The ...
15.0k
views
answered
Nov 23, 2014
Compiler Design
gatecse-2011
compiler-design
register-allocation
normal
+
–
–2
votes
20
GATE CSE 2012 | Question: 52
For the grammar below, a partial $LL(1)$ parsing table is also presented along with the grammar. Entries that need to be filled are indicated as $E1, E2,$ and $E3$. $\varepsilon$ is the empty string, \$ indicates end of input, and, $ ... $ \text{FOLLOW}(A) = \{a, b\} $ $ \text{FOLLOW}(B) =\{a, b\} $
For the grammar below, a partial $LL(1)$ parsing table is also presented along with the grammar. Entries that need to be filled are indicated as $E1, E2,$ and $E3$. $\var...
5.0k
views
answered
Nov 23, 2014
Compiler Design
gatecse-2012
compiler-design
parsing
normal
+
–
13
votes
21
GATE CSE 1994 | Question: 3.5
Match the following items ...
Match the following items$$\begin{array}{ll|ll}\hline \text{(i)} & \text{Backus-Naur form} & \text{(a)} & \text{Regular expressions} \\\hline \text{(ii)} & \text{Lexical...
5.4k
views
answered
Nov 22, 2014
Compiler Design
gate1994
compiler-design
grammar
normal
match-the-following
+
–
16
votes
22
GATE CSE 2008 | Question: 27
Aishwarya studies either computer science or mathematics everyday. If she studies computer science on a day, then the probability that she studies mathematics the next day is $0.6$. If she studies mathematics on a day, then the probability that she studies computer ... what is the probability that she studies computer science on Wednesday? $0.24$ $0.36$ $0.4$ $0.6$
Aishwarya studies either computer science or mathematics everyday. If she studies computer science on a day, then the probability that she studies mathematics the next da...
7.8k
views
answered
Oct 25, 2014
Probability
gatecse-2008
probability
normal
conditional-probability
+
–
42
votes
23
GATE CSE 2000 | Question: 2.2
$E_{1}$ and $E_{2}$ are events in a probability space satisfying the following constraints: $Pr$\left ( E_{1} \right )$ = $Pr$\left ( E_{2} \right )$ $Pr$\left ( E_{1}\cup E_{2} \right )$ = $1$ $E_{1}$ and $E_{2}$ are independent The value of $Pr$\left ( E_{1} \right )$, the probability of the event $E_{1}$, is $0$ $\dfrac{1}{4}$ $\dfrac{1}{2}$ $1$
$E_{1}$ and $E_{2}$ are events in a probability space satisfying the following constraints:$Pr$$\left ( E_{1} \right )$ = $Pr$$\left ( E_{2} \right )$$Pr$$\left ( E_{1}\...
5.3k
views
answered
Oct 25, 2014
Probability
gatecse-2000
probability
easy
independent-events
+
–
48
votes
24
GATE CSE 2001 | Question: 2.4
Seven (distinct) car accidents occurred in a week. What is the probability that they all occurred on the same day? $\dfrac{1}{7^7}\\$ $\dfrac{1}{7^6}\\$ $\dfrac{1}{2^7}\\$ $\dfrac{7}{2^7}\\$
Seven (distinct) car accidents occurred in a week. What is the probability that they all occurred on the same day?$\dfrac{1}{7^7}\\$$\dfrac{1}{7^6}\\$$\dfrac{1}{2^7}\\$$\...
19.9k
views
answered
Oct 25, 2014
Probability
gatecse-2001
probability
normal
+
–
36
votes
25
GATE CSE 2002 | Question: 2.16
Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is $\frac{1}{16}$ $\frac{1}{8}$ $\frac{7}{8}$ $\frac{15}{16}$
Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is$\frac{1}{16}$$\frac{1}{8}$$\frac{7}{8}$$\frac{15}{16}$
10.6k
views
answered
Oct 25, 2014
Probability
gatecse-2002
probability
easy
binomial-distribution
+
–
42
votes
26
GATE CSE 2006 | Question: 21
For each element in a set of size $2n$, an unbiased coin is tossed. The $2n$ coin tosses are independent. An element is chosen if the corresponding coin toss was a head. The probability that exactly $n$ elements are chosen is $\frac{^{2n}\mathrm{C}_n}{4^n}$ $\frac{^{2n}\mathrm{C}_n}{2^n}$ $\frac{1}{^{2n}\mathrm{C}_n}$ $\frac{1}{2}$
For each element in a set of size $2n$, an unbiased coin is tossed. The $2n$ coin tosses are independent. An element is chosen if the corresponding coin toss was a head. ...
8.2k
views
answered
Oct 25, 2014
Probability
gatecse-2006
probability
binomial-distribution
normal
+
–
22
votes
27
GATE CSE 2004 | Question: 25
If a fair coin is tossed four times. What is the probability that two heads and two tails will result? $\frac{3}{8}$ $\frac{1}{2}$ $\frac{5}{8}$ $\frac{3}{4}$
If a fair coin is tossed four times. What is the probability that two heads and two tails will result?$\frac{3}{8}$$\frac{1}{2}$$\frac{5}{8}$$\frac{3}{4}$
5.7k
views
answered
Oct 25, 2014
Probability
gatecse-2004
probability
easy
+
–
41
votes
28
GATE CSE 2004 | Question: 78
Two $n$ bit binary strings, $S_1$ and $S_2$ are chosen randomly with uniform probability. The probability that the Hamming distance between these strings (the number of bit positions where the two strings differ) is equal to $d$ is $\dfrac{^{n}C_{d}}{2^{n}}$ $\dfrac{^{n}C_{d}}{2^{d}}$ $\dfrac{d}{2^{n}}$ $\dfrac{1}{2^{d}}$
Two $n$ bit binary strings, $S_1$ and $S_2$ are chosen randomly with uniform probability. The probability that the Hamming distance between these strings (the number of b...
7.5k
views
answered
Oct 25, 2014
Probability
gatecse-2004
probability
normal
uniform-distribution
+
–
53
votes
29
GATE CSE 2005 | Question: 52
A random bit string of length n is constructed by tossing a fair coin n times and setting a bit to 0 or 1 depending on outcomes head and tail, respectively. The probability that two such randomly generated strings are not identical is: $\frac{1}{2^n}$ $1 - \frac{1}{n}$ $\frac{1}{n!}$ $1 - \frac{1}{2^n}$
A random bit string of length n is constructed by tossing a fair coin n times and setting a bit to 0 or 1 depending on outcomes head and tail, respectively. The probabili...
8.7k
views
answered
Oct 25, 2014
Probability
gatecse-2005
probability
binomial-distribution
easy
+
–
13
votes
30
GATE CSE 1999 | Question: 2.1
Consider two events $E_1$ and $E_2$ such that probability of $E_1$, $P_r[E_1]=\frac{1}{2}$, probability of $E_2$, $P_r[E_{2}]=\frac{1}{3}$, and probability of $E_1$, and $E_2$, $P_r[E_1 \: and \: E_2] = \frac{1}{5}$. Which of the ... Events $E_1$ and $E_2$ are independent Events $E_1$ and $E_2$ are not independent $P_r \left[{E_1}\mid{E_2} \right] = \frac{4}{5}$
Consider two events $E_1$ and $E_2$ such that probability of $E_1$, $P_r[E_1]=\frac{1}{2}$, probability of $E_2$, $P_r[E_{2}]=\frac{1}{3}$, and probability of $E_1$, and ...
4.2k
views
answered
Oct 25, 2014
Probability
gate1999
probability
normal
independent-events
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register