Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
utk0203
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by utk0203
0
votes
0
answers
1
Doubt!!
Anyone please tell me How maximum children would be 2B-1 For B=5 it would be maximum of 6 children not 8 children right??
Anyone please tell me How maximum children would be 2B-1For B=5 it would be maximum of 6 children not 8 children right??
119
views
asked
Oct 29, 2017
1
votes
1
answer
2
BARC2017
Time complexity of dijkstra's algorithm when array used in place of priority queue Options O(V^2) , O(VlogV+E) , O(VlogV+ElogV) , O(V^3)
Time complexity of dijkstra's algorithm when array used in place of priority queueOptions O(V^2) , O(VlogV+E) , O(VlogV+ElogV) , O(V^3)
530
views
asked
Mar 24, 2017
Algorithms
time-complexity
dijkstras-algorithm
+
–
0
votes
1
answer
3
BARC2017
TCP provides which UDP does not inorder packet , flow control , congestion control , all of these
TCP provides which UDP does notinorder packet , flow control , congestion control , all of these
276
views
asked
Mar 23, 2017
0
votes
1
answer
4
BARC2017
SYN packet is sent through options 1)Bind 2)Socket 3)Listen
SYN packet is sent throughoptions1)Bind2)Socket3)Listen
254
views
asked
Mar 23, 2017
0
votes
1
answer
5
BARC2017
L1 and L2 cache access time 2ns and 5ns respt. Hit percentage 3% and 5% respt. If Average access time =2.4ns then memory access time=?
L1 and L2 cache access time 2ns and 5ns respt.Hit percentage 3% and 5% respt.If Average access time =2.4ns then memory access time=?
575
views
asked
Mar 23, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register