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 pranjalgennext
2
votes
0
answers
1
Placement Query
Which companies visited IIT Kanpur for placements this academic year?
Which companies visited IIT Kanpur for placements this academic year?
372
views
asked
Mar 12, 2017
Job Queries
iit-kanpur
+
–
0
votes
1
answer
2
Carrier Advice
What is the scope of Machine Learning in India from the prospect of a good job? Is IITK or IITD a good choice to do M. Tech to start a career in this field? I have started doing machine learning courses and have developed a keen interest in it. I want to know the future prospects if I pursue my M. Tech from one of the IITs with goal of learning Machine Learning. Thank You!
What is the scope of Machine Learning in India from the prospect of a good job? Is IITK or IITD a good choice to do M. Tech to start a career in this field? I have starte...
400
views
asked
Feb 22, 2017
Others
machine-learning
+
–
0
votes
0
answers
3
Made Easy Test Series
276
views
asked
Feb 3, 2017
Databases
made-easy-test-series
databases
view-serializable
+
–
1
votes
1
answer
4
MadeEasy Subject Test: Databases - Transactions
345
views
asked
Jan 30, 2017
Databases
made-easy-test-series
databases
transaction-and-concurrency
+
–
0
votes
1
answer
5
MadeEasy Subject Test: Theory of Computation - Identify Class Language
Why is option C correct?
Why is option C correct?
290
views
asked
Jan 28, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
context-free-language
identify-class-language
+
–
1
votes
0
answers
6
Made Easy Test Series
The number of view equal serial schedules possible for the given schedule are: S: w1(A) r2(A) w3(A) r4(A) w5(A) r6(A) w7(A) r8(A)
The number of view equal serial schedules possible for the given schedule are:S: w1(A) r2(A) w3(A) r4(A) w5(A) r6(A) w7(A) r8(A)
244
views
asked
Jan 26, 2017
Databases
databases
view-serializable
+
–
2
votes
2
answers
7
MADE EASY TEST SERIES
Assume that search key size is 90% of the record size within a file(records are fixed length records). Pointer makes up only 10% of the record size. Based on the above assumptions which of the following statements is true? a. Index block factor > ... Index block factor c. Database file block factor = (Index block factor)/2 d. Database file block factor = Index block factor
Assume that search key size is 90% of the record size within a file(records are fixed length records). Pointer makes up only 10% of the record size. Based on the above as...
444
views
asked
Jan 26, 2017
Databases
databases
indexing
+
–
0
votes
0
answers
8
MadeEasy Subject Test: Programming & DS - Stack
A priority queue is used to implement a stack efficiently. Push(C) is implemented as insert 'C'. Pop is implemented as a delete minimum element. For a sequence of operations, the keys chosen are in Strictly decreasing order. How?
A priority queue is used to implement a stack efficiently. Push(C) is implemented as insert 'C'. Pop is implemented as a delete minimum element. For a sequence of operati...
464
views
asked
Jan 19, 2017
DS
made-easy-test-series
data-structures
stack
+
–
0
votes
0
answers
9
General Question
GATE exam is online, so people are not allowed to take their question papers. So how do people calculate their marks? Does a copy of exam paper is mailed to the candidates after the exam?
GATE exam is online, so people are not allowed to take their question papers. So how do people calculate their marks? Does a copy of exam paper is mailed to the candidate...
353
views
asked
Jan 16, 2017
GATE
gate2017
+
–
0
votes
1
answer
10
Made Easy Test Series
Assume a B-plus tree as: Size of search key=15B Size of block=512B Size of record pointer=9B Size of block pointer=8B What is the maximum number of nodes that can be accomodated in each leaf and non-leaf node of the tree?
Assume a B-plus tree as:Size of search key=15BSize of block=512BSize of record pointer=9BSize of block pointer=8BWhat is the maximum number of nodes that can be accomodat...
319
views
asked
Jan 13, 2017
Databases
databases
bplustrees
+
–
2
votes
1
answer
11
MadeEasy Subject Test: Compiler Design - Syntax Directed Translation
396
views
asked
Jan 8, 2017
Compiler Design
made-easy-test-series
compiler-design
syntax-directed-translation
+
–
0
votes
0
answers
12
GATE 2014
Consider a token ring network with a length of 2km having 10 stations including a monitoring station.The propagation speed of the signal is 2*108m/s and the token transmission time is ignored. If each station is allowed to hold the token for 2 microseconds, the minimum time for which the monitoring station should wait before assuming that the loken is lost is?
Consider a token ring network with a length of 2km having 10 stations including a monitoring station.The propagation speed of the signal is 2*108m/s and the token transmi...
394
views
asked
Jan 7, 2017
Computer Networks
computer-networks
token-ring
+
–
0
votes
1
answer
13
MADE EASY TEST SERIES
What is the maximum number of nodes if a B+ tree has order 4 and number of levels as 6?
What is the maximum number of nodes if a B+ tree has order 4 and number of levels as 6?
270
views
asked
Dec 27, 2016
Databases
databases
bplustrees
+
–
0
votes
2
answers
14
MADE EASY TEST SERIES
What is the maximum number of records that can be indexed for a B+ tree of 4 levels with order 10 and root at level 1?
What is the maximum number of records that can be indexed for a B+ tree of 4 levels with order 10 and root at level 1?
1.2k
views
asked
Dec 27, 2016
Databases
databases
bplustrees
+
–
0
votes
1
answer
15
Indexing
What is the difference between different types of indices: 1. Clustered Index 2. Unclustered Index 3. Dense Index 4. Sparse Index
What is the difference between different types of indices:1. Clustered Index2. Unclustered Index3. Dense Index4. Sparse Index
543
views
asked
Dec 27, 2016
Databases
databases
indexing
+
–
9
votes
2
answers
16
Cormen 2nd edition Exercise 11.2-1
Suppose we use a hash function h to hash n distinct keys into an array T of length m. Assuming simple uniform hashing, what is the expected number of collisions?
Suppose we use a hash function h to hash n distinct keys into an array T of length m. Assuming simple uniform hashing, what is the expected number of collisions?
8.0k
views
asked
Jul 12, 2016
Algorithms
algorithms
hashing
expectation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register