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