A) Electrical grids B) Computer networks C) Financial market analysis D) Handwriting recognition
A) Kruskal's algorithm B) Christofides algorithm C) Dijkstra's algorithm D) Prim's algorithm
A) Single-linkage clustering B) DBSCAN C) Mean-shift clustering D) K-means clustering
A) Voltage regulation B) Signal amplification C) Heat dissipation reduction D) Efficient multiple constant multiplications
A) Calculating tax liabilities B) Visualizing relationships between stocks C) Predicting daily stock volatility D) Automated high-frequency trading
A) Encryption key distribution B) Firewall configuration C) Constructing trees for broadcasting D) Dynamic routing protocol design
A) Socio-geographic regionalisation B) Meteorological forecasting C) Political lobbying D) Urban population census
A) Pixel resolution upscaling B) Curvilinear feature extraction C) Color space normalization D) Frame rate optimization
A) Calculating thermal conductivity B) Identifying atomic composition C) Testing electrical resistance D) Measuring homogeneity
A) Linear programming relaxation B) Minimum-cost weighted perfect matching C) Maximum bipartite matching D) Quadratic assignment problem
A) It is excluded from all MSTs. B) It belongs to exactly one MST. C) It belongs to all MSTs of the graph. D) It belongs to no MSTs.
A) None of these edges are in any MST. B) Only one of them is in any MST. C) They must all be in every MST. D) Each such edge is contained in some minimum spanning tree.
A) This edge is only included if there is only one vertex. B) This edge is never included in an MST. C) This edge is included in any MST. D) This edge is only included if the graph is a tree.
A) Prim B) Dijkstra C) Vojtěch Jarník D) Otakar Borůvka
A) It is reduced by at least half. B) It increases by one. C) It remains the same. D) It doubles.
A) O(m log n) B) O(n2) C) O(n log n) D) O(m log m)
A) Dijkstra B) Otakar Borůvka C) Kruskal D) Vojtěch Jarník
A) One edge at a time from an arbitrary vertex. B) By removing the heaviest edges. C) By contracting all vertices. D) By adding all edges at once.
A) O(n log n) or O(n + m log n) B) O(m log n) or O(m + n log n) C) O(log n) or O(n) D) O(m log m) or O(m2)
A) O(m log n) B) O(m log n (log log n)3) C) O(m + n log n) D) O(n log n)
A) Divide and conquer algorithms B) Backtracking algorithms C) Greedy algorithms D) Dynamic programming algorithms
A) NP B) Exponential time C) FP D) P-space
A) Only for small graphs B) Yes C) Only for trees D) No
A) Fibonacci heap B) Soft heap C) Binary search tree D) Disjoint set union
A) Exactly 10 B) No greater than 4 C) Exactly 1 D) Infinity
A) r4 B) log r C) r D) r2
A) 2r2 B) r! C) 2r D) r2
A) Seth Pettie and Vijaya Ramachandran B) Alan M. Frieze and Svante Janson C) Vijaya Ramachandran and Svante Janson D) J. Michael Steele and Seth Pettie
A) The total weight of the global MST B) The entire graph structure C) The coordinates of all other nodes D) Only its own connected links
A) Alan M. Frieze B) Seth Pettie C) J. Michael Steele D) Svante Janson
A) Backtracking B) The ellipsoid method C) Greedy algorithm D) Dynamic programming
A) Polynomial time B) Logarithmic time C) Linear time D) NP-hard
A) Bipartite matching problem B) Hamiltonian cycle problem C) Maximum flow problem D) Shortest path problem
A) P B) O(V log V) C) NP-complete D) NP-hard
A) Euclidean distance B) Chebyshev distance C) Rectilinear distance D) Manhattan distance |