Complexity Complexity brute-force solution, Kolmogorov complexity, Complexity science, Chaotic systems, Complex adaptive systems, Merge Sort, priority queue 1 / 10 For a traveling salesman problem (TSP) with n cities, what is the time complexity of a brute-force solution? O(n) O(n!) O(n^2) O(log n) 2 / 10 What is the Kolmogorov complexity of a string? The length of its shortest description The number of characters in the string The number of times it repeats The number of operations to generate it 3 / 10 What is the primary focus of complexity science in physics? Studying simple systems Understanding emergent phenomena in complex systems Investigating linear relationships Determining particle behavior 4 / 10 Which is a key feature of chaotic systems in complexity theory? Deterministic but unpredictable behavior Predictability Lack of initial condition sensitivity Linear equations 5 / 10 Which of the following is a characteristic of complex adaptive systems? Lack of feedback loops Self-organization and adaptation Single-layer interactions Predictable behavior 6 / 10 What is the time complexity of the Merge Sort algorithm in the worst case? O(n) O(n^2) O(n log n) O(log n) 7 / 10 A Turing machine has a single tape and processes an input of length n in O(2^n) time. What type of complexity class does this belong to? P NP EXP BPP 8 / 10 If a problem has a solution with a time complexity of O(n!), it is most likely a problem in: P NP-complete NP-hard BPP 9 / 10 Calculate the number of steps required for binary search in the worst case for an array of size 1024. 10 11 9 12 10 / 10 The time complexity of finding the shortest path in a graph using Dijkstra’s algorithm with a priority queue is: O((V+E) log V) O(E + V^2) O(VE) O(V^3) Your score is By WordPress Quiz plugin
