Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
vnc
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by vnc
6
votes
1
GATE CSE 1994 | Question: 3.11
State True or False with reason Logical data independence is easier to achieve than physical data independence.
State True or False with reasonLogical data independence is easier to achieve than physical data independence.
7.6k
views
answered
Jan 2, 2017
Databases
gate1994
databases
normal
data-independence
true-false
+
–
19
votes
2
GATE CSE 2002 | Question: 1.8
"If $X$ then $Y$ unless $Z$" is represented by which of the following formulas in propositional logic? ("$\neg$" is negation, "$\land$" is conjunction, and "$\rightarrow$" is implication) $(X\land \neg Z) \rightarrow Y$ $(X \land Y) \rightarrow \neg Z$ $X \rightarrow(Y\land \neg Z)$ $(X \rightarrow Y)\land \neg Z$
"If $X$ then $Y$ unless $Z$" is represented by which of the following formulas in propositional logic? ("$\neg$" is negation, "$\land$" is conjunction, and "$\rightarrow$...
14.6k
views
answered
Dec 21, 2016
Mathematical Logic
gatecse-2002
mathematical-logic
normal
propositional-logic
+
–
80
votes
3
GATE CSE 2016 Set 2 | Question: 01
Consider the following expressions: $false$ $Q$ $true$ $P\vee Q$ $\neg Q\vee P$ The number of expressions given above that are logically implied by $P \wedge (P \Rightarrow Q)$ is ___________.
Consider the following expressions:$false$$Q$$true$$P\vee Q$$\neg Q\vee P$The number of expressions given above that are logically implied by $P \wedge (P \Rightarrow Q)$...
19.7k
views
answered
Dec 21, 2016
Mathematical Logic
gatecse-2016-set2
mathematical-logic
normal
numerical-answers
propositional-logic
+
–
6
votes
4
GATE CSE 1996 | Question: 2.13, ISRO2016-28
The average number of key comparisons required for a successful search for sequential search on $n$ items is $\frac{n}{2}$ $\frac{n-1}{2}$ $\frac{n+1}{2}$ None of the above
The average number of key comparisons required for a successful search for sequential search on $n$ items is$\frac{n}{2}$$\frac{n-1}{2}$$\frac{n+1}{2}$None of the above
31.4k
views
answered
Dec 10, 2016
Algorithms
gate1996
algorithms
easy
isro2016
searching
+
–
13
votes
5
GATE IT 2005 | Question: 27
Which of the following statements is TRUE about CSMA/CD: IEEE $802.11$ wireless LAN runs CSMA/CD protocol Ethernet is not based on CSMA/CD protocol CSMA/CD is not suitable for a high propagation delay network like satellite network There is no contention in a CSMA/CD network
Which of the following statements is TRUE about CSMA/CD:IEEE $802.11$ wireless LAN runs CSMA/CD protocolEthernet is not based on CSMA/CD protocolCSMA/CD is not suitable f...
13.3k
views
answered
Dec 5, 2016
Computer Networks
gateit-2005
computer-networks
congestion-control
csma-cd
normal
+
–
29
votes
6
GATE IT 2006 | Question: 18
$\textsf{HELO}$ and $\textsf{PORT}$, respectively, are commands from the protocols: $\textsf{FTP}$ and $\textsf{HTTP}$ $\textsf{TELNET}$ and $\textsf{POP3}$ $\textsf{HTTP}$ and $\textsf{TELNET}$ $\textsf{SMTP}$ and $\textsf{FTP}$
$\textsf{HELO}$ and $\textsf{PORT}$, respectively, are commands from the protocols:$\textsf{FTP}$ and $\textsf{HTTP}$$\textsf{TELNET}$ and $\textsf{POP3}$$\textsf{HTTP}$ ...
8.2k
views
answered
Dec 4, 2016
Computer Networks
gateit-2006
computer-networks
application-layer-protocols
normal
+
–
25
votes
7
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.0k
views
answered
Dec 4, 2016
Computer Networks
gateit-2005
computer-networks
normal
application-layer-protocols
+
–
5
votes
8
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.3k
views
answered
Oct 5, 2016
Compiler Design
gatecse-2014-set2
compiler-design
normal
expression-evaluation
numerical-answers
+
–
24
votes
9
GATE CSE 2010 | Question: 37
The program below uses six temporary variables $a, b, c, d, e, f$. a = 1 b = 10 c = 20 d = a + b e = c + d f = c + e b = c + e e = b + f d = 5 + e return d + f Assuming that all operations take their operands from registers, what is the minimum number of registers needed to execute this program without spilling? $2$ $3$ $4$ $6$
The program below uses six temporary variables $a, b, c, d, e, f$.a = 1 b = 10 c = 20 d = a + b e = c + d f = c + e b = c + e e = b + f d = 5 + e return d + fAssuming tha...
21.5k
views
answered
Oct 4, 2016
Compiler Design
gatecse-2010
compiler-design
target-code-generation
register-allocation
normal
+
–
20
votes
10
GATE CSE 2007 | Question: 18
Which one of the following is a top-down parser? Recursive descent parser. Operator precedence parser. An LR(k) parser. An LALR(k) parser.
Which one of the following is a top-down parser?Recursive descent parser.Operator precedence parser.An LR(k) parser.An LALR(k) parser.
9.6k
views
answered
Oct 4, 2016
Compiler Design
gatecse-2007
compiler-design
parsing
normal
+
–
23
votes
11
GATE CSE 2003 | Question: 17
Assume that the SLR parser for a grammar G has $n_1$ states and the LALR parser for G has $n_2$ states. The relationship between $n_1$ and $n_2$ is $n_1$ is necessarily less than $n_2$ $n_1$ is necessarily equal to $n_2$ $n_1$ is necessarily greater than $n_2$ None of the above
Assume that the SLR parser for a grammar G has $n_1$ states and the LALR parser for G has $n_2$ states. The relationship between $n_1$ and $n_2$ is$n_1$ is necessarily le...
11.2k
views
answered
Oct 3, 2016
Compiler Design
gatecse-2003
compiler-design
parsing
easy
+
–
42
votes
12
GATE CSE 2008 | Question: 12
Some code optimizations are carried out on the intermediate code because They enhance the portability of the compiler to the target processor Program analysis is more accurate on intermediate code than on machine code The information from ... analysis cannot otherwise be used for optimization The information from the front end cannot otherwise be used for optimization
Some code optimizations are carried out on the intermediate code becauseThey enhance the portability of the compiler to the target processorProgram analysis is more accur...
14.9k
views
answered
Sep 27, 2016
Compiler Design
gatecse-2008
normal
code-optimization
compiler-design
+
–
24
votes
13
GATE CSE 1993 | Question: 7.6
A simple two-pass assembler does the following in the first pass: It allocates space for the literals. It computes the total length of the program. It builds the symbol table for the symbols and their values. It generates code for all the load and store register instructions. None of the above.
A simple two-pass assembler does the following in the first pass:It allocates space for the literals.It computes the total length of the program.It builds the symbol tabl...
19.7k
views
answered
Sep 27, 2016
Compiler Design
gate1993
compiler-design
assembler
easy
multiple-selects
+
–
20
votes
14
GATE CSE 1998 | Question: 2.18, UGCNET-June2012-III: 48
If an instruction takes $i$ microseconds and a page fault takes an additional $j$ microseconds, the effective instruction time if on the average a page fault occurs every $k$ instruction is: $i + \dfrac{j}{k}$ $i +(j\times k)$ $\dfrac{i+j}{k}$ $({i+j})\times {k}$
If an instruction takes $i$ microseconds and a page fault takes an additional $j$ microseconds, the effective instruction time if on the average a page fault occurs every...
19.2k
views
answered
Sep 13, 2016
Operating System
gate1998
operating-system
virtual-memory
easy
ugcnetcse-june2012-paper3
+
–
38
votes
15
GATE CSE 1996 | Question: 2.25
A micro program control unit is required to generate a total of $25$ control signals. Assume that during any micro instruction, at most two control signals are active. Minimum number of bits required in the control word to generate the required control signals will be: $2$ $2.5$ $10$ $12$
A micro program control unit is required to generate a total of $25$ control signals. Assume that during any micro instruction, at most two control signals are active. Mi...
24.6k
views
answered
Sep 11, 2016
CO and Architecture
gate1996
co-and-architecture
microprogramming
normal
+
–
2
votes
16
GATE CSE 1996 | Question: 25
A hard disk is connected to a $50$ MHz processor through a DMA controller. Assume that the initial set-up of a DMA transfer takes $1000$ clock cycles for the processor, and assume that the handling of the interrupt at DMA completion requires $500$ ... What fraction of the processor time is consumed by the disk, if the disk is actively transferring $100\%$ of the time?
A hard disk is connected to a $50$ MHz processor through a DMA controller. Assume that the initial set-up of a DMA transfer takes $1000$ clock cycles for the processor, ...
10.1k
views
answered
Sep 8, 2016
CO and Architecture
gate1996
co-and-architecture
io-handling
dma
numerical-answers
normal
+
–
1
votes
17
ISRO2011-74
In an $RS$ flip-flop, if the $S$ line (Set line) is set high ($1$) and the $R$ line (Reset line) is set low ($0$), then the state of the flip-flop is : Set to $1$ Set to $0$ No change in state Forbidden
In an $RS$ flip-flop, if the $S$ line (Set line) is set high ($1$) and the $R$ line (Reset line) is set low ($0$), then the state of the flip-flop is :Set to $1$Set to $0...
3.3k
views
answered
Jun 30, 2016
Digital Logic
isro2011
digital-logic
flip-flop
+
–
8
votes
18
ISRO2011-65
The Cyclomatic Complexity metric V(G) of the following control flow graph 3 4 5 6
The Cyclomatic Complexity metric V(G) of the following control flow graph3456
4.3k
views
answered
Jun 30, 2016
IS&Software Engineering
isro2011
is&software-engineering
cyclomatic-complexity
+
–
4
votes
19
ISRO2011-54
Number of chips $(128 \times 8 \;\text{RAM})$ needed to provide a memory capacity of $2048$ bytes $2$ $4$ $8$ $16$
Number of chips $(128 \times 8 \;\text{RAM})$ needed to provide a memory capacity of $2048$ bytes$2$$4$$8$$16$
4.6k
views
answered
Jun 30, 2016
CO and Architecture
isro2011
co-and-architecture
memory-interfacing
+
–
0
votes
20
ISRO2011-3
In compiler terminology reduction in strength means Replacing run time computation by compile time computation Removing loop invariant computation Removing common subexpressions replacing a costly operation by a relatively cheaper one
In compiler terminology reduction in strength meansReplacing run time computation by compile time computationRemoving loop invariant computationRemoving common subexpress...
10.0k
views
answered
Jun 27, 2016
Compiler Design
isro2011
compiler-design
code-optimization
+
–
4
votes
21
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.7k
views
answered
Nov 28, 2015
Compiler Design
gatecse-2011
compiler-design
lexical-analysis
easy
+
–
9
votes
22
GATE CSE 2011 | Question: 26
Consider the languages $L1, \:L2 \:and \: L3$ ... Automata (PDA) can be used to recognize $L1$ and $L2$ $L1$ is a regular language All the three languages are context free Turing machines can be used to recognize all the languages
Consider the languages $L1, \:L2 \:and \: L3$ as given below.$L1=\{0^p 1^q \mid p, q \in N\}, \\ L2 = \{0^p 1^q \mid p, q \in N \:and \:p=q\} \: and, \\ L3 = \{0^p 1^q 0^...
9.2k
views
answered
Nov 28, 2015
Theory of Computation
gatecse-2011
theory-of-computation
identify-class-language
normal
+
–
42
votes
23
GATE CSE 2012 | Question: 12
What is the complement of the language accepted by the NFA shown below? Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string. $\phi$ $\{\epsilon\}$ $a^*$ $\{a , \epsilon\}$
What is the complement of the language accepted by the NFA shown below?Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string.$\phi$$\{\epsilon\}$$a^*$$\{a , \epsilon...
19.0k
views
answered
Nov 27, 2015
Theory of Computation
gatecse-2012
finite-automata
easy
theory-of-computation
+
–
–3
votes
24
GATE CSE 2004 | Question: 3
A single array $A[1 \ldots \text{MAXSIZE}]$ is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables $top1$ and $top2$ $(top1 < top 2)$ point to the location of the topmost element in each of the stacks. If the space is to ... $(top1 = \text{MAXSIZE} / 2)$ or $(top2 = \text{MAXSIZE})$ $top1 = top2 - 1$
A single array $A[1 \ldots \text{MAXSIZE}]$ is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables $top1$ and $top2$ $(top1 < top...
35.1k
views
answered
Nov 20, 2015
DS
gatecse-2004
data-structures
stack
easy
+
–
1
votes
25
GATE IT 2006 | Question: 71
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. The index of the parent of element $X[i], i \neq 0$, is? $\left \lfloor \dfrac i 2 \right \rfloor$ $\left \lceil \dfrac{i-1}{2} \right \rceil$ $\left \lceil \dfrac i 2 \right \rceil$ $\left \lceil \dfrac i 2 \right \rceil - 1$
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. The index of the parent of element $X[...
13.5k
views
answered
Nov 18, 2015
DS
gateit-2006
data-structures
binary-tree
normal
+
–
48
votes
26
GATE CSE 2013 | Question: 27
What is the logical translation of the following statement? "None of my friends are perfect." $∃x(F (x)∧ ¬P(x))$ $∃ x(¬ F (x)∧ P(x))$ $ ∃x(¬F (x)∧¬P(x))$ $ ¬∃ x(F (x)∧ P(x))$
What is the logical translation of the following statement?"None of my friends are perfect."$∃x(F (x)∧ ¬P(x))$$∃ x(¬ F (x)∧ P(x))$$ ∃x(¬F (x)∧¬P(x))$$ ¬�...
14.0k
views
answered
Nov 10, 2015
Mathematical Logic
gatecse-2013
mathematical-logic
easy
first-order-logic
+
–
11
votes
27
GATE IT 2005 | Question: 34
Let $n =$ $p^{2}q$, where $p$ and $q$ are distinct prime numbers. How many numbers m satisfy $1 ≤ m ≤ n$ and $gcd$ $(m, n) = 1?$ Note that $gcd$ $(m, n)$ is the greatest common divisor of $m$ and $n$. $p(q - 1)$ $pq$ $\left ( p^{2}-1 \right ) (q - 1)$ $p(p - 1) (q - 1)$
Let $n =$ $p^{2}q$, where $p$ and $q$ are distinct prime numbers. How many numbers m satisfy $1 ≤ m ≤ n$ and $gcd$ $(m, n) = 1?$ Note that $gcd$ $(m, n)$ is the great...
8.0k
views
answered
Nov 5, 2015
Set Theory & Algebra
gateit-2005
set-theory&algebra
normal
number-theory
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register