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 thor
2
votes
1
Testbook Test series
How much memory is needed to store addition table of two 8 bit numbers 64Kx9 64Kx8 64Kx16 64Kx18
How much memory is needed to store addition table of two 8 bit numbers64Kx964Kx864Kx1664Kx18
383
views
answered
Jan 10, 2017
CO and Architecture
co-and-architecture
+
–
2
votes
2
Ace Test Series: Computer Networks - Congestion Control
705
views
answered
Jan 8, 2017
Computer Networks
ace-test-series
computer-networks
congestion-control
+
–
2
votes
3
[DBMS Schedules] Lost update vs ww conflict
W1(A),R2(A),W2(A),W2(B),W1(B) This schedule has WW conflict but not Lost update problem,Please explain why? Is it possible to have WW conflict without lost update?
W1(A),R2(A),W2(A),W2(B),W1(B)This schedule has WW conflict but not Lost update problem,Please explain why?Is it possible to have WW conflict without lost update?
2.3k
views
answered
Jan 7, 2017
Databases
databases
transaction-and-concurrency
conflict-serializable
+
–
38
votes
4
GATE CSE 2000 | Question: 1.22, UGCNET-June2012-II: 11
B$^{+}$-trees are preferred to binary trees in databases because Disk capacities are greater than memory capacities Disk access is much slower than memory access Disk data transfer rates are much less than memory data transfer rates Disks are more reliable than memory
B$^{+}$-trees are preferred to binary trees in databases becauseDisk capacities are greater than memory capacitiesDisk access is much slower than memory accessDisk data t...
15.6k
views
answered
Jan 7, 2017
Databases
gatecse-2000
databases
b-tree
normal
ugcnetcse-june2012-paper2
+
–
3
votes
5
MadeEasy Subject Test: Databases - Timestamp Ordering
515
views
answered
Jan 6, 2017
Databases
made-easy-test-series
databases
time-stamp-ordering
+
–
5
votes
6
time complexity
What is the time complexibilty of the following code?Assume "statement" takes O(1) time. int x=0; int A(n) { statement; if (n==1) { return 1; } else { x += 4 A(n/2) + n2; return x; } }
What is the time complexibilty of the following code?Assume "statement" takes O(1) time.int x=0; int A(n) { statement; if (n==1) { return 1; } else { x += 4 A(n/2) + n2; ...
410
views
answered
Jan 3, 2017
Algorithms
time-complexity
algorithms
+
–
1
votes
7
CRC Check
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: A. 11001001000 B. 11001001011 C. 11001010 D. 110010010011
The message 11001001 is to be transmitted using the CRC polynomial x^3 + 1to protect it from errors. The message that should be transmitted is:A. 11001001000B. 1100100101...
2.6k
views
answered
Jan 1, 2017
6
votes
8
Test by Bikram | General Aptitude | Test 2 | Question: 19
There are $5$ hotels on a road. If $4$ men go into the hotel at $11$ am, then the probability that each go into a different hotel is ______.
There are $5$ hotels on a road. If $4$ men go into the hotel at $11$ am, then the probability that each go into a different hotel is ______.
343
views
answered
Dec 29, 2016
Verbal Aptitude
tbb-aptitude-2
numerical-answers
+
–
2
votes
9
Test by Bikram | General Aptitude | Test 2 | Question: 15
Melt : Liquid Heat : Vapour Water : Liquid Freeze : Cold Liquid : Ice
Melt : LiquidHeat : VapourWater : LiquidFreeze : ColdLiquid : Ice
180
views
answered
Dec 29, 2016
Verbal Aptitude
tbb-aptitude-2
+
–
35
votes
10
GATE CSE 2014 Set 1 | Question: GA-10
When a point inside of a tetrahedron (a solid with four triangular surfaces) is connected by straight lines to its corners, how many (new) internal planes are created with these lines?
When a point inside of a tetrahedron (a solid with four triangular surfaces) is connected by straight lines to its corners, how many (new) internal planes are created wit...
8.8k
views
answered
Dec 28, 2016
Quantitative Aptitude
gatecse-2014-set1
quantitative-aptitude
geometry
combinatory
normal
numerical-answers
+
–
0
votes
11
_/\_Doubt_/\_
What is the complement of Non-Recursive Enumerable Language ?
What is the complement of Non-Recursive Enumerable Language ?
409
views
answered
Dec 18, 2016
Theory of Computation
theory-of-computation
+
–
2
votes
12
Verbal Ability
Select the lettered pair that has the same relationship as the given pair of words. Symphony : Music (A) Mural : Painting (B) Ode : Prose (C) Preface : Book (D) Editorial : Journal
Select the lettered pair that has the same relationship as the given pair of words.Symphony : Music (A) Mural : Painting (B) Ode : Prose (C) Preface : Book (D) Editor...
1.3k
views
answered
Dec 16, 2016
0
votes
13
No of binary tree
number of distinct binary tree,that can be created by 5 nodes(distinct)
number of distinct binary tree,that can be created by 5 nodes(distinct)
676
views
answered
Dec 10, 2016
Graph Theory
data-structures
binary-tree
+
–
9
votes
14
csma/cd
Two csma/cd stations are trying to send frames..After each frame is sent they contend for channel using backoff exponential algorithm?What is probability that contention ends on round k?
Two csma/cd stations are trying to send frames..After each frame is sent they contend for channel using backoff exponential algorithm?What is probability that contention ...
2.7k
views
answered
Nov 27, 2016
Computer Networks
computer-networks
csma-cd
+
–
4
votes
15
minimised DFA
471
views
answered
Nov 21, 2016
Theory of Computation
theory-of-computation
finite-automata
minimal-state-automata
+
–
9
votes
16
GATE CSE 1987 | Question: 12-a
The Boolean expression $A \oplus B \oplus A$ is equivalent to $AB + \overline {A}\;\;\overline B$ $\overline{A}\;B+A\;\overline{B}$ $B$ $\overline{A}$
The Boolean expression $A \oplus B \oplus A$ is equivalent to$AB + \overline {A}\;\;\overline B$$\overline{A}\;B+A\;\overline{B}$$B$$\overline{A}$
4.3k
views
answered
Nov 15, 2016
Digital Logic
gate1987
digital-logic
boolean-algebra
easy
+
–
0
votes
17
process management
423
views
answered
Oct 6, 2016
Operating System
operating-system
+
–
0
votes
18
Function in C
All functions have file scope. Thus, you cannot define a function within a function. This is why C is not technically a block-structured language.Explain pls ?
All functions have file scope. Thus, you cannot define a function within a function. This is why C is not technically a block-structured language.Explain pls ?
797
views
answered
Sep 9, 2016
Programming in C
programming-in-c
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register