CSP105 - MIDTERM
Cards (100)
- What is a technique for assessing an algorithm's performance by actually executing it on a computer with a variety of inputs to observe its behavior?
- What is a technique that can offer theoretical assurances about the worst or average-case performance of an algorithm?
- What is a technique that can offer more accurate projects of how the algorithm will behave in practice situations?
- This performs the same function as an algorithm through its paces on a set of input data and assesses how complex it is in terms of time and/or space?
- This includes employing software tools to track an algorithm's progress and determine how much time is spent at each phase in the process?
- This implies simulating an algorithm's behavior under various circumstances using software and evaluating the outcomes?
- This is capable of being accepted the performance differences between two algorithms that were run on the same input data?
- Where should we display the data to record, and then provide for the examination that an experiment produces?
- What is the practice of developing graphic representations of algorithms to help with understanding and analysis?
- By providing this for an algorithm's behavior, it can be easier to understand than lines of code or mathematical formulas?
- This helps build a collection of pictures or frames that depict the algorithm's development throughout time?
- This implies displaying the behavior if the algorithm using visual tools like flowcharts, tree diagrams, or graphs?
- This consists of developing captivating virtual worlds that let users explore and engage with the algorithm in a simulated environment?
- This visualization techniques can be helpful for outlining particular steps in the process or for displaying the algorithm's overall structure?
- This visualization techniques that users can see how the algorithm advances through various steps by watching the frames, which are often shown in a quick succession to provide the impression of motion?
- This visualization technique is instead of using static graphics, this can offer more immersive and interesting experience?
- What type of algorithm visualization is a series of still images show the evolution of an algorithm?
- What type of algorithm visualization that presents an algorithm's processes in a continuous, movie-like fashion. The more advanced option-animation-is unquestionably more challenging to achieve?
- This technique use when other algorithms could be too complicated or when the problem space is so small that this technique is a practice choice?
- What technique are frequently utilized in the field of computer science when a problem's solution is too complicated to be solved by other means?
- What technique can be used to address problems like cracking a code or password in cryptography?
- Brute force algorithm might not be able to address every problem. especially those that need for complex or original solutions?
- What technique can be an effective tool for solving a variety of problems, and it can be especially helpful when paired with other techniques like heuristic algorithms to increase efficiency and precision?
- In what type of brute force algorithm is every possible solution examined until the best one is identified?
- This kind of technique is employed in cryptography to break codes by testing every conceivable letter or number combination until the right one is discovered?
- This kind of algorithm generates every possible combination or permutation of a group of objects until the ideal answer is discovered?
- What type of brute force algorithm is when every possible solution is tested repeatedly in this kind of algorithm until the right one is found?
- Using an incremental approach to generating a solution and removing any partial answers that turn out to be incorrect, this kind of brute force algorithm explores all possible solutions. This approach is frequently used to resolve problems such as the Sudoku puzzle or the N-Queens problem?
- What a simple and efficient sorting algorithm that works by repeatedly selecting the smallest (or largest) element from the unsorted portion of the list and moving it to the sorted portion of the list?
- What simple sorting algorithm that continually swaps nearby elements if they are in an incorrect order?
- What search technique that examines each item in a list one by one until the target element is located, or until the end of the list is reached without finding the target element?
- What the algorithm works by comparing the pattern string with all possible substrings of the text string, one by one until a match is found or all substring have been checked?
- What is a computational challenge that entails determining the two or three closest points among a collection of points in a given space?
- What process involves computing the closest pairs in each smaller set of points, merging the results, and then dividing the larger set of points into smaller sets?
- What is the time complexity of Divide and conquer algorithm?
- These problem efficiently reduce the search space for the nearest pair of points by using geometric properties of the space?
- What is the most often used algorithms to solve in convex hull problem with a time complexity of O(n log n)?
- What problem-solving strategy is looking through every possible solution to a problem in an effort to identify the best one. When the search space is small enough to make it practical to check every possibility, this method is used?
- In order to address optimization issues, such as determining the shortest route between two points in a graph or the ideal setup for a system. this technique is frequently utilized?
- It means that finding the ideal solution for every case of the issue if computationally impractical?