Problems in NP and NP-hard are called.
","choices":[{"text":"P
","value":"A"},{"text":"BPP
","value":"B"},{"text":"NP Complete
","value":"C"},{"text":"Tractable
","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065026,"question":"NP hard problems are
","choices":[{"text":"Easy to solve
","value":"A"},{"text":"Alway solvable
","value":"B"},{"text":"As hard as NP problem
","value":"C"},{"text":"In class P
","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065025,"question":"NP Problems can be
","choices":[{"text":"Solved in polynomial time
","value":"A"},{"text":"Verified in polynomial time
","value":"B"},{"text":"Solved in exponeitial timeonly
","value":"C"},{"text":"Not verified
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065024,"question":"Problems in class P are solved in.
","choices":[{"text":"Exponentilal time
","value":"A"},{"text":"Polynomial time
","value":"B"},{"text":"Non determinaistic time
","value":"C"},{"text":"Ifinite time
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065023,"question":"Tractability depends on
","choices":[{"text":"Inputs
","value":"A"},{"text":"Complexity
","value":"B"},{"text":"Outputs
","value":"C"},{"text":"Algorthm type
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065022,"question":"Tractable prolem canbe solved
","choices":[{"text":"In exponential time
","value":"A"},{"text":"Efficiently with large input
","value":"B"},{"text":"With no algorithm
","value":"C"},{"text":"Are always NP hard
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065021,"question":"Knowing if a problem is solvable hellps.
","choices":[{"text":"Increase complexity
","value":"A"},{"text":"Save time
","value":"B"},{"text":"Generate random output
","value":"C"},{"text":"Avoid design
","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065020,"question":"Sovable problems differ becasue they.
","choices":[{"text":"Take exponential time
","value":"A"},{"text":"Need better hardware
","value":"B"},{"text":"Halt with a result
","value":"C"},{"text":"Have no input
","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065019,"question":"The Halting Problem is an example of.
","choices":[{"text":"Solvable problem
","value":"A"},{"text":"Tractable prolem
","value":"B"},{"text":"Unsolvable problem
","value":"C"},{"text":"NP Complete problem
","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065018,"question":"Which of the following correctly describes a solvable problem.
","choices":[{"text":"Cannot be solved
","value":"A"},{"text":"Takes infinite time
","value":"B"},{"text":"Soved by algorithm in finite time
","value":"C"},{"text":"Has no input/output
","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065017,"question":"When is Generate and Test best.
","choices":[{"text":"small prblem space
","value":"A"},{"text":"Large problem space
","value":"B"},{"text":"No testing needed
","value":"C"},{"text":"No solutions exist
","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":1065016,"question":"What is generate and Test algorithm
","choices":[{"text":"Tests all options
","value":"A"},{"text":"Picks one solution
","value":"B"},{"text":"skips testing
","value":"C"},{"text":"Uses no logic
","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":1065015,"question":"Why use real life tasks in algorithm learning.
","choices":[{"text":"Show steps in life
","value":"A"},{"text":"Make it harder
","value":"B"},{"text":"Reduce interest
","value":"C"},{"text":"Add confusion
","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":1065014,"question":"What does page rank algorithm analyze.
","choices":[{"text":"Page links
","value":"A"},{"text":"page color
","value":"B"},{"text":"Page size
","value":"C"},{"text":"Page font
","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":1065013,"question":"What is role of algorithm in problem solving.
","choices":[{"text":"Gives steps
","value":"A"},{"text":"Ignores logic
","value":"B"},{"text":"Random process
","value":"C"},{"text":"Blocks solutions
","value":"D"},{"value":"E"}],"correctAnswer":1}]