Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent posts tagged 2017
1
My experience with quality people @GO.
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is$^{n-1}C_k$$^nC_k$$^nC_{k+1}$None of the above
vijaycs
4,288
views
vijaycs
posted
Mar 30, 2017
2017
2017
+
–
2
A Great Journey It was with GO
Time complexity of Bellman-Ford algorithm is $\Theta(|V||E|)$ where $|V|$ is number of vertices and $|E|$ is number of edges. If the graph is complete, the value of $|E|$...
KISHALAY DAS
1,839
views
KISHALAY DAS
posted
Mar 29, 2017
2017
2017
testimonials
+
–
3
Thanks a lot GO
In a $k$-way set associative cache, the cache is divided into $v$ sets, each of which consists of $k$ lines. The lines of a set are placed in sequence one after another. ...
Kai
1,209
views
Kai
posted
Mar 29, 2017
2017
testimonials
2017
+
–
4
Testimonial by Abhishek Bhardwaj
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?$\theta(n^2)$ $\theta(n^2\log n)$ $\theta(n^3)...
anonymous
1,871
views
anonymous
posted
Mar 29, 2017
2017
testimonials----
2017
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register