Recent activity by Habibkhan / GATE Overflow for GATE CSE

0 answers

1

ISRO exam timings
Could you please tell me the timings of ISRO exam to be held on 22nd April,2018? I've got to book by tickets accordingly so please help me out.

Could you please tell me the timings of ISRO exam to be held on 22nd April,2018? I've got to book by tickets accordingly so please help me out.

1.5k views

commented Mar 12, 2018

2 answers

2

BST(Test Series)
Consider a Binary Search Tree is created using element 1 to n in following order: 3, 2, 1, 6, 5, 4, 9, 8, 7, 12, 11, 10, ....., n – 3, n – 4, n – 5, n – 2, n – 1, n What is the worst time complexity of searching a number in the Binary Search Tree?

Consider a Binary Search Tree is created using element 1 to n in following order: 3, 2, 1, 6, 5, 4, 9, 8, 7, 12, 11, 10, ....., n – 3, n – 4, n �...

833 views

answered Jan 3, 2018

2 answers

3

NIELIT 2017 DEC Scientific Assistant A - Section B: 44
If $X, Y$ and $Z$ are three exhaustive and mutually exclusive events related with any experiment and the $P\left(X \right)=0.5P\left(Y \right)$ and $P\left(Z \right)$ = $0.3P\left(Y \right)$. Then $P\left(Y \right)$ = ___________ . $0.54$ $0.66$ $0.33$ $0.44$

If $X, Y$ and $Z$ are three exhaustive and mutually exclusive events related with any experiment and the $P\left(X \right)=0.5P\left(Y \right)$ and $P\left(Z \right)$ = ...

2.0k views

answered Jan 3, 2018

0 answers

4

Go-Back-N
The efficiency of a Go-Back-N protocol is $\eta = \frac{N}{1+ 2 *\frac{Propogation Delay}{Transmission Delay}}$ In this equation what is the exact value of N. Is it the one given in Go-Back-N or (2N-1).

The efficiency of a Go-Back-N protocol is $\eta = \frac{N}{1+ 2 *\frac{Propogation Delay}{Transmission Delay}}$In this equation what is the exact value of N. Is it the on...

1.1k views

commented Nov 26, 2017

1 answer

5

