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
Answers by bahirNaik
73
votes
1
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);...
15.2k
views
answered
Feb 13, 2016
Operating System
gatecse-2016-set2
operating-system
process-synchronization
normal
+
–
1
votes
2
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
answered
Jan 25, 2016
Databases
natural-join
referential-integrity
databases
+
–
8
votes
3
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.1k
views
answered
Jan 24, 2016
Databases
database-normalization
databases
canonical-cover
decomposition
+
–
2
votes
4
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
answered
Jan 24, 2016
1
votes
5
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...
795
views
answered
Jan 16, 2016
0
votes
6
Operating System
Disk Access Question
Disk Access Question
294
views
answered
Jan 15, 2016
Operating System
operating-system
test-series
+
–
2
votes
7
Pipelining_ques
Consider 5 stage pipeline which allow all instructions except branch instruction. Program contain 30% conditional instructions out of which 75% are branch instruction. Processor stop fetching the following instruction after the branch instruction untill target address is ... perfectly balanced with 20 GHz clock time. The processor is running with rate of ____________ (in MIPS).
Consider 5 stage pipeline which allow all instructions except branch instruction. Program contain 30% conditional instructions out of which 75% are branch instruction. Pr...
523
views
answered
Jan 10, 2016
9
votes
8
Throughput of the Pipeline
Consider a machine with 10 ns clock and it takes 4 clock cycle per ALU instruction, 5 clock cycle per branch instruction, 6 clock cycle memory instruction. There exists 40% ALU instruction, 20% branch instruction, and 40% memory instruction. What is throughput of pipeline system if overhead is 2 ns? ______________ MIPS (integer value only).
Consider a machine with 10 ns clock and it takes 4 clock cycle per ALU instruction, 5 clock cycle per branch instruction, 6 clock cycle memory instruction. There exists 4...
10.8k
views
answered
Jan 9, 2016
CO and Architecture
pipelining
co-and-architecture
throughput
+
–
3
votes
9
Indexing
944
views
answered
Jan 9, 2016
Databases
databases
indexing
+
–
1
votes
10
consistency in database
274
views
answered
Jan 9, 2016
3
votes
11
B+ tree order
519
views
answered
Jan 9, 2016
0
votes
12
Outer join
406
views
answered
Jan 9, 2016
9
votes
13
blind writes
Consider the following schedule $S1$. $S_{1}: R_{1}(C) R_{2}(C) W_{1}(A) W_{2}(A) W_{1}(C) R_{1}(B) R_{2}(B) W_{1}(B) W_{1}(D) W_{2}(B) W_{2}(D) R_{1}(F) W_{3}(E) R_{3}(F)$ Let $'X'$ be the number of 'blind-write' operations in the given schedule and $'z'$ be the number of conflict equivalent serial schedules to $S_{1}$. The value of $X*Z$ is_________.
Consider the following schedule $S1$.$S_{1}: R_{1}(C) R_{2}(C) W_{1}(A) W_{2}(A) W_{1}(C) R_{1}(B) R_{2}(B) W_{1}(B) W_{1}(D) W_{2}(B) W_{2}(D) R_{1}(F) W_{3}(E) R_{3}(F)...
1.3k
views
answered
Jan 9, 2016
1
votes
14
Pipeline problem
A 5 stage pipelined processor has instruction fetch (IF), operand fetch (OF). Instruction decode (ID), perform operation (PO) and Write operand (WO) stages. The IF, ID, OF and WO stages takes 1 clock cycle each for any instruction. The PO stage takes ... question is , Here I1 and I2 are dependent , so how can they start without any stall , no operand forwarding is also mentioned.
A 5 stage pipelined processor has instruction fetch (IF), operand fetch (OF). Instruction decode (ID), perform operation (PO) and Write operand (WO) stages. The IF, ID, O...
1.6k
views
answered
Jan 5, 2016
CO and Architecture
co-and-architecture
+
–
3
votes
15
switching
A sends 2 frames of 1000 bit each to B via switch S.Bandwidth=10Mbps propogation delay over links=5us find time when second packet reaches B completely
A sends 2 frames of 1000 bit each to B via switch S.Bandwidth=10Mbps propogation delay over links=5us find time when second packet reaches B completely
1.4k
views
answered
Jan 5, 2016
0
votes
16
MadeEasy Test Series: Compiler Design - Parsing
Which is true? a) Recursive Decent Parsers may suffer from infinite loop. b) Every LR grammer is unambiguous. c) Both a & b d) None Doubt: RDP and LL(1) can go in loop if it is not left-factorized and contains left recursion ... unambiguous, left-factorized and left-rec. free grammer. So, how can it go to infinite loop. Answer given was (c).
Which is true?a) Recursive Decent Parsers may suffer from infinite loop.b) Every LR grammer is unambiguous.c) Both a & bd) None Doubt: RDP and LL(1) can go in loop if it ...
1.1k
views
answered
Jan 4, 2016
Compiler Design
compiler-design
parsing
made-easy-test-series
+
–
1
votes
17
Type of error
The given statement has what type of error ? in /* declare variable */ x;
The given statement has what type of error ?in /* declare variable */ x;
333
views
answered
Jan 4, 2016
Compiler Design
compiler-design
lexical-analysis
+
–
1
votes
18
Sliding Window Protocol
Assume that SWP is designed for a 1mbps point to point link to the moon which has 1 way latency(delay) of 1.25sec Assuming that each frame carry 1KB of data, find 1. number of sequence number required 2. number of bits required to represent sequence number. for 1st question i got ans 306.17, is it accepted or we have to round it as 307 plz clarify
Assume that SWP is designed for a 1mbps point to point link to the moon which has 1 way latency(delay) of 1.25sec Assuming that each frame carry 1KB of data, find1. numbe...
547
views
answered
Jan 3, 2016
1
votes
19
Need discussion link
I need links of discussion made on all subjects till date ..anyone having link,please share it.
I need links of discussion made on all subjects till date ..anyone having link,please share it.
355
views
answered
Jan 3, 2016
1
votes
20
Chromatic number
What is the chromatic number of Kn - e (complete graph with an edge removed)?
What is the chromatic number of Kn - e (complete graph with an edge removed)?
1.7k
views
answered
Jan 2, 2016
Set Theory & Algebra
engineering-mathematics
set-theory&algebra
+
–
10
votes
21
Floating point
The decimal equivalents of $01440000$ a $32$- bit hexadecimal representation of $IEEE$ single-precision floating point number is $1.11 \times 2^{-125}$ $1.88 \times 2^{-125}$ $1.68 \times 2^{-124}$ $1.88 \times 2^{-129}$
The decimal equivalents of $01440000$ a $32$- bit hexadecimal representation of $IEEE$ single-precision floating point number is$1.11 \times 2^{-125}$$1.88 \times 2^{-125...
1.5k
views
answered
Dec 29, 2015
Digital Logic
floating-point-representation
ieee-representation
+
–
4
votes
22
Subject Topic- Probability
what is positively skewed ,symmetric and negatively skewed distribution?
what is positively skewed ,symmetric and negatively skewed distribution?
966
views
answered
Dec 29, 2015
Probability
statistics
probability
engineering-mathematics
+
–
0
votes
23
how many surfaces are required
pls xplain the last line of the qs,"records cannot span 2 records" and what effect does it bring to the problem
pls xplain the last line of the qs,"records cannot span 2 records" and what effect does it bring to the problem
483
views
answered
Dec 26, 2015
Operating System
disk
+
–
3
votes
24
Addressing mode used by PC
2.5k
views
answered
Dec 25, 2015
CO and Architecture
co-and-architecture
addressing-modes
+
–
2
votes
25
Total cycles for executing these Instructions in a Pipelined Architecture
634
views
answered
Dec 23, 2015
CO and Architecture
pipelining
co-and-architecture
+
–
45
votes
26
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.8k
views
answered
Dec 22, 2015
Computer Networks
gatecse-2015-set2
computer-networks
ip-packet
normal
+
–
6
votes
27
GATE CSE 2015 Set 2 | Question: 41
Consider the following routing table at an IP router: ... $\text{i-b, ii-c, iii-d, iv-e}$ $\text{i-b, ii-c, iii-e, iv-d}$
Consider the following routing table at an IP router:$$\begin{array}{|l|l|l|} \hline \textbf {Network No} & \textbf {Net Mask} & \textbf{Next Hop} \\\hline \text {128.96...
14.5k
views
answered
Dec 21, 2015
Computer Networks
gatecse-2015-set2
computer-networks
subnetting
easy
+
–
25
votes
28
GATE CSE 1999 | Question: 2.5
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if-then-else forward go to arbitrary go to non-recursive procedure call recursive procedure/function call repeat loop, which constructs will you not include in a programming language ... $\text{(vi), (vii), (viii)}$ $\text{(iii), (vii), (viii)}$
Given the programming constructsassignmentfor loops where the loop parameter cannot be changed within the loopif-then-elseforward go toarbitrary go tonon-recursive proced...
12.6k
views
answered
Dec 14, 2015
Programming in C
gate1999
programming
normal
programming-constructs
+
–
–4
votes
29
GATE CSE 1999 | Question: 1.10
Which of the following disk scheduling strategies is likely to give the best throughput? Farthest cylinder next Nearest cylinder next First come first served Elevator algorithm
Which of the following disk scheduling strategies is likely to give the best throughput?Farthest cylinder nextNearest cylinder nextFirst come first servedElevator algorit...
11.3k
views
answered
Dec 8, 2015
Operating System
gate1999
operating-system
disk-scheduling
normal
+
–
0
votes
30
Dangling else problem
The dangling else problem in the construct If (E) sales S | is (E) S | a can be resolved IN SDTS by (A) Using the associative & precedence of operating & the 'exe' munch principle (B) By change the grammar to an unambiguous one (C) Cannot be removed as it Is undecidable (D) None of the above
The dangling else problem in the construct If (E) sales S | is (E) S | a can be resolved IN SDTS by(A) Using the associative & precedence of operating & the 'exe' munch p...
2.4k
views
answered
Dec 6, 2015
Compiler Design
compiler-design
syntax-directed-translation
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register