Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Aboveallplayer
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Aboveallplayer
1
votes
161
#algorithm
Can Prim's and Kruskal's algorithm yield different minimum spanning trees? Explain why or why not.
Can Prim's and Kruskal's algorithm yield different minimum spanning trees? Explain why or why not.
1.6k
views
answered
Oct 28, 2016
Algorithms
minimum-spanning-tree
algorithms
kruskals-algorithm
prims-algorithm
+
–
0
votes
162
mathematics
233
views
answered
Oct 27, 2016
3
votes
163
Time complexity
393
views
answered
Oct 26, 2016
Unknown Category
algorithms
asymptotic-notation
time-complexity
+
–
0
votes
164
ER-Model
421
views
answered
Oct 26, 2016
1
votes
165
number of WAR dependencies
Consider the following instructions. $I_1:R_1=100$ $I_2:R_1=R_2+R_4$ $I_3:R_2=R_4+25$ $I_4:R_4=R_1+R_3$ $I_5:R_1=R_1+30$ Calculate sum of ($\text{WAR, RAW and WAW}$) dependencies the above instructions. $10$ $12$ $6$ $8$
Consider the following instructions.$I_1:R_1=100$$I_2:R_1=R_2+R_4$$I_3:R_2=R_4+25$$I_4:R_4=R_1+R_3$$I_5:R_1=R_1+30$Calculate sum of ($\text{WAR, RAW and WAW}$) dependenci...
6.5k
views
answered
Oct 26, 2016
CO and Architecture
co-and-architecture
data-dependency
+
–
0
votes
166
vgate
explain
explain
482
views
answered
Oct 26, 2016
0
votes
167
Memory-Control Unit
If size of MAR &MBR are $32$ bit and $16$ bit respectively then what is the main memory size. if memory is byte addressable .
If size of MAR &MBR are $32$ bit and $16$ bit respectively then what is the main memory size.if memory is byte addressable .
2.1k
views
answered
Oct 26, 2016
CO and Architecture
co-and-architecture
control-unit
+
–
1
votes
168
Doubt
Min number of registers required to evaluate below expression: x = ( a+b) * (c+d) I am getting 2 but answer is 3. Solution: 1) Load r1,a 2) Add r1, b 3) Load r2, c 4) Add r2,d 5) Mul r1,r2 6) store x, r1
Min number of registers required to evaluate below expression:x = ( a+b) * (c+d)I am getting 2 but answer is 3.Solution: 1) Load r1,a2) Add r1, b3) Load r2, c4) Add r2,d5...
272
views
answered
Oct 26, 2016
CO and Architecture
co-and-architecture
+
–
5
votes
169
Made Easy solve it.
onsider the evaluation of following expression tree on a machine in which memory can be accessed only through load and store instructions. The variable p, q, r, s, t, u and v are initially stored in memory. The binary operators used in the tree ... . What is the the minimum number of registers needed to evaluate the expression if, no intermediate results can be stored in memory?
onsider the evaluation of following expression tree on a machine in which memory can be accessed only through load and store instructions. The variable p, q, r, s, t, u a...
543
views
answered
Oct 26, 2016
0
votes
170
ace/practice
main() { int n=2; int i; for(i=0;i<n;i++) if(fork()==0) printf("hellow"); } how many times is "hellow " printed ?
main(){ int n=2;int i;for(i=0;i<n;i++)if(fork()==0)printf("hellow");}how many times is "hellow " printed ?
314
views
answered
Oct 19, 2016
1
votes
171
vgate_OS
Each user request generates 10 disk requests on average and has 10 msec service time. So, time required for disk I/O = 10 10 msec = 100 msec. Total time = computational time + disk I/O time = 80 + 100 msec = 180 msec. in 180msec-->1 user's rquests are ... --> 1000/180=5.5=5 users 1 user-->10 requests 5users-->50 requests. so answer shud be 50 requests answer given is 5
Each user request generates 10 disk requests on average and has 10 msec service time.So, time required for disk I/O = 10×10 msec = 100 msec.Total time = computational ti...
585
views
answered
Oct 19, 2016
1
votes
172
Graph
Is the topic "Planarity" there in GATE 2017 syllabus?
Is the topic "Planarity" there in GATE 2017 syllabus?
288
views
answered
Oct 18, 2016
3
votes
173
MadeEasy Test Series: Compiler Design - Viable Prefix
i think "(E+F*" is viable prefix but "E+F*" is not viable prefix. correct?
i think "(E+F*" is viable prefix but "E+F*" is not viable prefix. correct?
1.3k
views
answered
Oct 17, 2016
Compiler Design
made-easy-test-series
compiler-design
viable-prefix
+
–
1
votes
174
ADA
Arrange them in order of asymptotic growth rate N^2,n!/logn,(1+1/n)^n,(logn)^logn,N^(loglogn),3^log2
Arrange them in order of asymptotic growth rateN^2,n!/logn,(1+1/n)^n,(logn)^logn,N^(loglogn),3^log2
978
views
answered
Sep 20, 2016
Algorithms
algorithms
asymptotic-notation
+
–
0
votes
175
B tree
What is degree in Btree and how it is diffrent from order of tree
What is degree in Btree and how it is diffrent from order of tree
993
views
answered
Sep 19, 2016
Others
b-tree
+
–
3
votes
176
#aptitude
foreign bank have stopped ________ in india a. to open b. for opening c. opening d open
foreign bank have stopped ________ in indiaa. to openb. for openingc. openingd open
419
views
answered
Sep 2, 2016
Verbal Aptitude
verbal-aptitude
+
–
0
votes
177
#co
plz explain synonyms and homonyms problems in cache addressing and how to solve these problems ?? If possible by numerical example ??
plz explain synonyms and homonyms problems in cache addressing and how to solve these problems ??If possible by numerical example ??
307
views
answered
Sep 1, 2016
5
votes
178
MadeEasy Test Series: Computer Networks - Flow Control Methods
Station X needs to send a message consisting of 12 packets to station Y using a sliding window protocol (Window Size 4) and Go back n error control strategy. All packets are ready and immediately available for transmission. If every ... gets lost), then the number of packets that X will transmit for sending the message to Y are _____.
Station X needs to send a message consisting of 12 packets to station Y using a sliding window protocol (Window Size 4) and Go back n error control strategy. All packets ...
2.1k
views
answered
Aug 24, 2016
Computer Networks
made-easy-test-series
computer-networks
flow-control-methods
sliding-window
+
–
4
votes
179
Graph theory
Let G be a graph with 10 vertices, and d(v) be the degree of a vertex v. The following conditions are holds for Graph G. 3 $\leq$ d (v) $\leq$ 5 for each vertex v in G. Not every vertex degree is even No two odd degree vertices are of the same ... be the number of edges, Y be the vertices having even degree and Z be the vertices having odd degree in G. Find the value of X+10Y+100Z?
Let G be a graph with 10 vertices, and d(v) be the degree of a vertex v. The following conditions are holds for Graph G.3 $\leq$ d (v) $\leq$ 5 for each vertex v in G.Not...
632
views
answered
Aug 22, 2016
1
votes
180
UGC NET CSE | December 2011 | Part 2 | Question: 25
The $SQL$ Expression Select distinct $T$. branch name from branch $T$, branch $S$ where $T$. assets $> S$. assets and $S$. branch-city = DELHI, finds the name of All branches that have greater asset than any branch ... in DELHI. The branch that has the greatest asset in DELHI. Any branch that has greater asset than any branch located in DELHI.
The $SQL$ Expression Select distinct $T$. branch name from branch $T$, branch $S$ where $T$. assets $ S$. assets and $S$. branch-city = DELHI, finds the name ofAll branch...
2.5k
views
answered
Aug 22, 2016
Databases
ugcnetcse-dec2011-paper2
databases
sql
+
–
4
votes
181
TCP Congestion Control
1.2k
views
answered
Aug 21, 2016
Computer Networks
computer-networks
congestion-control
tcp
+
–
0
votes
182
DFA
What is the language accepted by the following DFA ... ending with zero set of all strings starting and ending with zero 2nd option is true but what abut the 3rd option it is also Correct I Guess
What is the language accepted by the following DFA $\Sigma=(0,1)?Set of strings starting with 0 and have odd number of switchings (from 0 to 1 or 1 to 0, for example, 101...
1.2k
views
answered
Aug 21, 2016
Theory of Computation
theory-of-computation
finite-automata
easy
+
–
0
votes
183
Networking Book to follow ?
There are a few books , which i am unable to choose from ( i am new to this subject) a. Computer Networking - A Top Down Approach by KUROSE & ROSS (6th Edition) b. Computer Networks - A System Approach by PETERSON and DAVIE (4th ... Tanenbaum (4th Edition) Which one should i start studying from in context to GATE? what is the difference between the two approaches ?
There are a few books , which i am unable to choose from ( i am new to this subject)a. Computer Networking - A Top Down Approach by KUROSE & ROSS (6th Edition)b. Computer...
807
views
answered
Aug 17, 2016
2
votes
184
MADEEASY Doubt Matrix
If A is a Skew Symmetric MAtrix then A.A is_______ a)symmetric b)skew-symmetric c)Diagonal d)nothing can be said
If A is a Skew Symmetric MAtrix then A.A is_______a)symmetric b)skew-symmetric c)Diagonal d)nothing can be said
876
views
answered
Aug 16, 2016
2
votes
185
operating system
suppose counting semaphore value is 5 can it be increased to 6
suppose counting semaphore value is 5 can it be increased to 6
351
views
answered
Aug 15, 2016
0
votes
186
then what is the expected number of games played in the series
If two teams A and B play a best-of-five series, and if team A has a 1/4 chance of winning any game (and team B has 3/4 chance of winning any game), then what is the expected number of games played in the series. (Note that in a best-of-five series, the teams play games until one team has won three games.)
If two teams A and B play a best-of-five series, and if team A has a 1/4 chance of winning any game (and team B has 3/4 chance of winning any game), then what is the expe...
1.0k
views
answered
Aug 14, 2016
Probability
expectation
+
–
0
votes
187
Probability
A fair coin is tossed 3 times in succession.If the first toss produced a head then the probability of getting exactly two heads in 3 tosses(including the first toss ) is 1/8 3/8 1/2 3/4
A fair coin is tossed 3 times in succession.If the first toss produced a head then the probability of getting exactly two heads in 3 tosses(including the first toss ) is1...
7.3k
views
answered
Aug 13, 2016
Probability
probability
+
–
2
votes
188
UGC NET CSE | December 2011 | Part 2 | Question: 3
Which of the following is a bad example of recursion ? Factorial Fibonacci numbers Tower of Hanai Tree traversal
Which of the following is a bad example of recursion ?FactorialFibonacci numbersTower of HanaiTree traversal
2.4k
views
answered
Aug 13, 2016
Algorithms
ugcnetcse-dec2011-paper2
algorithms
recursion
+
–
Page:
« prev
1
2
3
4
5
6
7
8
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register