Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
Computer Science Ics Part 1 Online Test
| Sr. # | Questions | Answers Choice |
|---|---|---|
| 1 | How does Divide and conquere work. |
<p>Make local chices</p> <p>Break ,solve, combine</p> <p>Store subproblem results</p> <p>Try alloptions, backtrack</p> |
| 2 | What is the primary goal of algorithm design techniques. |
<p>Improve hardware</p> <p>Solve problems systematically</p> <p>Reduce imput size</p> <p>Debug software</p> |
| 3 | What does space complexity measure. |
<p>Execution time</p> <p>Memory usage</p> <p>Number of steps</p> <p>Result accuracy</p> |
| 4 | Which is an example of O (log n) comlexity. |
<p>Sorting numbers</p> <p>Pair comparison</p> <p>Binary search</p> <p>Linear search</p> |
| 5 | Waht does O (n2) indicate. |
<p>Linear growth</p> <p>Constant time</p> <p>Square of input</p> <p>Logarithmic growth</p> |
| 6 | Which notation shows the upper bound of time complexity. |
<p>Omega</p> <p>Theta</p> <p>Big O</p> <p>Lambda</p> |
| 7 | What does time complexity measrue. |
<p>Memory use</p> <p>Time growth with input</p> <p>Number of loops</p> <p>Output accuracy</p> |
| 8 | P vs NP asks if |
<p>Fast solutions are in NP</p> <p>Check complexity</p> <p>Debug rrors</p> <p>Improve hardware</p> |
| 9 | NP- complete matters because. |
<p>Solved faster than P</p> <p>Solving one solves all NP</p> <p>aLWAYS TRACTABLE</p> <p>nO REAL USE</p> |
| 10 | Which diagram shows P, NO, NP-hard,NP Complete |
<p>Bar chart</p> <p>Pie chart</p> <p>Venn diagram</p> <p>Lne graph</p> |
| 11 | The halting problem is. |
<p>Solvable and tractable</p> <p>Unsolable and in P</p> <p>Unsolvable and not in NP</p> <p>NP Complete</p> |
| 12 | Easy to verify but hard to solve problem are in. |
<p>NP</p> <p>P</p> <p>NP hard</p> <p>Undecidable</p> |
| 13 | Why is tractability important. |
<p>Output color</p> <p>Language choice</p> <p>Solve efficiently</p> <p>Input type</p> |
| 14 | If P= NP ,this means |
<p>Some NP unsolvable</p> <p>all NP solvable inpolynomial time</p> <p>All NP unsolvable</p> <p>Same space complexity</p> |
| 15 | Which is an NP complete problem. |
<p>Sorting </p> <p>Knapsack</p> <p>GCD finding</p> <p>Binary search</p> |
