FTCE Computer Science K12 Exam Prep (18-19 Questions & Answers 100% Verified

Asymptotic Analysis - ANSWER-How the run time of a program depends on the size of the problem Exact Analysis - ANSWER-Provides a more specific measure of algorithm efficiency than asymptotic analysis. Divide and Conquer Algorithm - ANSWER-An algorithm that solves a problem recursively by splitting it into a fixed number of smaller non-overlapping subproblems of the same type Greedy Algorithm - ANSWER-An algorithm that follows problem solving heuristic of making optimal choices at each stage. Disadvantages of Greedy Algorithms - ANSWER-1. Short sighted 2. Non-Recoverable Backtracking Algorithm - ANSWER-A general algorithm for finding all (or some) solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons a candidate ("backtracks") as soon as it determines that the candidate cannot possibly be completed to a valid solution. Branch and Bound Algorithm - ANSWER-Eliminates groups of trees from consideration upon discovering that all their members are worse than the best tree found so far Sorting Algorithms - ANSWER-arrange items in a list in a particular order Multiplication Algorithm - ANSWER-Performs the basic operations of single-digit arithmetic. Graph Searching Algorithm - ANSWER-Searches for the number of graph edges and number of graph nodes. Big Theta Notation - ANSWER-A method of classifying the time complexity of algorithms according to realistic sets of bounding criteria that can be used to provide the best and worst case scenarios.