Dark Mode

Recent activity by pranjalgennext

0 answers

1

Placement Query
Which companies visited IIT Kanpur for placements this academic year?

asked in Job Queries Mar 12, 2017

373 views

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).

commented in Computer Networks Feb 27, 2017

32.8k views

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!

asked in Others Feb 22, 2017

386 views

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 ____________ .

commented in CO and Architecture Feb 14, 2017

14.5k views

0 answers

5

Made Easy Test Series

asked in Databases Feb 3, 2017

275 views

1 answer

6

MadeEasy Subject Test: Theory of Computation - Identify Class Language
Why is option C correct?

answer selected in Theory of Computation Jan 30, 2017

285 views

1 answer

7

MadeEasy Subject Test: Databases - Transactions

commented in Databases Jan 30, 2017

333 views

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].

commented in Programming in C Jan 27, 2017

15.8k views

1 answer

9

madeeasy_Mock2
.....

answered in Databases Jan 26, 2017

261 views

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)

asked in Databases Jan 26, 2017

234 views

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

asked in Databases Jan 26, 2017

431 views

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

commented in DS Jan 26, 2017

1.0k views

1 answer

13

MadeEasy Subject Test: Programming & DS - Programming in C

answered in Programming in C Jan 20, 2017

317 views

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?

asked in DS Jan 19, 2017

451 views

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

answered in Theory of Computation Jan 19, 2017

4.1k views

0 answers

16

Testbook
# plz check???

commented in Theory of Computation Jan 19, 2017

362 views

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?

commented in GATE Jan 16, 2017

346 views

0 answers

18

commented in Programming in C Jan 14, 2017

291 views

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?

commented in CO and Architecture Jan 14, 2017

916 views

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?

answer selected in Databases Jan 14, 2017

313 views

1 answer

21

MadeEasy Subject Test: Compiler Design - Syntax Directed Translation

asked in Compiler Design Jan 8, 2017

387 views

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?

asked in Computer Networks Jan 7, 2017

389 views

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))(); }

commented in Programming in C Dec 28, 2016

317 views

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?

commented in Databases Dec 28, 2016

1.2k views

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?

answer selected in Databases Dec 27, 2016

270 views

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

asked in Databases Dec 27, 2016

536 views

1 answer

27

Testbook Question

answered in Algorithms Dec 23, 2016

258 views

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? $(((($ $))) \ (((($ $)))$ $(((()))$ $()()$

commented in DS Dec 23, 2016

3.0k views

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

answered in Programming in C Dec 23, 2016

3.1k views

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

commented in Algorithms Dec 23, 2016

779 views