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
Recent activity by pranjalgennext
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?
369
views
asked
Mar 12, 2017
Job Queries
iit-kanpur
+
–
7
answers
2
GATE CSE 2017 Set 1 | Question: 45
The values of parameters for the Stop-and-Wait ARQ protocol are as given below: Bit rate of the transmission channel $= 1$ Mbps. Propagation delay from sender to receiver $= 0.75$ ms. Time to process a frame $= 0.25$ ms. Number ... (expressed in percentage) of the Stop-and-Wait ARQ protocol for the above parameters is _____________ (correct to $2$ decimal places).
The values of parameters for the Stop-and-Wait ARQ protocol are as given below:Bit rate of the transmission channel $= 1$ Mbps.Propagation delay from sender to receiver $...
32.9k
views
commented
Feb 27, 2017
Computer Networks
gatecse-2017-set1
computer-networks
stop-and-wait
numerical-answers
normal
+
–
1
answer
3
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...
396
views
asked
Feb 22, 2017
Others
machine-learning
+
–
4
answers
4
GATE CSE 2017 Set 1 | Question: 49
Consider a RISC machine where each instruction is exactly $4$ bytes long. Conditional and unconditional branch instructions use PC-relative addressing mode with Offset specified in bytes to the target location of the branch instruction. Further the Offset is ... $i,$ then the decimal value of the Offset is ____________ .
Consider a RISC machine where each instruction is exactly $4$ bytes long. Conditional and unconditional branch instructions use PC-relative addressing mode with Offset sp...
14.6k
views
commented
Feb 14, 2017
CO and Architecture
gatecse-2017-set1
co-and-architecture
normal
numerical-answers
instruction-execution
+
–
0
answers
5
Made Easy Test Series
276
views
asked
Feb 3, 2017
Databases
made-easy-test-series
databases
view-serializable
+
–
1
answer
6
MadeEasy Subject Test: Theory of Computation - Identify Class Language
Why is option C correct?
Why is option C correct?
288
views
answer selected
Jan 30, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
context-free-language
identify-class-language
+
–
1
answer
7
MadeEasy Subject Test: Databases - Transactions
340
views
commented
Jan 30, 2017
Databases
made-easy-test-series
databases
transaction-and-concurrency
+
–
6
answers
8
column major in 3d array
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10. The location of A[20] [20] [30] is __________ . [Assume the first element is stored at A[1][1][1] and each element take 1 B].
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10. The location of A[20] [20] [30] is __________...
15.9k
views
commented
Jan 27, 2017
Programming in C
array
programming-in-c
data-structures
+
–
1
answer
9
madeeasy_Mock2
.....
.....
264
views
answered
Jan 26, 2017
0
answers
10
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)
241
views
asked
Jan 26, 2017
Databases
databases
view-serializable
+
–
2
answers
11
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...
441
views
asked
Jan 26, 2017
Databases
databases
indexing
+
–
1
answer
12
MADE EASY TEST SERIES
Consider the following C program segment: struct node What is the output of above C program when it runs on a root node of a binary tree? prints nodes at K distance from root node. print nodes of Kth level of binary tree. Both (a) and (b) None of these
Consider the following C program segment:struct nodeWhat is the output of above C program when it runs on a root node of a binary tree?prints nodes at K distance from roo...
985
views
commented
Jan 26, 2017
DS
binary-tree
+
–
1
answer
13
MadeEasy Subject Test: Programming & DS - Programming in C
318
views
answered
Jan 20, 2017
Programming in C
made-easy-test-series
programming-in-c
programming
+
–
0
answers
14
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...
458
views
asked
Jan 19, 2017
DS
made-easy-test-series
data-structures
stack
+
–
7
answers
15
MadeEasy Subject Test: Theory of Computation - Identify Class Language
Consider the following language, $L= \big\{ xy \mid x, \ y \in \big\{0,1\big\}^{*} \ where \ x \neq y \ but \ |x| = |y| \big\}$ The language is ___________. Regular CFL but not regular CSL but not CFL Recursive but not CSL
Consider the following language,$L= \big\{ xy \mid x, \ y \in \big\{0,1\big\}^{*} \ where \ x \neq y \ but \ |x| = |y| \big\}$The language is ___________.RegularCFL ...
4.0k
views
answered
Jan 19, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
identify-class-language
+
–
0
answers
16
Testbook
# plz check???
# plz check???
374
views
commented
Jan 19, 2017
Theory of Computation
testbook-test-series
test-series
+
–
0
answers
17
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...
351
views
commented
Jan 16, 2017
GATE
gate2017
+
–
0
answers
18
test series
289
views
commented
Jan 14, 2017
Programming in C
test-series
+
–
1
answer
19
Pipeline
An instruction pipeline has stages as given in diagram A program consistsing of 9 instruction I1,I2....I9 is executed in this pipeline processor.instruction I3 is the only conditional branch instruction and its branch target is I7,If the branch taken after EI state,the time needed to complete the program is?
An instruction pipeline has stages as given in diagramA program consistsing of 9 instruction I1,I2....I9 is executed in this pipeline processor.instruction I3 is the only...
915
views
commented
Jan 14, 2017
CO and Architecture
co-and-architecture
pipelining
+
–
1
answer
20
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...
318
views
answer selected
Jan 14, 2017
Databases
databases
bplustrees
+
–
1
answer
21
MadeEasy Subject Test: Compiler Design - Syntax Directed Translation
392
views
asked
Jan 8, 2017
Compiler Design
made-easy-test-series
compiler-design
syntax-directed-translation
+
–
0
answers
22
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...
392
views
asked
Jan 7, 2017
Computer Networks
computer-networks
token-ring
+
–
1
answer
23
C programming
#include <stdio.h> void A() { printf("A");}; void B() { printf("B");}; void C() { printf("C");}; void D() { printf("D");}; int main() { void (*P[4])() = {A,B,C,D}; for(int i=0;i<4;i++) (*(i+P))(); }
#include <stdio.h void A() { printf("A");}; void B() { printf("B");}; void C() { printf("C");}; void D() { printf("D");}; int main() { void (*P[4])() = {A,B,C,D}; for(int...
315
views
commented
Dec 28, 2016
Programming in C
programming-in-c
output
+
–
2
answers
24
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
commented
Dec 28, 2016
Databases
databases
bplustrees
+
–
1
answer
25
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?
267
views
answer selected
Dec 27, 2016
Databases
databases
bplustrees
+
–
1
answer
26
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
538
views
asked
Dec 27, 2016
Databases
databases
indexing
+
–
1
answer
27
Testbook Question
261
views
answered
Dec 23, 2016
Algorithms
algorithms
asymptotic-notation
testbook-test-series
+
–
5
answers
28
TIFR CSE 2017 | Part B | Question: 3
We have an implementation that supports the following operations on a stack (in the instructions below, $\mathsf{s}$ is the name of the stack). $\mathsf{isempty(s)}$ : returns $\mathsf{True}$ if $\mathsf{s}$ is empty, and $\mathsf{False}$ otherwise. $\mathsf{top(s)}$ : returns the top ... ()((())((((") is executed? $(((($ $))) \ (((($ $)))$ $(((()))$ $()()$
We have an implementation that supports the following operations on a stack (in the instructions below, $\mathsf{s}$ is the name of the stack).$\mathsf{isempty(s)}$ : ret...
3.0k
views
commented
Dec 23, 2016
DS
tifr2017
data-structures
stack
+
–
5
answers
29
TIFR CSE 2017 | Part B | Question: 5
Consider the following psuedocode fragment, where $y$ is an integer that has been initialized. int i=1 int j=1 while (i<10): j=j*i i=i+1 if (i==y): break end if end while Consider the following statements: $(i==10)$ or $(i==y)$ If ... the end of the while loop? Choose from the following options. i only iii only ii and iii only i, ii, and iii None of the above
Consider the following psuedocode fragment, where $y$ is an integer that has been initialized.int i=1 int j=1 while (i<10): j=j*i i=i+1 if (i==y): break end if end whileC...
3.1k
views
answered
Dec 23, 2016
Programming in C
tifr2017
programming
loop-invariants
+
–
2
answers
30
Algorithm ADA made easy
consider the following keys that are hashed into table in the order using giving hash function h(i)=(2i+5)mod11 12,44,13,88,23,94,11,39,20,16,5 Assume hash tables has locations from 0to 10.If hash table uses chaining to handle the collisions what is the probability of new elements'x' fit inside hash table without any collision I am getting answer 0.5
consider the following keys that are hashed into table in the order using giving hash function h(i)=(2i+5)mod1112,44,13,88,23,94,11,39,20,16,5 Assume hash tables has loca...
800
views
commented
Dec 23, 2016
Algorithms
hashing
numerical-answers
made-easy-test-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register