[{"id":1065073,"question":"<p>How do BFS and DFS differ.</p>","choices":[{"text":"<p>BFS Stack, DFS -queue</p>","value":"A"},{"text":"<p>BFS -level , DFS -depth</p>","value":"B"},{"text":"<p>BFS Sort, DFS-Search</p>","value":"C"},{"text":"<p>BFS always slower</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065072,"question":"<p>Which alorithm finds node relationships in a graph.</p>","choices":[{"text":"<p>Bubble sort</p>","value":"A"},{"text":"<p>Linear Search&nbsp;</p>","value":"B"},{"text":"<p>BFS</p>","value":"C"},{"text":"<p>Selection sort</p>","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065070,"question":"<p>How does Linear search work</p>","choices":[{"text":"<p>Halve search interval</p>","value":"A"},{"text":"<p>Check each item one by one</p>","value":"B"},{"text":"<p>Explore branch deeply</p>","value":"C"},{"text":"<p>Use queue for nodes</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065069,"question":"<p>How does Linear Search work.</p>","choices":[{"text":"<p>Halve search interval</p>","value":"A"},{"text":"<p>Check each item one by oe</p>","value":"B"},{"text":"<p>Explore branch deeply</p>","value":"C"},{"text":"<p>Use queue for nodes</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065068,"question":"<p>What is the purpose of search algorithms</p>","choices":[{"text":"<p>Arrange data</p>","value":"A"},{"text":"<p>Find secific data</p>","value":"B"},{"text":"<p>analyze nodes</p>","value":"C"},{"text":"<p>Save memory</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065067,"question":"<p>How does selection sort work.</p>","choices":[{"text":"<p>Swap adjacent</p>","value":"A"},{"text":"<p>Select minium form unsorted part</p>","value":"B"},{"text":"<p>Use quenue for nodes</p>","value":"C"},{"text":"<p>Store intermediate results</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065066,"question":"<p>Why is bubble sort not for large datasets.</p>","choices":[{"text":"<p>Needs more memory</p>","value":"A"},{"text":"<p>O (n2) time complexity</p>","value":"B"},{"text":"<p>Works on sorted data only</p>","value":"C"},{"text":"<p>Can't handle numbers</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065065,"question":"<p>How does bubble sort work</p>","choices":[{"text":"<p>Select smallest and swap</p>","value":"A"},{"text":"<p>Swap adjacent if wrong</p>","value":"B"},{"text":"<p>Divide and merge</p>","value":"C"},{"text":"<p>Explore nodes level wise</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065064,"question":"<p>Whcih is a sorting algorithms.</p>","choices":[{"text":"<p>Linear search</p>","value":"A"},{"text":"<p>Qucik sort</p>","value":"B"},{"text":"<p>DFS</p>","value":"C"},{"text":"<p>BFS</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065063,"question":"<p>What do sorting algorithm mainly do.</p>","choices":[{"text":"<p>Network routing</p>","value":"A"},{"text":"<p>Arrange data</p>","value":"B"},{"text":"<p>Find node links</p>","value":"C"},{"text":"<p>Search data</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065062,"question":"<p>Why are commonly used algorithms important.</p>","choices":[{"text":"<p>Reduce hardware cost</p>","value":"A"},{"text":"<p>Solve common Problems efficiently</p>","value":"B"},{"text":"<p>Remvoe need for data structure</p>","value":"C"},{"text":"<p>For theory only</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065061,"question":"<p>For which problems is Backtracking suitable</p>","choices":[{"text":"<p>Optimal substrcuture</p>","value":"A"},{"text":"<p>Explore all combnations</p>","value":"B"},{"text":"<p>ONe optimal choice</p>","value":"C"},{"text":"<p>No overlapping problems</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065060,"question":"<p>How does Backtracking work.</p>","choices":[{"text":"<p>Break in to parts</p>","value":"A"},{"text":"<p>Make local choices</p>","value":"B"},{"text":"<p>Build and backtrack</p>","value":"C"},{"text":"<p>Store subproblems</p>","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":1065059,"question":"<p>Which is solved by dynamic programming.</p>","choices":[{"text":"<p>Coin change</p>","value":"A"},{"text":"<p>Fibonacci sequence</p>","value":"B"},{"text":"<p>Merge sort</p>","value":"C"},{"text":"<p>Puzzle solving</p>","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":1065058,"question":"<p>What is the main advantage of Dynamic programming.</p>","choices":[{"text":"<p>Avoid redundant work</p>","value":"A"},{"text":"<p>Locally optimal results</p>","value":"B"},{"text":"<p>Solve independent problems</p>","value":"C"},{"text":"<p>Explore alloptions</p>","value":"D"},{"value":"E"}],"correctAnswer":1}]