Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User vnc
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by vnc
0
answers
1
TestBook TestSeries
(i)An ICMP message is generated if IP datagram header is corrupted (ii) No ICMP message is generated if IP address in data link frame is broadcast or multicast address. Both are correct Only (i) correct Only (ii) correct Both are incorrect
commented
in
Computer Networks
Feb 4, 2017
498
views
computer-networks
icmp
0
answers
2
TestBook TestSeries
in a binary search tree, the key with value 5 was searched after traversing nodes with values 1, 3, 4, 6, 7, 8, 9 not necessarily in this order. Lets P is the probability that 3rd element on the search path beginning from root is either 3 or 8, ... are the number of different orders possible in which given nodes can be traversed before finding node with value 5. Find N ∕ 10 + P
asked
in
Programming in C
Jan 29, 2017
460
views
data-structures
binary-search-tree
1
answer
3
TestBook TestSeries
Consider the following statements : i) An ambiguous grammar can not generate DCFL. ii) An unambiguous grammar will always generate deterministic context free language. iii) Any non-empty language admits an ambiguous grammar. iv) All regular grammars are unambiguous. Which of the above is/are TRUE? i) and iv) only ii) and iii) only iii) only ii) and iv) only
asked
in
Theory of Computation
Jan 29, 2017
391
views
theory-of-computation
ambiguous
1
answer
4
TestBook TestSeries
TLB lookup time (th) = 20 ns TLB hit ratio (ht) = 99% Memory access time (ts) = 100 ns Page fault rate (hp) =0.05% Swap page time (in or out) (tp) = 5000,000 ns What is the effective access time (EAT) if we assume that all pages currently in main memory are dirty? 5118.91 ns 51.21 ns 5120.9 ns None of the above
commented
in
Operating System
Jan 23, 2017
734
views
operating-system
demand-paging
1
answer
5
TestBook Test Series
Let T be a B-tree of order m and height h. if n is the number of key elements in T then the maximum value of n is (m-1)h-1 (m-1)h-1+1 Mh-1 Mh+1+1
answer selected
in
Databases
Jan 14, 2017
1.4k
views
databases
indexing
b-tree
3
answers
6
TestBook Test Series
If (65)x = (52)y, then what is the minimum value of x+y ?
answer selected
in
Digital Logic
Jan 11, 2017
963
views
digital-logic
number-representation
2
answers
7
TestBook Test Series
Consider the following information about a hypothetical organization. Assume the cache is physically addressed TLB:hit rate is 95%,access time is 1 cycle Cache: hit rate is 90%,access time is 1 cycle When TLB and cache both get miss,page fault rate is 1% ... cycles Page table is always kept in main memory. Compute the average memory access time? 1 cycle 2 cycle 3 cycle 4 cycle
commented
in
CO and Architecture
Jan 11, 2017
668
views
co-and-architecture
cache-memory
page-fault
1
answer
8
TestBook Test Series
Assume a sequence of memory accesses is made that have a high degree of temporal locality, which one of these cache would be likely to have the best performance? A 4-way set associative cache with 2-byte blocks A 2-way set associative cache with 4-byte blocks A direct mapped cache with 4-byte blocks A direct mapped cache with 8-byte blocks
asked
in
CO and Architecture
Jan 10, 2017
292
views
co-and-architecture
5
answers
9
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
commented
in
Computer Networks
Jan 10, 2017
13.4k
views
gateit-2005
computer-networks
congestion-control
csma-cd
normal
2
answers
10
MadeEasy Test Series
Consider the following schedule S : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A) The number of schedules equal to given schedule(s) which not conflict equal to schedule(s) are _______.
commented
in
Databases
Jan 10, 2017
1.2k
views
databases
transaction-and-concurrency
1
answer
11
MadeEasy Subject Test: Databases - Transactions
Consider the following schedule : S::r1(A),r3(D),w1(B),r2(B),r4(B),w2(C),r5(C),w4(E),r5(E),w5(B) The number of serial schedules which are view equal to schedule (S) ___________.
asked
in
Databases
Jan 10, 2017
384
views
databases
made-easy-test-series
transaction-and-concurrency
1
answer
12
Testbook Test series
How much memory is needed to store addition table of two 8 bit numbers 64Kx9 64Kx8 64Kx16 64Kx18
commented
in
CO and Architecture
Jan 10, 2017
384
views
co-and-architecture
5
answers
13
GATE CSE 1994 | Question: 3.11
State True or False with reason Logical data independence is easier to achieve than physical data independence.
answered
in
Databases
Jan 2, 2017
7.6k
views
gate1994
databases
normal
data-independence
true-false
8
answers
14
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))$
commented
in
Mathematical Logic
Dec 21, 2016
14.0k
views
gatecse-2013
mathematical-logic
easy
first-order-logic
9
answers
15
GATE CSE 1991 | Question: 03,xii
If $F_1$, $F_2$ and $F_3$ are propositional formulae such that $F_1 \land F_2 \rightarrow F_3$ and $F_1 \land F_2 \rightarrow \sim F_3$ are both tautologies, then which of the following is true: Both $F_1$ and $F_2$ are tautologies The conjunction $F_1 \land F_2$ is not satisfiable Neither is tautologous Neither is satisfiable None of the above
commented
in
Mathematical Logic
Dec 21, 2016
8.8k
views
gate1991
mathematical-logic
normal
propositional-logic
multiple-selects
10
answers
16
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$
answered
in
Mathematical Logic
Dec 21, 2016
14.7k
views
gatecse-2002
mathematical-logic
normal
propositional-logic
11
answers
17
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 ___________.
answered
in
Mathematical Logic
Dec 21, 2016
19.8k
views
gatecse-2016-set2
mathematical-logic
normal
numerical-answers
propositional-logic
3
answers
18
TIFR CSE 2011 | Part A | Question: 12
The action for this problem takes place in an island of Knights and Knaves, where Knights always make true statements and Knaves always make false statements and everybody is either a Knight or a Knave. Two friends A and B lives in a house. The census ... a Knave. A is a Knave and B is a Knight. Both are Knaves. Both are Knights. No conclusion can be drawn.
comment edited
in
Mathematical Logic
Dec 21, 2016
2.0k
views
tifr2011
mathematical-logic
propositional-logic
8
answers
19
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
answered
in
Algorithms
Dec 10, 2016
31.5k
views
gate1996
algorithms
easy
isro2016
searching
7
answers
20
GATE CSE 2002 | Question: 2.12
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the furthest ... which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$
commented
in
DS
Dec 9, 2016
23.3k
views
gatecse-2002
data-structures
binary-tree
normal
2
answers
21
TIFR CSE 2013 | Part B | Question: 13
Given a binary tree of the following form and having $n$ nodes, the height of the tree is $\Theta \left(\log n\right)$ $\Theta \left(n\right)$ $\Theta \left(\sqrt{n}\right)$ $\Theta \left(n / \log n\right)$ None of the above.
commented
in
DS
Dec 8, 2016
3.5k
views
tifr2013
binary-tree
data-structures
5
answers
22
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}$
answered
in
Computer Networks
Dec 4, 2016
8.2k
views
gateit-2006
computer-networks
application-layer-protocols
normal
4
answers
23
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
answered
in
Computer Networks
Dec 4, 2016
10.0k
views
gateit-2005
computer-networks
normal
application-layer-protocols
8
answers
24
GATE CSE 2006 | Question: 34
Consider the regular language $L=(111+11111)^{*}.$ The minimum number of states in any DFA accepting this languages is: $3$ $5$ $8$ $9$
commented
in
Theory of Computation
Dec 2, 2016
34.1k
views
gatecse-2006
theory-of-computation
finite-automata
normal
minimal-state-automata
5
answers
25
GATE CSE 2009 | Question: 51
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s \rangle$, where $c$ is the cylinder number, $h$ is the surface number ... $\langle 400, 16, 29 \rangle$ corresponds to sector number: $505035$ $505036$ $505037$ $505038$
commented
in
Operating System
Nov 28, 2016
19.4k
views
gatecse-2009
operating-system
disk
normal
7
answers
26
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 ___.
answered
in
Compiler Design
Oct 5, 2016
9.4k
views
gatecse-2014-set2
compiler-design
normal
expression-evaluation
numerical-answers
7
answers
27
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$
answered
in
Compiler Design
Oct 4, 2016
21.8k
views
gatecse-2010
compiler-design
target-code-generation
register-allocation
normal
3
answers
28
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.
answered
in
Compiler Design
Oct 4, 2016
9.6k
views
gatecse-2007
compiler-design
parsing
normal
4
answers
29
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
answered
in
Compiler Design
Oct 3, 2016
11.2k
views
gatecse-2003
compiler-design
parsing
easy
5
answers
30
GATE CSE 1991 | Question: 10b
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol ... with redundant parentheses. Do this with minimum number of changes to the given production rules and adding at most one more production rule.
commented
in
Compiler Design
Sep 30, 2016
4.1k
views
gate1991
grammar
compiler-design
normal
descriptive
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...