How does Divide and conquere work.
","choices":[{"text":"Make local chices
","value":"A"},{"text":"Break ,solve, combine
","value":"B"},{"text":"Store subproblem results
","value":"C"},{"text":"Try alloptions, backtrack
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065041,"question":"What is the primary goal of algorithm design techniques.
","choices":[{"text":"Improve hardware
","value":"A"},{"text":"Solve problems systematically
","value":"B"},{"text":"Reduce imput size
","value":"C"},{"text":"Debug software
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065040,"question":"What does space complexity measure.
","choices":[{"text":"Execution time
","value":"A"},{"text":"Memory usage
","value":"B"},{"text":"Number of steps
","value":"C"},{"text":"Result accuracy
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065039,"question":"Which is an example of O (log n) comlexity.
","choices":[{"text":"Sorting numbers
","value":"A"},{"text":"Pair comparison
","value":"B"},{"text":"Binary search
","value":"C"},{"text":"Linear search
","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065038,"question":"Waht does O (n2) indicate.
","choices":[{"text":"Linear growth
","value":"A"},{"text":"Constant time
","value":"B"},{"text":"Square of input
","value":"C"},{"text":"Logarithmic growth
","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065037,"question":"Which notation shows the upper bound of time complexity.
","choices":[{"text":"Omega
","value":"A"},{"text":"Theta
","value":"B"},{"text":"Big O
","value":"C"},{"text":"Lambda
","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065036,"question":"What does time complexity measrue.
","choices":[{"text":"Memory use
","value":"A"},{"text":"Time growth with input
","value":"B"},{"text":"Number of loops
","value":"C"},{"text":"Output accuracy
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065035,"question":"P vs NP asks if
","choices":[{"text":"Fast solutions are in NP
","value":"A"},{"text":"Check complexity
","value":"B"},{"text":"Debug rrors
","value":"C"},{"text":"Improve hardware
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065034,"question":"NP- complete matters because.
","choices":[{"text":"Solved faster than P
","value":"A"},{"text":"Solving one solves all NP
","value":"B"},{"text":"aLWAYS TRACTABLE
","value":"C"},{"text":"nO REAL USE
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065033,"question":"Which diagram shows P, NO, NP-hard,NP Complete
","choices":[{"text":"Bar chart
","value":"A"},{"text":"Pie chart
","value":"B"},{"text":"Venn diagram
","value":"C"},{"text":"Lne graph
","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065032,"question":"The halting problem is.
","choices":[{"text":"Solvable and tractable
","value":"A"},{"text":"Unsolable and in P
","value":"B"},{"text":"Unsolvable and not in NP
","value":"C"},{"text":"NP Complete
","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065031,"question":"Easy to verify but hard to solve problem are in.
","choices":[{"text":"NP
","value":"A"},{"text":"P
","value":"B"},{"text":"NP hard
","value":"C"},{"text":"Undecidable
","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":1065030,"question":"Why is tractability important.
","choices":[{"text":"Output color
","value":"A"},{"text":"Language choice
","value":"B"},{"text":"Solve efficiently
","value":"C"},{"text":"Input type
","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065029,"question":"If P= NP ,this means
","choices":[{"text":"Some NP unsolvable
","value":"A"},{"text":"all NP solvable inpolynomial time
","value":"B"},{"text":"All NP unsolvable
","value":"C"},{"text":"Same space complexity
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065028,"question":"Which is an NP complete problem.
","choices":[{"text":"Sorting
","value":"A"},{"text":"Knapsack
","value":"B"},{"text":"GCD finding
","value":"C"},{"text":"Binary search
","value":"D"},{"value":"E"}],"correctAnswer":2}]