Why are commonly used algorithms important.
","choices":[{"text":"Reduce hrdware cost
","value":"A"},{"text":"Solve common problems efficiently
","value":"B"},{"text":"Remove need for data structures
","value":"C"},{"text":"for theory only
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065056,"question":"For which problems is Backtrackign suitable.
","choices":[{"text":"Optimal substructure
","value":"A"},{"text":"Explore all combinations
","value":"B"},{"text":"One optimal choice
","value":"C"},{"text":"No overlapping problems
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065055,"question":"How does Backtracking work.
","choices":[{"text":"Break into parts
","value":"A"},{"text":"Build and Backtrack
","value":"B"},{"text":"Store subproblems
","value":"C"},{"text":"Make local choices
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065054,"question":"Which is solved by Dynamic Programming.
","choices":[{"text":"Coin Change
","value":"A"},{"text":"Fibonacci sequence
","value":"B"},{"text":"Merge sort
","value":"C"},{"text":"Puzzle solving
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065053,"question":"What is the main advantage of Dynamic Programming.
","choices":[{"text":"Avoid redundant work
","value":"A"},{"text":"Locally optmal results
","value":"B"},{"text":"Sole independent problems
","value":"C"},{"text":"Explore all options
","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":1065052,"question":"What is a key limitatio of Greedy Algorithms.
","choices":[{"text":"Too complex
","value":"A"},{"text":"Always optimal
","value":"B"},{"text":"Not always optimal
","value":"C"},{"text":"High memory use
","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065051,"question":"For which problems is Backtracing suitable.
","choices":[{"text":"Optimal substrcuture
","value":"A"},{"text":"Explore all combinations
","value":"B"},{"text":"ON optimal choice
","value":"C"},{"text":"No overlapping problems
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065050,"question":"Which is solved by Dynaimc programming.
","choices":[{"text":"Coin Change
","value":"A"},{"text":"Fibonacci sequence
","value":"B"},{"text":"Merge sort
","value":"C"},{"text":"Puzzle solving
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065049,"question":"What is the main advantages of dynamic programming.
","choices":[{"text":"Avoid redundant work
","value":"A"},{"text":"Locally optimal results
","value":"B"},{"text":"Solves independent problems
","value":"C"},{"text":"Explore alloptions
","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":1065048,"question":"What is limitation Greedy algorithms
","choices":[{"text":"Too complex
","value":"A"},{"text":"Always optimal
","value":"B"},{"text":"Not always optimal
","value":"C"},{"text":"High memory use
","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065047,"question":"Which is a Greedy Algorithm example
","choices":[{"text":"Fibonacci sequence
","value":"A"},{"text":"Coin change
","value":"B"},{"text":"Merge sort
","value":"C"},{"text":"Puzzle solving
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065046,"question":"What defines a Greedy algorithm
","choices":[{"text":"Explore all solutions
","value":"A"},{"text":"Make best local choice
","value":"B"},{"text":"Store results
","value":"C"},{"text":"Divide problems
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065045,"question":"Which technique is used in Merge sort.
","choices":[{"text":"Greedy
","value":"A"},{"text":"Divide and conqurer
","value":"B"},{"text":"Dynaimc Programming
","value":"C"},{"text":"Back tracking
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065044,"question":"How does Divide and conqurr work
","choices":[{"text":"Make local choices
","value":"A"},{"text":"Break, sole, combine
","value":"B"},{"text":"Store subproblem results
","value":"C"},{"text":"Try all options, backtrack
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065043,"question":"What is the primary goal of algorithm design techniques.
","choices":[{"text":"Imporve hardware
","value":"A"},{"text":"Sovle problems systematically
","value":"B"},{"text":"Reduce input size
","value":"C"},{"text":"Debug software
","value":"D"},{"value":"E"}],"correctAnswer":2}]