Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
bahirNaik
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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.
Profile:GATE score 2016 :50 [612 ] – According to gateoverflow appSET :2Normalized Marks :48.07Category :GENAttempt:2Last Year rank:~ 10 kDomicile:Maharashtra State...
3.9k
views
commented
Mar 13, 2016
Others
mtech
+
–
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.
Consider the following two-process synchronization solution.$$\begin{array}{l|l}\hline \text{PROCESS 0 } & \text{Process 1 }\\ \\ \text{Entry: loop while (turn == 1);...
14.7k
views
answered
Feb 13, 2016
Operating System
gatecse-2016-set2
operating-system
process-synchronization
normal
+
–
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?
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?
368
views
answer selected
Feb 3, 2016
Quantitative Aptitude
combinatory
+
–
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?
In order to play basketball,10 childrens at playgorund divide themselves into two teams of 5 each.How many divisions are possible?
331
views
answer selected
Feb 3, 2016
Quantitative Aptitude
combinatory
+
–
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$
$\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...
25.3k
views
answer edited
Feb 1, 2016
Computer Networks
gatecse-2015-set2
computer-networks
ip-packet
normal
+
–
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}$
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 over...
21.7k
views
commented
Jan 31, 2016
Operating System
gate1998
operating-system
process-scheduling
normal
ugcnetcse-dec2012-paper3
+
–
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
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 o...
23.9k
views
commented
Jan 28, 2016
Theory of Computation
theory-of-computation
turing-machine
gatecse-2003
difficult
+
–
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 ______.
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
19.2k
views
commented
Jan 27, 2016
Set Theory & Algebra
gatecse-2015-set2
set-theory&algebra
functions
normal
numerical-answers
+
–
4
answers
9
No of surjective functions
The number of surjective (onto) functions defined from $A$ to $B$ where |A| = 5, |B| = 4, is _______
The number of surjective (onto) functions defined from $A$ to $B$ where |A| = 5, |B| = 4, is _______
7.4k
views
commented
Jan 27, 2016
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
functions
+
–
1
answer
10
fork()
main() { printf(" * "); for(i=0;i<n;i++) fork(); printf(" * "); } how many times * is printed??
main(){printf(" * ");for(i=0;i<n;i++)fork();printf(" * ");}how many times * is printed??
1.7k
views
commented
Jan 27, 2016
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
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
1.7k
views
commented
Jan 25, 2016
Databases
natural-join
referential-integrity
databases
+
–
1
answer
12
MadeEasy Test Series: Digital Logic - Digital Counter
The modulus value of the below asynchronous counter is __________.
The modulus value of the below asynchronous counter is __________.
1.7k
views
commented
Jan 25, 2016
Digital Logic
made-easy-test-series
digital-logic
digital-counter
+
–
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???
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 magn...
1.4k
views
commented
Jan 25, 2016
CO and Architecture
made-easy-test-series
digital-logic
ieee-representation
+
–
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
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 CB. A >BC and AB ...
18.0k
views
answered
Jan 24, 2016
Databases
database-normalization
databases
canonical-cover
decomposition
+
–
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 _________.
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 u...
37.5k
views
commented
Jan 20, 2016
Computer Networks
gatecse-2014-set1
computer-networks
tcp
congestion-control
numerical-answers
normal
+
–
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
A magnetic disk has following specs:# 0f tracks=1024#of sectors/track=512#of Bytes/sector =512Disk Rotation speed=7200rpma)What is the percentage of improvement(approx) i...
1.2k
views
commented
Jan 19, 2016
Operating System
co-and-architecture
disk
operating-system
+
–
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
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 t...
9.7k
views
commented
Jan 18, 2016
Operating System
operating-system
disk
+
–
1
answer
18
Leaky bucket
4.2k
views
asked
Jan 17, 2016
Computer Networks
leaky-bucket
computer-networks
+
–
1
answer
19
Probability Head/Tails
1.9k
views
answer selected
Jan 17, 2016
Probability
probability
engineering-mathematics
+
–
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?).
Consider the 3 processes, P1, P2 and P3 shown in the table. Process Arrival time Time Units Required (arrival time,time required)P1 0 5P2 1 7P3 3 4 The completion o...
774
views
answered
Jan 16, 2016
1
answer
21
Operating System
Disk Access Question
Disk Access Question
283
views
answer edited
Jan 15, 2016
Operating System
operating-system
test-series
+
–
3
answers
22
Greedy Approach - Task selection
1.1k
views
commented
Jan 15, 2016
Algorithms
algorithms
job-scheduling
numerical-answers
test-series
+
–
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
identify the type of errorint main(){int gate,exam,rank;gate=exam=rank=10.3;printf("%c",gate);}a)lexical errorb)syntax errorc)semantic errord)none of these
725
views
commented
Jan 15, 2016
Compiler Design
compiler-design
lexical-analysis
+
–
2
answers
24
Increasing Growth order
2.2k
views
commented
Jan 15, 2016
Algorithms
algorithms
time-complexity
test-series
+
–
1
answer
25
Huffman
479
views
answer selected
Jan 14, 2016
Algorithms
huffman-code
algorithms
test-series
+
–
0
answers
26
Comparing Iteration computation.
141
views
asked
Jan 14, 2016
Programming in C
time-complexity
algorithms
+
–
1
answer
27
Mock Test 2016 GA
396
views
asked
Jan 14, 2016
Quantitative Aptitude
test-series
quantitative-aptitude
polynomials
+
–
1
answer
28
Iterative complexity.
337
views
answer selected
Jan 13, 2016
Programming in C
time-complexity
+
–
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 ].
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 ].
642
views
asked
Jan 13, 2016
Programming in C
programming-in-c
+
–
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?
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?
349
views
commented
Jan 13, 2016
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register