max file size
Consider a file system in which the index table in the directory holds 32 pointers(DBA's) if the file size is within 32 blocks then these 32 addresses act as direct DBA's . Otherwise if file size is more than 32 blocks then these addresses act as ... to blocks that hold addresses of data blocks. if DBS is 4KB and DBA is 32 bits then max file size in MB is ___________

Consider a file system in which the index table in the directory holds 32 pointers(DBA's) if the file size is within 32 blocks then these 32 addresses act as direct DBA's...

1.2k views

commented Nov 10, 2017

2 answers

6

A First Course in Probability- Sheldon Ross 8th Edition Random Variables Example 1b
Three balls are to be randomly selected without replacement from an urn containing 20 balls numbered 1 through 20. If we bet that at least one of the balls that are drawn has a number as large as or larger than 17, what is the probability that we win the bet?

Three balls are to be randomly selected without replacement from an urn containing20 balls numbered 1 through 20. If we bet that at least one of the balls that aredrawn h...

889 views

answered Nov 10, 2017

1 answer

7

C Output

276 views

answered Nov 10, 2017

0 answers

8

HEADERS
There are so many headers in COMPUTER NETWORK which are the headers that i should mug them properly ??.Please list them in order of their priorities.

There are so many headers in COMPUTER NETWORK which are the headers that i should mug them properly ??.Please list them in order of their priorities.

215 views

commented Nov 9, 2017

0 answers

9

Combination , how to solve ?
How many ways are there to select four pieces of fruit from a bowl containing apples, oranges, and pears if the order in which the pieces are selected does not matter, only the type of fruit and not the individual piece matters, and there are at least four pieces of each type of fruit in the bowl?

How many ways are there to select four pieces of fruit from a bowl containing apples, oranges, and pears if the order in which the pieces are selected does not matter, on...

1.5k views

commented Nov 9, 2017

0 answers

10

Self doubt on Ethernet LAN
Are the below formulas for correct w.r.t ethernet LAN? efficiency : PD = propagation delay TD = transmission delay L = frame size $\eta =\frac{1}{1 + 6.44(\frac{ pd }{ td })}$ throughput: $= \frac{L}{RTT}$ If they are wrong please provide correct ones.

Are the below formulas for correct w.r.t ethernet LAN?efficiency :PD = propagation delayTD = transmission delayL = frame size$\eta =\frac{1}{1 + 6.44(\frac{ pd }{ td })}$...

785 views

commented Nov 9, 2017

2 answers

11

UGC NET CSE | November 2017 | Part 2 | Question: 37
In ________ disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without serving any requests on the return trip. LOOK SCAN C-LOOK C-SCAN

In ________ disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the requests along the way. When the head reaches the other end,...

1.7k views

commented Nov 9, 2017

1 answer

12

Algorithm

579 views

commented Nov 9, 2017

1 answer

13

UGC NET CSE | November 2017 | Part 2 | Question: 36
In Distributed system, the capacity of a system to adapt the increased service load is called Tolerance Scalability Capability Loading

In Distributed system, the capacity of a system to adapt the increased service load is calledToleranceScalabilityCapabilityLoading

769 views

commented Nov 9, 2017

0 answers

14

Gate 2002
Let G be an undirected connected graph with distinct edge weights. Let Emax be the edge with maximum weight and Emin the edge with minimum weight. Which of the following statements is false?

Let G be an undirected connected graph with distinct edge weights. Let Emax be the edge with maximum weight and Emin the edge with minimum weight. Which of the following ...

430 views

closed Nov 9, 2017

1 answer

15

Self-Doubt
Is the Poset (Q,Less than or equal to) a well ordered set? Where Q denotes set of all rational numbers and relation R is less than or equal to.

Is the Poset (Q,Less than or equal to) a well ordered set?Where Q denotes set of all rational numbers and relation R is less than or equal to.

767 views

answered Nov 9, 2017

1 answer

16

Maths: maxima and minima
In this maxima - minima question, teacher says that critical point -2 doesn't belong to the interval [-3, 3], isn't this wrong or i am missing something?

In this maxima - minima question, teacher says that critical point -2 doesn't belong to the interval [-3, 3], isn't this wrong or i am missing something?

1.8k views

answered Nov 9, 2017

1 answer

17

[Discrete Maths] : Functions

856 views

answered Nov 9, 2017

0 answers

18

Doubt
Manish has to travel from A to D changing buses at stops B and C enroute. The maximum waiting time at either stop can be 8 minutes each, but any time of waiting up to 8 minutes is equally likely at both the places. He can afford up to 13 minutes of total waiting time if he is to ... at D on time. What is the probability that Manish will arrive late at D? A) 8/13 B) 13/64 C) 119/128 D) 9/128

Manish has to travel from A to D changing buses at stops B and C enroute. The maximum waiting time at either stop can be 8 minutes each, but any time of waiting up to 8 m...

808 views

commented Nov 9, 2017

1 answer

19

3D array
main() { int arr[2][3][2] ={{{1,2}{3,4}{5,6}} , {7,8}{9,10},{11,12}}}; printf("%d%d",a[1]-a[0],a[1][0]-a[0][0]}; return 0; } assume int is of 2 bytes

main(){int arr [3] ={{{1,2}{3,4}{5,6}} , {7,8}{9,10},{11,12}}};printf("%d%d",a -a[0],a [0]-a[0][0]};return 0;}assume int is of 2 bytes

598 views

answered Nov 9, 2017

0 answers

20

Kenneth Rosen Ex 7.6

751 views

commented Nov 9, 2017

2 answers

21

FINd p and Q
P = (1+1/2)(1+1/3)(1+1/4)..........(1+1/98)(1+1/99) Q=(1-1/2)(1-1/3)...............................(1-1/99)(1-1/100) P/Q = ?

P = (1+1/2)(1+1/3)(1+1/4)..........(1+1/98)(1+1/99)Q=(1-1/2)(1-1/3)...............................(1-1/99)(1-1/100)P/Q = ?

580 views

answered Nov 9, 2017

3 answers

22

GATE CSE 1997 | Question: 5.3
A micro instruction is to be designed to specify: none or one of the three micro operations of one kind and none or upto six micro operations of another kind The minimum number of bits in the micro-instruction is: $9$ $5$ $8$ None of the above

