Tuesday, October 31, 2017

Graph Questions

1) Let G be a weighted connected un-directed graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE?
P: Minimum spanning tree of G does not change
Q: Shortest path between any pair of vertices does not change
(A) P only
(B) Q only
(C) Neither P nor Q
(D) Both P and

2) 
Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of G can have is _______

3) 
G = (V,E) is an undirected simple graph in which each edge has a distinct weight, and e is a particular edge of G. Which of the following statements about the minimum spanning trees (MSTs) of G is/are TRUE? 
I. If e is the lightest edge of some cycle in G, then every MST of G includes e
II. If e is the heaviest edge of some cycle in G, then every MST of G excludes e
(A) I only (B) II only (C) both I and II (D) neither I nor II

4)
List-I
A. Prim’s algorithm for minimum spanning tree
B. Floyd-Warshall algorithm for all pairs shortest paths
C. Mergesort
D. Hamiltonian circuit
List-II
1. Backtracking
2. Greed method
3. Dynamic programming
4. Divide and conquer
Codes:
    A B C D
(a) 3 2 4 1
(b) 1 2 4 3
(c) 2 3 4 1
(d) 2 1 3 4 

5) 
Graph - Topological Ordering


















Monday, October 23, 2017

MSDN Magazine

October 2017 Edition:
https://msdn.microsoft.com/en-us/magazine/mt826366

Septermber 2017:
https://msdn.microsoft.com/en-us/magazine/mt842553

August 2017:
https://msdn.microsoft.com/en-us/magazine/mt493452

Topics of interest:
Essential .NET - C# 7.0: Tuples Explained

July 2017:
https://msdn.microsoft.com/en-us/magazine/mt784654

Focus:
Machine Learning

June 2017:
https://msdn.microsoft.com/en-us/magazine/mt809110

Focus:
IoT
C# 

RegEx Tester

Do you want to test your regex pattern? Here you go which allows to identify whether your RegEx will work appropriately or not. It's very useful when coding with RegEx:

http://regexstorm.net/tester