Dark Mode

Recent activity by bahirNaik

1 answer

1

Which one is better VJTI-Mumbai or COEP pune vs Average level NIT?
Profile: GATE score 2016 : 50 [612 ] – According to gateoverflow app SET : 2 Normalized Marks : 48.07 Category : GEN Attempt: 2 Last Year rank: ~ 10 k Domicile: Maharashtra State B.E. Computer Engineering ... opt to leave the NIT seat? How much money would I lose this way. Any other suggestions are welcomed. Thanks.

commented in Others Mar 13, 2016

3.9k views

8 answers

2

GATE CSE 2016 Set 2 | Question: 48
Consider the following two-process synchronization solution. ... synchronization solution. This solution violates mutual exclusion requirement. This solution violates progress requirement. This solution violates bounded wait requirement.

answered in Operating System Feb 13, 2016

14.8k views

1 answer

3

Total number of solutions
If $x_1+x_2+x_3+x_4 =98$ and $x_1, x_2,x_3$ and $x_4$ are odd numbers, calculate total number of solutions of the equation?

answer selected in Quantitative Aptitude Feb 3, 2016

376 views

2 answers

4

division among groups
In order to play basketball,10 childrens at playgorund divide themselves into two teams of 5 each.How many divisions are possible?

answer selected in Quantitative Aptitude Feb 3, 2016

336 views

9 answers

5

GATE CSE 2015 Set 2 | Question: 52
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data up to $1500\text{ bytes (i.e. MTU = 1500 bytes)}.$ Size of $\text{UDP}$ ... be the contents of offset field in the last fragment? $6$ and $925$ $6$ and $7400$ $7$ and $1110$ $7$ and $8880$

answer edited in Computer Networks Feb 1, 2016

25.5k views

5 answers

6

GATE CSE 1998 | Question: 2.17, UGCNET-Dec2012-III: 43
Consider $n$ processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes $s$ seconds, what must be the quantum size $q$ such that the overhead resulting from process switching is minimized but at the same time each process is guaranteed to get ... $q \leq \frac{t-ns}{n+1}$ $q \geq \frac{t-ns}{n+1}$

commented in Operating System Jan 31, 2016

21.8k views

4 answers

7

GATE CSE 2003 | Question: 54
Define languages $L_0$ and $L_1$ as follows : $L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $ $L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts on }w\}$ Here $\langle M, w, i \rangle$ is a ... $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable

commented in Theory of Computation Jan 28, 2016

24.1k views

15 answers

8

GATE CSE 2015 Set 2 | Question: 40
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.

commented in Set Theory & Algebra Jan 27, 2016

19.3k views

4 answers

9

No of surjective functions
The number of surjective (onto) functions defined from $A$ to $B$ where |A| = 5, |B| = 4, is _______

commented in Set Theory & Algebra Jan 27, 2016

7.4k views

1 answer

10

fork()
main() { printf(" * "); for(i=0;i<n;i++) fork(); printf(" * "); } how many times * is printed??

commented in Operating System Jan 27, 2016

1.7k views

3 answers

11

Relation between Intersection and natural inner join on common column
When , then the cost of computing is (A) the same as R S (B) greater the R S (C) less than R S (D) cannot say anything

commented in Databases Jan 25, 2016

1.7k views

1 answer

12

MadeEasy Test Series: Digital Logic - Digital Counter
The modulus value of the below asynchronous counter is __________.

commented in Digital Logic Jan 25, 2016

1.7k views

3 answers

13

MadeEasy Test Series: Digital Logic - Ieee Representation
Q: The decimal number -0.329 x 2^15 is to be represented using a 16 bit floating point format without normalization as shown above. mantissa is pure fraction in sign magnitude form. Answer using rounding off is.. My Try: As it is 16 bit IEEE , ... them by three.. So, 4th digit should br 1 and not 5. (They have taken Expo - 64 = 15) why???

commented in CO and Architecture Jan 25, 2016

1.4k views

4 answers

14

Canonical cover of a set
Consider the following set of functional dependency on the scheme (A, B,C) A-->BC, B-->C, A--> B, AB-->C The canonical cover for this set is: (A) A-->BC and B--> C B. A-->BC and AB--> C C. A--> BC and A--> B D. A--> B and B--> C

answered in Databases Jan 24, 2016

18.0k views

12 answers

15

GATE CSE 2014 Set 1 | Question: 27
Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size used is $2$ KB. The time taken (in msec) by the TCP connection to get back to $32$ KB congestion window is _________.

commented in Computer Networks Jan 20, 2016

37.6k views

1 answer

16

Percentage Improvement
A magnetic disk has following specs: # 0f tracks=1024 #of sectors/track=512 #of Bytes/sector =512 Disk Rotation speed=7200rpm a)What is the percentage of improvement(approx) in average access time ,if disk speed is doubled? a)16% b)18% c)19% d)None

commented in Operating System Jan 19, 2016

1.2k views

7 answers

17

Calculating disk access time
A program of size 64MB is stored on disk which supports an average seek time of 30ms and rotation time of 20ms. Page size is 4MB and track size is 32MB. If the pages of the program are contiguously placed on disk, then the total time required to load the program from disk in ms is _____ Given answer: 120

commented in Operating System Jan 18, 2016

9.8k views

1 answer

18

asked in Computer Networks Jan 17, 2016

4.2k views

1 answer

19

Probability Head/Tails

answer selected in Probability Jan 17, 2016

1.9k views

1 answer

20

process-schedule
Consider the 3 processes, P1, P2 and P3 shown in the table. Process Arrival time Time Units Required (arrival time,time required) P1 0 5 P2 1 7 P3 3 4 The completion order of the 3 processes under the policies FCFS and RR2 (round robin scheduling with CPU quantum ... order is P1 P3 P2 can anyone give me proper explanation, i cant understand why in 4-6 part p1 is taking (not p3?).

answered in Operating System Jan 16, 2016

779 views

1 answer

21

Operating System
Disk Access Question

answer edited in Operating System Jan 15, 2016

294 views

3 answers

22

Greedy Approach - Task selection

commented in Algorithms Jan 15, 2016

1.2k views

1 answer

23

error
identify the type of error int main() { int gate,exam,rank; gate=exam=rank=10.3; printf("%c",gate); } a)lexical error b)syntax error c)semantic error d)none of these

commented in Compiler Design Jan 15, 2016

751 views

2 answers

24

Increasing Growth order

commented in Algorithms Jan 15, 2016

2.2k views

1 answer

25

answer selected in Algorithms Jan 14, 2016

485 views

0 answers

26

Comparing Iteration computation.

asked in Programming in C Jan 14, 2016

145 views

1 answer

27

Mock Test 2016 GA

asked in Quantitative Aptitude Jan 14, 2016

406 views

1 answer

28

Iterative complexity.

answer selected in Programming in C Jan 13, 2016

348 views

2 answers

29

Unary operator expression evaluation c
After executing the program, I am getting 10 as the answer. Please explain and give the postfix for the expression [ z=x++-y*b/a ].

asked in Programming in C Jan 13, 2016

654 views

0 answers

30

Ip addresses and Gate Calculator
Is there any way of calculating binary equivalent of the given IP address on the virtual calculator provided? Or we need to use manual calculations for it?

commented in Computer Networks Jan 13, 2016

362 views