[{"id":1065012,"question":"<p>What is outpout when checking if 8 is even.</p>","choices":[{"text":"<p>Found at 2</p>","value":"A"},{"text":"<p>Even</p>","value":"B"},{"text":"<p>Odd</p>","value":"C"},{"text":"<p>Yes</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065011,"question":"<p>Whcih is an III-defined problem.</p>","choices":[{"text":"<p>Check even number</p>","value":"A"},{"text":"<p>Find shortest path</p>","value":"B"},{"text":"<p>Reduce poverty</p>","value":"C"},{"text":"<p>Count book arrangements</p>","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065010,"question":"<p>Which problem gives yes /no answer.</p>","choices":[{"text":"<p>Search</p>","value":"A"},{"text":"<p>Decision</p>","value":"B"},{"text":"<p>Optimization&nbsp;</p>","value":"C"},{"text":"<p>Counting</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065009,"question":"<p>What does “input” mean in a computational problem.</p>","choices":[{"text":"<p>Result after processing</p>","value":"A"},{"text":"<p>Steps to solve</p>","value":"B"},{"text":"<p>Data at start</p>","value":"C"},{"text":"<p>Type of problem</p>","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065008,"question":"<p>What is computational problem.</p>","choices":[{"text":"<p>solved using algorithm</p>","value":"A"},{"text":"<p>Solved using creativity</p>","value":"B"},{"text":"<p>Has unclear input</p>","value":"C"},{"text":"<p>Has no process</p>","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":1065007,"question":"<p>An algorithm with a time complexity of &nbsp;O(n log n):</p>","choices":[{"text":"<p>Bubble sort</p>","value":"A"},{"text":"<p>Binary Search</p>","value":"B"},{"text":"<p>Merge Sort</p>","value":"C"},{"text":"<p>Insertion sort</p>","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065006,"question":"<p>An algorithm that sort data by stepping thourgh the list and swapping adjacent elements if needed is.</p>","choices":[{"text":"<p>Selection sort</p>","value":"A"},{"text":"<p>Quick sort</p>","value":"B"},{"text":"<p>Bubble sort</p>","value":"C"},{"text":"<p>Merge sort</p>","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065005,"question":"<p>A seenario where Dynaimic progrmming proves most useful&nbsp;</p>","choices":[{"text":"<p>Problem withou overlapping sub problems</p>","value":"A"},{"text":"<p>Problems solved by making local choices</p>","value":"B"},{"text":"<p>Problems with overlapping sub problems and optimal sbstructure</p>","value":"C"},{"text":"<p>Problem divided into independent sub problems</p>","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065004,"question":"<p>Seach algorithm more efficinet for large datasets.</p>","choices":[{"text":"<p>Bubble sort</p>","value":"A"},{"text":"<p>Merge sort</p>","value":"B"},{"text":"<p>Quick Sort</p>","value":"C"},{"text":"<p>Selection sort</p>","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065003,"question":"<p>The meanig of NP in computational complexity is.</p>","choices":[{"text":"<p>Non deterministic polynomial time</p>","value":"A"},{"text":"<p>Negative polynomial time</p>","value":"B"},{"text":"<p>No trivial polynomial time</p>","value":"C"},{"text":"<p>Numerical polynomial time</p>","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":1065002,"question":"<p>The statement ghat applies to unsolvable problem&nbsp;</p>","choices":[{"text":"<p>They can be solved in polynomial time&nbsp;</p>","value":"A"},{"text":"<p>They cannot be solved by any alogorithm</p>","value":"B"},{"text":"<p>They are always in NP class</p>","value":"C"},{"text":"<p>They require exponetial time to solve</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065001,"question":"<p>Complexity class representing problesm solvable efficinetly by a deterministic alogrithm .</p>","choices":[{"text":"<p>P</p>","value":"A"},{"text":"<p>NP-Hard</p>","value":"B"},{"text":"<p>NP</p>","value":"C"},{"text":"<p>NP -Complete</p>","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":1065000,"question":"<p>The characteristic of a well defined problem is.</p>","choices":[{"text":"<p>Ambiguous goals and uncelear requirements</p>","value":"A"},{"text":"<p>Vegue processes and inputs</p>","value":"B"},{"text":"<p>Clear goas, inpus, processes, and oututs&nbsp;</p>","value":"C"},{"text":"<p>Undrined solutions</p>","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1064999,"question":"<p>What is the result of &nbsp;3** 2 ?</p>","choices":[{"text":"<p>6</p>","value":"A"},{"text":"<p>5</p>","value":"B"},{"text":"<p>8</p>","value":"C"},{"text":"<p>9</p>","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":1064998,"question":"<p>What does 'lambda x :x * 2 \" do ?</p>","choices":[{"text":"<p>Defines a recursive funtion&nbsp;</p>","value":"A"},{"text":"<p>Creates an anonymous function&nbsp;</p>","value":"B"},{"text":"<p>Raises an error</p>","value":"C"},{"text":"<p>Defines a clss</p>","value":"D"},{"value":"E"}],"correctAnswer":2}]