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
Questions by agoh
1
votes
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
votes
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$
550
views
asked
May 7, 2017
Algorithms
recurrence-relation
+
–
0
votes
0
answers
3
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...
715
views
asked
Apr 22, 2017
Written Exam
iit-madras
ms
admissions
+
–
1
votes
0
answers
4
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 ...
928
views
asked
Mar 29, 2017
IISc/IITs
gate2017
+
–
0
votes
1
answer
5
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
358
views
asked
Mar 21, 2017
Written Exam
gate-application
+
–
1
votes
1
answer
6
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?
359
views
asked
Feb 9, 2017
2
votes
0
answers
7
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?
544
views
asked
Feb 9, 2017
Calculus
calculus
engineering-mathematics
integration
+
–
0
votes
1
answer
8
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
asked
Jan 15, 2017
Digital Logic
digital-logic
+
–
1
votes
2
answers
9
Doubt in Permutation and Combination
Please explain how to solve the following: There are 3 boxes and 5 balls. a. Distribute into [1,1,3] a.1. Boxes are different and balls are different a.2. Boxes are undistinguishable and balls are different b. Distribute into [2,2,1] b.1. Boxes are ... formula n!/(q1!.q2!.q3!). But not sure on how to deal when boxes are different and when boxes are of same type.
Please explain how to solve the following:There are 3 boxes and 5 balls. a. Distribute into [1,1,3] a.1. Boxes are different and balls are different a.2. Boxes are undist...
576
views
asked
Dec 28, 2016
Combinatory
combinatory
+
–
0
votes
1
answer
10
Is partial derivatives and euler's theorem (related to partial derivatives) in syllabus?
Is partial derivatives and euler's theorem in syllabus? Please clarify if any idea.
Is partial derivatives and euler's theorem in syllabus?Please clarify if any idea.
972
views
asked
Dec 24, 2016
Calculus
engineering-mathematics
+
–
0
votes
1
answer
11
Is there difference in calculation of max size of file system and max size of file?
Given disk block size, disk block address size, number of direct and single, double, triple indirect blocks. n = ( No of direct addresses + (db size/dba) + (db size/dba)*(db size/dba) + (db size/dba)*(db ... ))*dbsize Is n = max size of filesystem or max size of file? How do we calculate the other parameter? Thanks.
Given disk block size, disk block address size, number of direct and single, double, triple indirect blocks.n = ( No of direct addresses + (db size/dba) + (db size/dba)*(...
473
views
asked
Dec 13, 2016
Operating System
operating-system
file-system
+
–
0
votes
1
answer
12
Made easy booklet- Synchronisation: What are possible outcomes?
Please help in part b) What are the potential outcomes? Answer:
Please help in part b) What are the potential outcomes?Answer:
382
views
asked
Dec 11, 2016
Operating System
operating-system
process-synchronization
+
–
3
votes
4
answers
13
If there is deadlock possible, is it correct to conclude that progress and bounded wait will be violated?
My doubt is as follows: If deadlock is there, processes will be busy waiting in wait loop. So, decision on which process enters C.S. is not made in finite time. Hence, is...
1.1k
views
asked
Dec 11, 2016
Operating System
deadlock-prevention-avoidance-detection
process-synchronization
+
–
0
votes
1
answer
14
Made easy booklet - Memory management
Given following data, find average access time. Please explain the solution.
Given following data, find average access time. Please explain the solution.
522
views
asked
Dec 11, 2016
Operating System
operating-system
memory-management
+
–
0
votes
1
answer
15
Doubt on decidability
Are these 2 problems different? 1. Given grammar G, is G regular? 2. Given grammar G, is L(G) regular? Which of these 2 are decidable?
Are these 2 problems different?1. Given grammar G, is G regular?2. Given grammar G, is L(G) regular?Which of these 2 are decidable?
319
views
asked
Dec 9, 2016
Theory of Computation
theory-of-computation
decidability
+
–
0
votes
2
answers
16
MadeEasy Test Series: Theory Of Computation - Decidability
L= {(M)| M is a TM and there exists an input w, |w| < 100, on which M halts}. Is L decidable? Please explain.
L= {(M)| M is a TM and there exists an input w, |w| < 100, on which M halts}. Is L decidable?Please explain.
439
views
asked
Dec 8, 2016
Theory of Computation
made-easy-test-series
theory-of-computation
decidability
+
–
0
votes
2
answers
17
Made easy
L = { wxyw | x, y, w Ē (a+b)+ }. Is it regular or not? The solution says it is non-regular. Is the following regex wrong for L? -> a(a+b)+a + b(a+b)+b.
L = { wxyw | x, y, w Ē (a+b)+ }. Is it regular or not?The solution says it is non-regular. Is the following regex wrong for L? - a(a+b)+a + b(a+b)+b.
262
views
asked
Dec 5, 2016
1
votes
1
answer
18
Made easy
Doubt: Please clarify how option b is wrong.
Doubt: Please clarify how option b is wrong.
247
views
asked
Dec 5, 2016
2
votes
1
answer
19
NPTEL Worked out Problem | Page Replacement
If the total number of available frames is 50, and there are 2 processes one of 10 pages and the other of 5 pages then how much of memory would be proportionally allocated to each of these processes? a. Depends on the ... allocated equally for both d. 5 and 10 respectively Source: http://nptel.ac.in/courses/106108101/pdf/Worked_Out_Problems/Mod_4.pdf
If the total number of available frames is 50, and there are 2 processes one of 10 pages and the other of 5 pages then how much of memory would be proportionally allocate...
4.1k
views
asked
Nov 10, 2016
Operating System
paging
+
–
16
votes
2
answers
20
Hashing
Using open addressing with linear probing, we sequentially insert three distinct keys k1, k2 and k3 into a hash table of size m. Assuming simple uniform hashing, what is the probability that we will need three probes, when inserting the third key, k3? 3/m 2/m2 3/m2 2/m Please explain the solution.
Using open addressing with linear probing, we sequentially insert three distinct keys k1, k2 and k3 into a hash table of size m. Assuming simple uniform hashing, what is ...
3.3k
views
asked
Nov 2, 2016
Algorithms
hashing
data-structures
algorithms
uniform-hashing
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register