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
Questions by 2018
0
votes
0
answers
1
some suggestion from expert and experience people needed? please take yr time and comment here..
AIR-1370 GS:633 CAT: GEN UG: 61%(so no chance in any of IIIT, due to some financial issues i don't want to go with IIIT H) 1.can u please suggest, which college should i apply for? 2.will ... go with BSNL JTO post? 3.if taking worst scenario, is there any chance in top 3 nit or nit allahabad?
AIR-1370GS:633CAT: GENUG: 61%(so no chance in any of IIIT, due to some financial issues i don't want to go with IIIT H)1.can u please suggest, which college should i appl...
322
views
asked
Apr 3, 2017
0
votes
2
answers
2
Which circle should I choose for BSNL jto CSE OC AIR-1370 n.marks-50.29?
1.1k
views
asked
Mar 28, 2017
1
votes
1
answer
3
integer promotion RULE in C gate 2017
https://gateoverflow.in/118473/gate2017-1-53 https://gateoverflow.in/120912/techtud-c-programming http://www.iitk.ac.in/esc101/2011Jan/Lectures/lect6.pdf in case of usigned int and long unsigned mix operation unsigned int promoted to ... promoted to unsigned int plz provide detailed solution, according to rule given iitk pdf code block give different output.
https://gateoverflow.in/118473/gate2017-1-53https://gateoverflow.in/120912/techtud-c-programminghttp://www.iitk.ac.in/esc101/2011Jan/Lectures/lect6.pdfin case of usigned ...
819
views
asked
Mar 8, 2017
0
votes
0
answers
4
most confusing doubt till now, one last time plz confirm ans and method given by made easy right??
350
views
asked
Jan 25, 2017
2
votes
0
answers
5
test doubt B &B+ tree
430
views
asked
Jan 16, 2017
3
votes
1
answer
6
NPTEL sliding window protocol
573
views
asked
Jan 12, 2017
1
votes
0
answers
7
GBN test Q
375
views
asked
Jan 8, 2017
0
votes
0
answers
8
DMA test Q
280
views
asked
Jan 7, 2017
0
votes
1
answer
9
slow start doubt
570
views
asked
Jan 6, 2017
1
votes
1
answer
10
test book
405
views
asked
Jan 5, 2017
4
votes
1
answer
11
channel utilization
383
views
asked
Dec 31, 2016
2
votes
0
answers
12
Arjun sir plz explain how 1st one is nontrivial property and another one is trivial
500
views
asked
Dec 16, 2016
Theory of Computation
mit
+
–
1
votes
1
answer
13
test book
a. m+n b. m+n-1 c. 2m+1 d. 2m+n-1
a. m+nb. m+n-1c. 2m+1d. 2m+n-1
383
views
asked
Dec 11, 2016
0
votes
1
answer
14
madeeasy test
is it right to pre assume that operand will be forwarded from WB stage to EX(even though it is not mentioned)??
is it right to pre assume that operand will be forwarded from WB stage to EX(even though it is not mentioned)??
683
views
asked
Dec 8, 2016
0
votes
1
answer
15
madeeasy test
303
views
asked
Dec 8, 2016
CO and Architecture
test-series
+
–
0
votes
1
answer
16
cormen
what will be the effect if we take equality in relaxaction condition of bellman ford algo??
what will be the effect if we take equality in relaxaction condition of bellman ford algo??
317
views
asked
Nov 29, 2016
Algorithms
bellman-ford
shortest-path
descriptive
+
–
1
votes
2
answers
17
stack overflow
consider a procedure find() which take array of n integers as input and produce pair of elements of array whose difference is not greater than the difference of any other pair of element of array. which of the following represent worst case time complexity of find() procedure? a. O(n) b. O(log n) c. O(nlog n) d. (n^2 log n)
consider a procedure find() which take array of n integers as input and produce pair of elements of arraywhose difference is not greater than the difference of any other ...
574
views
asked
Nov 29, 2016
Algorithms
algorithms
time-complexity
+
–
3
votes
1
answer
18
infix, prefix, postfix
Time required to evaluate a. prefix, b. infix, c. postfix_____O(n) ? for expression evaluation (infix, prefix, postfix) operand stack needed____True? for conversion from one to another notation operator stack needed_____True? time required for conversion from infix to ... { infix, prefix, postfix } require more scan__? PS: i googled for all this but not found anthing exact..
Time required to evaluate a. prefix, b. infix, c. postfix_____O(n) ?for expression evaluation (infix, prefix, postfix) operand stack needed____True?for conversion from on...
2.9k
views
asked
Nov 26, 2016
DS
data-structures
infix-prefix
+
–
1
votes
1
answer
19
MIT QUIZ
plz explain otherwise i ll memorize it..
plz explain otherwise i ll memorize it..
407
views
asked
Nov 23, 2016
Algorithms
uniform-hashing
mit-quiz
+
–
1
votes
1
answer
20
MIT QUIZ
590
views
asked
Nov 23, 2016
Algorithms
uniform-hashing
mit-quiz
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
