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 do BFS and DFS differ. |
<p>BFS Stack, DFS -queue</p> <p>BFS -level , DFS -depth</p> <p>BFS Sort, DFS-Search</p> <p>BFS always slower</p> |
| 2 | Which alorithm finds node relationships in a graph. |
<p>Bubble sort</p> <p>Linear Search </p> <p>BFS</p> <p>Selection sort</p> |
| 3 | How does Linear search work |
<p>Halve search interval</p> <p>Check each item one by one</p> <p>Explore branch deeply</p> <p>Use queue for nodes</p> |
| 4 | How does Linear Search work. |
<p>Halve search interval</p> <p>Check each item one by oe</p> <p>Explore branch deeply</p> <p>Use queue for nodes</p> |
| 5 | What is the purpose of search algorithms |
<p>Arrange data</p> <p>Find secific data</p> <p>analyze nodes</p> <p>Save memory</p> |
| 6 | How does selection sort work. |
<p>Swap adjacent</p> <p>Select minium form unsorted part</p> <p>Use quenue for nodes</p> <p>Store intermediate results</p> |
| 7 | Why is bubble sort not for large datasets. |
<p>Needs more memory</p> <p>O (n2) time complexity</p> <p>Works on sorted data only</p> <p>Can't handle numbers</p> |
| 8 | How does bubble sort work |
<p>Select smallest and swap</p> <p>Swap adjacent if wrong</p> <p>Divide and merge</p> <p>Explore nodes level wise</p> |
| 9 | Whcih is a sorting algorithms. |
<p>Linear search</p> <p>Qucik sort</p> <p>DFS</p> <p>BFS</p> |
| 10 | What do sorting algorithm mainly do. |
<p>Network routing</p> <p>Arrange data</p> <p>Find node links</p> <p>Search data</p> |
| 11 | Why are commonly used algorithms important. |
<p>Reduce hardware cost</p> <p>Solve common Problems efficiently</p> <p>Remvoe need for data structure</p> <p>For theory only</p> |
| 12 | For which problems is Backtracking suitable |
<p>Optimal substrcuture</p> <p>Explore all combnations</p> <p>ONe optimal choice</p> <p>No overlapping problems</p> |
| 13 | How does Backtracking work. |
<p>Break in to parts</p> <p>Make local choices</p> <p>Build and backtrack</p> <p>Store subproblems</p> |
| 14 | Which is solved by dynamic programming. |
<p>Coin change</p> <p>Fibonacci sequence</p> <p>Merge sort</p> <p>Puzzle solving</p> |
| 15 | What is the main advantage of Dynamic programming. |
<p>Avoid redundant work</p> <p>Locally optimal results</p> <p>Solve independent problems</p> <p>Explore alloptions</p> |