A micro instruction is to be designed to specify:none or one of the three micro operations of one kind andnone or upto six micro operations of another kindThe minimum num...

11.4k views

commented Nov 9, 2017

1 answer

23

UGC NET CSE | November 2017 | Part 3 | Question: 36
An undirected graph $G(V,E)$ contains $n(n>2)$ nodes named $v_1, v_2, \dots , v_n$. Two nodes $v_i$ and $v_j$ are connected if and only if $0< \mid i-j \mid \leq 2$. Each edge $(v_i, v_j)$ is assigned a weight $i+j$. The cost of the minimum spanning tree of such a graph with $10$ nodes is $88$ $91$ $49$ $21$

An undirected graph $G(V,E)$ contains $n(n>2)$ nodes named $v_1, v_2, \dots , v_n$. Two nodes $v_i$ and $v_j$ are connected if and only if $0< \mid i-j \mid \leq 2$. Each...

1.1k views

commented Nov 8, 2017

2 answers

24

Inequality
If 0$<$x$<$1 then (a) $\sqrt{\frac{1-x}{1+x}} < \frac{log(1+x)}{sin^{-1}x} < 1$ (b) $\sqrt{\frac{1-x}{1+x}} > \frac{log(1+x)}{sin^{-1}x} > 1$ (c) $\sqrt{\frac{1-x}{1+x}} > \frac{log(1+x)}{sin^{-1}x} < 1$ (d) $\sqrt{\frac{1-x}{1+x}} < \frac{log(1+x)}{sin^{-1}x} > 1$

If 0$<$x$<$1 then(a) $\sqrt{\frac{1-x}{1+x}} < \frac{log(1+x)}{sin^{-1}x} < 1$(b) $\sqrt{\frac{1-x}{1+x}} \frac{log(1+x)}{sin^{-1}x} 1$(c) $\sqrt{\frac{1-x}{1+x}} \fra...

577 views

answered Nov 8, 2017

1 answer

25

Lattice
In Bounded lattice, the greatest and least element are always complement of each other? True/False?

In Bounded lattice, the greatest and least element are always complement of each other? True/False?

773 views

answered Nov 8, 2017

1 answer

26

hamming
In hamming method to transmit a message of size 12B data . How many minimum number of padding bits are considered to correct single bit error

In hamming method to transmit a message of size 12B data . How many minimum number of padding bits are considered to correct single bit error

572 views

commented Nov 8, 2017

1 answer

27

Ace Test Series: Operating System - Semaphore
It says as follows: Pseudocode Integer X = 0 , Y = 23 ; Semaphore mx = 1 , my = Null ; Codebegin Begin P(mx); x= x+1; V(my); End Begin P(my); x= y+1; V(mx); End Question: Possible final values of X?? I tried to find the values and i concluded that 1 and 24 could be the final values but solution says only 24 :( Any idea??

It says as follows:PseudocodeInteger X = 0 , Y = 23 ;Semaphore mx = 1 , my = Null ;Codebegin Begin P(mx); x= x+1; V(my); End...

974 views

commented Nov 8, 2017

2 answers

28

CO:- Memory Access time

1.5k views

commented Nov 8, 2017

1 answer

29

Dependency VS Hazard
Consider following program is executed on a 5 stage RISC pipeline and stages are IF, ID, EX, MA, WB. IF = Instruction Fetch ID = Instruction Decode and fetch register EX = Execution Stage MA = Memory Access WB = Write back register file Program: ... and Hazards.(There is no Structural Dependency) My Answers -> Dependencies = 6, hazards = 3. Someone verify these answer.

Consider following program is executed on a 5 stage RISC pipeline and stages are IF, ID, EX, MA, WB.IF = Instruction FetchID = Instruction Decode and fetch register EX =...

2.4k views

commented Nov 8, 2017

1 answer

30

MadeEasy Subject Test: CO & Architecture - Pipelining
Which of the following statements are true? 1. WAW and WAR can be reduced but cannot be completely removed from the pipeline. 2.In direct mapped cache,may produce more misses of program refers to a memory word that occupies same tag value 3.By register renaming,all the stalls created by anti data dependency are eliminated

Which of the following statements are true?1. WAW and WAR can be reduced but cannot be completely removed from the pipeline.2.In direct mapped cache,may produce more miss...

2.9k views

commented Nov 7, 2017

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true