Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
agoh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by agoh
2
answers
1
DBMS Doubt - Normalization
Does any normal form impose the condition "every non-key should depend upon every key"?
Does any normal form impose the condition "every non-key should depend upon every key"?
1.1k
views
asked
May 10, 2017
Databases
database-normalization
databases
+
–
2
answers
2
Doubt
How to get solution of the following recurrence? $T(n) = \sqrt{n} .T(\sqrt{n}) + n$
How to get solution of the following recurrence?$T(n) = \sqrt{n} .T(\sqrt{n}) + n$
538
views
commented
May 7, 2017
Algorithms
recurrence-relation
+
–
2
answers
3
Generating function
Let $h_n$ denote the number of non-negative integral solutions of the equation $3x_1 + 4x_2 + 2x_3 + 5x_4 = n$ Find the generating function $g(x)$ for $h_0,h_1,h_2,h_3 ... h_n$
Let $h_n$ denote the number of non-negative integral solutions of the equation $3x_1 + 4x_2 + 2x_3 + 5x_4 = n$Find the generating function $g(x)$ for $h_0,h_1,h_2,h_3 ....
687
views
commented
May 7, 2017
Combinatory
generating-functions
combinatory
+
–
1
answer
4
PGEE 2017
Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides y Which vertex will have highest in degree ?
Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides yWhich vertex will have highest in deg...
534
views
answered
Apr 30, 2017
Graph Theory
iiith-pgee
graph-theory
+
–
0
answers
5
IIT-Madras MS
According to https://research.iitm.ac.in/, Admission for M.S Online application portal for Academic year 2017 - 2018 will be open tentatively from 19.04.2017. But the portal has not opened since 19th April. Would anyone be aware whether new registrations are ... 2nd April. I had called IIT-Madras.They told to wait till 21st April, but there is no registrations link on the website.
According to https://research.iitm.ac.in/, Admission for M.S Online application portal for Academic year 2017 - 2018 will be open tentatively from 19.04.2017. But the por...
708
views
asked
Apr 22, 2017
Written Exam
iit-madras
ms
admissions
+
–
0
answers
6
How to prepare for IIT/IISC interviews, written test and programming round?
Please guide on how to prepare for IIT/IISC interviews, written test and programming round? It shall be most helpful if these are covered: 1. Which topics must for written test? 2. Additional info about written test 3. Programming round details and tips 4. Interview round details and tips Thanks in advance.
Please guide on how to prepare for IIT/IISC interviews, written test and programming round?It shall be most helpful if these are covered:1. Which topics must for written ...
920
views
asked
Mar 29, 2017
IISc/IITs
gate2017
+
–
1
answer
7
#advice #gate17 #admission
Gate score of 783 and rank 259 What are the chances for old iits??? Can i make it to kgp?
Gate score of 783 and rank 259What are the chances for old iits???Can i make it to kgp?
1.4k
views
commented
Mar 27, 2017
3
answers
8
GATE IT 2008 | Question: 25
In how many ways can $b$ blue balls and $r$ red balls be distributed in $n$ distinct boxes? $\frac{(n+b-1)!\,(n+r-1)!}{(n-1)!\,b!\,(n-1)!\,r!}$ $\frac{(n+(b+r)-1)!}{(n-1)!\,(n-1)!\,(b+r)!}$ $\frac{n!}{b!\,r!}$ $\frac{(n + (b + r) - 1)!} {n!\,(b + r - 1)}$
In how many ways can $b$ blue balls and $r$ red balls be distributed in $n$ distinct boxes?$\frac{(n+b-1)!\,(n+r-1)!}{(n-1)!\,b!\,(n-1)!\,r!}$$\frac{(n+(b+r)-1)!}{(n-1)!\...
8.3k
views
commented
Mar 22, 2017
Combinatory
gateit-2008
combinatory
normal
+
–
1
answer
9
Application form -IIT Delhi
If Gate result is awaited, what should be filled in qualifying exam? The score field is mandatory
If Gate result is awaited, what should be filled in qualifying exam? The score field is mandatory
336
views
asked
Mar 21, 2017
Written Exam
gate-application
+
–
1
answer
10
IIT Kanpur written test
Number of distinct BFS, DFS trees in a complete graph ?
Number of distinct BFS, DFS trees in a complete graph ?
1.6k
views
commented
Mar 3, 2017
Algorithms
algorithms
graph-algorithms
numerical-answers
+
–
1
answer
11
Space Complexity of Quick Sort
Is Quick Sort an in-place algorithm? I read somewhere that although its space complexity is O(logn) [best case], it is referred to as an in place algo by Wikipedia because it involves just swapping of elements. What is Correct?
Is Quick Sort an in-place algorithm?I read somewhere that although its space complexity is O(logn) [best case], it is referred to as an in place algo by Wikipedia because...
1.6k
views
commented
Mar 1, 2017
Algorithms
quick-sort
+
–
1
answer
12
CO Doubt
What is the formula for average access time using write-through and write-back policy?
What is the formula for average access time using write-through and write-back policy?
331
views
asked
Feb 9, 2017
0
answers
13
Integration doubt
How to integrate: $\int e^{-x^{2}} dx$ More specifically, how to integrate standard normal distribution function from 0 to a?
How to integrate: $\int e^{-x^{2}} dx$More specifically, how to integrate standard normal distribution function from 0 to a?
531
views
asked
Feb 9, 2017
Calculus
calculus
engineering-mathematics
integration
+
–
1
answer
14
question
L = {ai bj ck dm} | i+j+k+m is multiple of 13} L is ? (a) Regular (b) Context-free (c) Turing-decidable (d) Turing-Recognizable
L = {ai bj ck dm} | i+j+k+m is multiple of 13}L is ?(a) Regular (b) Context-free(c) Turing-decidable (d) Turing-Recognizable
1.2k
views
answered
Feb 3, 2017
5
answers
15
MadeEasy CBT 2017: Algorithms - Graph Algorithms
No of topological sortings
No of topological sortings
2.0k
views
answered
Jan 23, 2017
Algorithms
made-easy-test-series
cbt-2017
algorithms
graph-algorithms
topological-sort
+
–
2
answers
16
How many and what size of field exits in micro operation field?
If a micro program supports 46 micro operations with parallelism of 2, how many and what size of field exits in micro operation field? How do we get the size of micro-operation field as 9?
If a micro program supports 46 micro operations with parallelism of 2, how many and what size of field exits in micro operation field?How do we get the size of micro-oper...
1.0k
views
commented
Jan 22, 2017
CO and Architecture
co-and-architecture
microprogramming
+
–
3
answers
17
GATE CSE 1987 | Question: 4a
Find out the width of the control memory of a horizontal microprogrammed control unit, given the following specifications: $16$ control lines for the processor consisting of ALU and $7$ registers. Conditional branching facility by checking $4$ status bits. Provision to hold $128$ words in the control memory.
Find out the width of the control memory of a horizontal microprogrammed control unit, given the following specifications:$16$ control lines for the processor consisting ...
5.7k
views
answered
Jan 22, 2017
CO and Architecture
gate1987
co-and-architecture
microprogramming
descriptive
+
–
2
answers
18
Online
963
views
commented
Jan 20, 2017
CO and Architecture
co-and-architecture
addressing-modes
+
–
3
answers
19
Hash table
A Hash table has space for 100 records. Then the probability of collision before the table is 10% full is? A 0.45 B 0.5 C 0.3 D 0.34 (approximately)
A Hash table has space for 100 records. Then the probability of collision before the table is 10% full is?A 0.45B 0.5C 0.3D 0.34 (approximately)
15.4k
views
commented
Jan 20, 2017
Algorithms
hashing
probability
+
–
2
answers
20
MadeEasy Subject Test: Programming & DS - Hashing
True Or False.....? Explain...?
True Or False.....? Explain...?
539
views
commented
Jan 20, 2017
DS
made-easy-test-series
data-structures
hashing
+
–
1
answer
21
Hashing
How do i prove that : : : In hashing n items into a hash table with k locations, the expected number of collisions is $n - k + k( 1-\frac{1}{k})^n$ ??
How do i prove that : : : In hashing n items into a hash table with k locations, the expected number of collisions is $n - k + k( 1-\frac{1}{k})^n$ ??
612
views
commented
Jan 20, 2017
Algorithms
hashing
+
–
2
answers
22
Number of Tokens
$/* abc */Printf("what's \ up \ \%d",++ \&\&***a);$
$/* abc */Printf("what's \ up \ \%d",++ \&\& *a);$
526
views
commented
Jan 16, 2017
Compiler Design
compiler-design
compiler-tokenization
+
–
2
answers
23
MadeEasy Subject Test: Digital Logic - Circuit Output
380
views
answered
Jan 15, 2017
Digital Logic
digital-logic
made-easy-test-series
circuit-output
+
–
1
answer
24
Made easy book: Doubt in frequency of clock
Please explain how the formula of frequency of clock obtained? Is the formula for time of clock not this -> Time of clock >= no of flip flop* delay per flip-flop? Also, does the formula change with type of clock?
Please explain how the formula of frequency of clock obtained?Is the formula for time of clock not this - Time of clock >= no of flip flop* delay per flip-flop?Also, does...
1.1k
views
commented
Jan 15, 2017
Digital Logic
digital-logic
+
–
1
answer
25
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
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+1Mh-1Mh+1+1
1.4k
views
commented
Jan 14, 2017
Databases
databases
indexing
b-tree
+
–
2
answers
26
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 _______.
Consider the following scheduleS : 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 _____...
1.1k
views
answered
Jan 10, 2017
Databases
databases
transaction-and-concurrency
+
–
1
answer
27
DBMS-7
364
views
answered
Jan 7, 2017
1
answer
28
DBMS-10
333
views
answered
Jan 7, 2017
3
answers
29
Relations
Consider the set S = {a, b} and ‘L’ be a binary relation such that L = {all binary relations except reflexive relation set S}. The number of relation which are symmetric _______.
Consider the set S = {a, b} and ‘L’ be a binary relation such that L = {all binary relations except reflexive relation set S}. The number of relation which are symmet...
1.8k
views
answered
Jan 4, 2017
Set Theory & Algebra
relations
discrete-mathematics
+
–
9
answers
30
GATE IT 2005 | Question: 36
Let $P(x)$ and $Q(x)$ ...
Let $P(x)$ and $Q(x)$ be arbitrary predicates. Which of the following statements is always TRUE?$\left(\left(\forall x \left(P\left(x\right) \vee Q\left(x\right)\right)\r...
14.6k
views
commented
Jan 3, 2017
Mathematical Logic
gateit-2005
mathematical-logic
first-order-logic
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register