Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
Computer Science Ics Part 1 Chapter 3 Online Test
| Sr. # | Questions | Answers Choice |
|---|---|---|
| 1 | Why are commonly used algorithms important. |
<p>Reduce hrdware cost</p> <p>Solve common problems efficiently</p> <p>Remove need for data structures</p> <p>for theory only</p> |
| 2 | For which problems is Backtrackign suitable. |
<p>Optimal substructure</p> <p>Explore all combinations</p> <p>One optimal choice</p> <p>No overlapping problems</p> |
| 3 | How does Backtracking work. |
<p>Break into parts</p> <p>Build and Backtrack</p> <p>Store subproblems</p> <p>Make local choices</p> |
| 4 | Which is solved by Dynamic Programming. |
<p>Coin Change</p> <p>Fibonacci sequence</p> <p>Merge sort</p> <p>Puzzle solving</p> |
| 5 | What is the main advantage of Dynamic Programming. |
<p>Avoid redundant work</p> <p>Locally optmal results</p> <p>Sole independent problems</p> <p>Explore all options</p> |
| 6 | What is a key limitatio of Greedy Algorithms. |
<p>Too complex</p> <p>Always optimal</p> <p>Not always optimal</p> <p>High memory use</p> |
| 7 | For which problems is Backtracing suitable. |
<p>Optimal substrcuture</p> <p>Explore all combinations</p> <p>ON optimal choice</p> <p>No overlapping problems</p> |
| 8 | Which is solved by Dynaimc programming. |
<p>Coin Change</p> <p>Fibonacci sequence</p> <p>Merge sort</p> <p>Puzzle solving</p> |
| 9 | What is the main advantages of dynamic programming. |
<p>Avoid redundant work</p> <p>Locally optimal results</p> <p>Solves independent problems</p> <p>Explore alloptions</p> |
| 10 | What is limitation Greedy algorithms |
<p>Too complex</p> <p>Always optimal</p> <p>Not always optimal</p> <p>High memory use</p> |
| 11 | Which is a Greedy Algorithm example |
<p>Fibonacci sequence</p> <p>Coin change</p> <p>Merge sort</p> <p>Puzzle solving</p> |
| 12 | What defines a Greedy algorithm |
<p>Explore all solutions</p> <p>Make best local choice</p> <p>Store results</p> <p>Divide problems</p> |
| 13 | Which technique is used in Merge sort. |
<p>Greedy</p> <p>Divide and conqurer</p> <p>Dynaimc Programming</p> <p>Back tracking</p> |
| 14 | How does Divide and conqurr work |
<p>Make local choices</p> <p>Break, sole, combine</p> <p>Store subproblem results</p> <p>Try all options, backtrack</p> |
| 15 | What is the primary goal of algorithm design techniques. |
<p>Imporve hardware</p> <p>Sovle problems systematically</p> <p>Reduce input size</p> <p>Debug software</p> |
