Computer Science Ics Part 1 Online Test With Answers

Computer Science Ics Part 1 Online Test

Sr. # Questions Answers Choice
1

Problems in NP and NP-hard are called.

<p>P</p> <p>BPP</p> <p>NP Complete</p> <p>Tractable</p>
2

NP hard problems are

<p>Easy to solve</p> <p>Alway solvable</p> <p>As hard as NP problem</p> <p>In class P</p>
3

NP Problems can be

<p>Solved in polynomial time</p> <p>Verified in polynomial time</p> <p>Solved in exponeitial timeonly</p> <p>Not verified</p>
4

Problems in class P are solved in.

<p>Exponentilal time</p> <p>Polynomial time</p> <p>Non determinaistic time</p> <p>Ifinite time</p>
5

Tractability depends on 

<p>Inputs</p> <p>Complexity</p> <p>Outputs</p> <p>Algorthm type</p>
6

Tractable prolem canbe solved

<p>In exponential time</p> <p>Efficiently with large input</p> <p>With no algorithm</p> <p>Are always NP hard</p>
7

Knowing if a problem is solvable hellps.

<p>Increase complexity</p> <p>Save time</p> <p>Generate random output</p> <p>Avoid design</p>
8

Sovable problems differ becasue they.

<p>Take exponential time</p> <p>Need better hardware</p> <p>Halt with a result</p> <p>Have no input</p>
9

The Halting Problem is an example of.

<p>Solvable problem</p> <p>Tractable prolem</p> <p>Unsolvable problem</p> <p>NP Complete problem</p>
10

Which of the following correctly describes a solvable problem.

<p>Cannot be solved</p> <p>Takes infinite time</p> <p>Soved by algorithm in finite time</p> <p>Has no input/output</p>
11

When is Generate and Test best.

<p>small prblem space</p> <p>Large problem space</p> <p>No testing needed</p> <p>No solutions exist</p>
12

What is generate and Test algorithm

<p>Tests all options</p> <p>Picks one solution</p> <p>skips testing</p> <p>Uses no logic</p>
13

Why use real life tasks in algorithm learning.

<p>Show steps in life</p> <p>Make it harder</p> <p>Reduce interest</p> <p>Add confusion&nbsp;</p>
14

What does page rank algorithm analyze.

<p>Page links</p> <p>page color</p> <p>Page size</p> <p>Page font</p>
15

What is role of algorithm in problem solving.

<p>Gives steps</p> <p>Ignores logic</p> <p>Random process</p> <p>Blocks solutions</p>
Download This Set

Is this page helpful?