Western Governors University (WGU) C839v5 / D334 Algorithms Practice Test

These questions are part of the practice quiz. Start practicing

• In algorithmic terms, how is a graph defined?
• What is defined as a linear search?
• Which characteristic best describes Mickey v2 concerning its key size?
• What defines a binary tree?
• When is an algorithm considered efficient?
• What is the key size and IV value for the lightweight symmetric stream cipher Rabbit?
• What is the best case time complexity of a linear search?
• How many rounds does the 3DES encryption standard typically process?
• Which of the following is an example of a divide-and-conquer algorithm?
• Which of the following algorithms uses a key size of 128 bits?
• What does "in-place" mean in the context of sorting algorithms?
• Which of the following best describes the relationship between trees and graphs?
• What is one primary benefit of using a minimum spanning tree algorithm like Prim's?
• What is the key size in bits used by the RC2 encryption algorithm?
• What is the primary goal of dynamic programming?
• Why is algorithm efficiency important?
• Which feature distinguishes a dynamic array from a static array?
• What is the traveling salesman problem?
• How does a lightweight stream cipher like Mickey v2 compare to traditional ciphers?
• What is an order of growth in algorithms?
• What technique can be used for resolving collisions in hash tables when a new key hashes to an already occupied slot?
• What is the key size and IV value for the lightweight symmetric stream cipher Enocoro?
• What is the main advantage of a binary search?
• What is the block size utilized by AES?
• What is the significance of the P vs NP problem?
• How many rounds are used in Blowfish encryption?
• What is the hash output length of the SHA-1 algorithm?
• What is the hash value output size for MD5?
• How does Merge Sort operate on an array?
• What does it mean to validate an algorithm?
• How is a directed graph defined?
• What is the purpose of a weighted adjacency list in graph representation?
• What is the key size in bits used with the RC6 encryption algorithm?
• Which of the following best describes a graph?
• What type of searching algorithm is binary search?
• Which type of tree structure allows for organized searching and sorting?
• What is Big O notation used for?
• What defines a hash table?
• Which of the following is NOT a common sorting algorithm?
• Which data structure operates on the First In First Out (FIFO) principle?
• What is backtracking used for in algorithms?
• What is the purpose of dynamic programming?
• In algorithms, what is the purpose of a heuristic?
• What distinguishes exhaustive search from informed search in algorithm design?
• What block size is used by the Clefia encryption algorithm?
• What is the primary advantage of using variable IV values in encryption?
• What is the KMP algorithm primarily used for?
• What are the block size, key size, and number of rounds used in DES encryption?
• How does a linear search work?
• What is the Traveling Salesperson Problem (TSP)?
• What is the block size used by the Present encryption algorithm?
• What does space complexity measure?
• Which aspect of the initialization vector in the Mickey v2 cipher is true?
• In which scenario would Quick Sort be less efficient?
• What characteristic differentiates Mickey v2 from many other ciphers?
• What is the main role of the A* algorithm?
• What does "divide-and-conquer" refer to in algorithm design?
• What does time complexity describe in an algorithm?
• What defines a monoid in mathematical terms?
• Why are random number generators vital in algorithms like quicksort?
• What is a binary tree?
• What does graph isomorphism refer to?
• What type of cipher is Mickey v2 considered?
• What is a palindromic string?
• What block size is used by the Twofish encryption algorithm?
• What type of algorithm is quicksort?
• What is the role of a pivot in quicksort?
• Which structure is best suited for implementing LIFO behavior?
• What is the length of the hash value output of MD2?
• How many bits is the nonce used in ChaCha?
• Which encryption method uses a block size of 128 bits?
• What characterizes a greedy algorithm?
• What key sizes are available for the Camellia encryption algorithm?
• What is the length of the SHA-1 hash value?
• What unique characteristic does a tree have compared to other data structures?
• What is meant by the term "big O notation"?
• Why is it important for algorithms to have well-defined inputs and outputs?
• What key sizes can be used with AES encryption?
• Which key size does Clefia encryption support?
• Which of the following describes a sorting algorithm?
• How does an algorithm typically handle collisions in a hash table?
• What follows the Last In First Out (LIFO) principle?
• What is the variable key size range for RSA?
• What is a common application of a binary search tree?
• What is the primary purpose of dynamic programming?
• What condition must be fulfilled to apply binary search?
• In what context is Mickey v2 primarily used?
• What is the purpose of the base case in recursion?
• In the context of dynamic programming, what is a subproblem?
• What is the typical benefit of using memoization in algorithms?
• What is the block cipher key size for Kasumi (A5/3)?
• Which of the following best defines a collection of nodes (vertices) and edges?
• Which of the following is NOT a key characteristic of a good algorithm?
• What is an algorithm?
• How does a queue operate in computer programming?
• What is backtracking in algorithm design?
• What is the maximum hash value output length for MD6?
• What hash value is produced by Quark?
• Which of the following describes a greedy algorithm?
• Which traversal algorithm explores all neighbor nodes at the present depth before moving to the next depth level?
• How is a tree data structure structured?
• What does linear complexity, denoted as O(n), indicate about an algorithm?
• How is a weighted graph defined?
• What is a decision tree in the context of algorithms?
• What is Prim’s algorithm primarily used for?
• What output length is typical for the MD5 hash function?
• What is the primary use of the Bellman-Ford algorithm?
• What is the maximum key size that can be used in Blowfish encryption?
• What key size is employed in the XTEA algorithm?
• What is the maximum length of the initialization vector (IV) for the Mickey v2 stream cipher?
• How many rounds does the symmetric block cipher Twofish use?
• What is the key size in bits for the Chaskey cipher?
• What best describes a characteristic of NP-complete problems?
• What effect does the depth of a tree have on operations such as insertion and search?
• What is the term for the approach that focuses on breaking a problem down into subproblems?
• How does collision resolution work in a hash table?
• What is the key size typically used for the Present cipher?
• Which of the following is a common sorting algorithm?
• Which algorithmic technique involves searching through all potential solutions?
• What is recursion in programming?
• Which block sizes are utilized by the symmetric block cipher RC5?
• What does O(n log n) signify in algorithm analysis?
• What is the IV value used for the stream cipher Enocoro?
• What is the function of the Master Theorem in algorithm analysis?
• How does depth-first search (DFS) differ from breadth-first search (BFS)?
• What is the key size commonly used with the Mickey v2 stream cipher?
• Which statement is true regarding the Mickey v2 cipher's security?
• What does the divide and conquer strategy entail in algorithm design?
• What distinguishes directed graphs from undirected graphs?
• What is tree traversal?
• What is the key size and IV value for the lightweight symmetric stream cipher Grain?
• What is a hash table?
• What is Dijkstra's algorithm primarily used for?
• What characterizes a weighted graph?
• What type of algorithm is used to optimize a solution by selecting the best choice available at each step?
• What describes Breadth-First Search (BFS)?
• What are the key and nonce sizes used with ChaCha?
• What is a search algorithm used for?
• What is the key size used in Clefia encryption?
• What are the key size and IV value for the lightweight symmetric stream cipher Trivum?
• What is the number of rounds used in Camellia encryption?
• How many rounds are used with the lightweight symmetric block cipher Present?
• Which of the following describes the IV length of the Mickey v2 cipher?
• Which algorithm is primarily used for finding the minimum spanning tree in a graph?
• How many rounds are used in the asymmetric cipher RSA?
• What characteristic does a stack have in comparison to other data structures?
• What is the key size used by the Blowfish encryption algorithm?
• What characteristic does a monoid ensure regarding its operations?
• Which characteristic best describes a hash function?
• What is a possible key size for the symmetric stream cipher RC4?
• What is the hash value output size of MD4?
• What characterizes Depth-First Search (DFS)?
• What is involved in graph traversal?
• What does time complexity measure?
• What is the key size for RC4 when it is utilized with WEP?
• Which of the following is NOT a characteristic of Merge Sort?
• What does space complexity measure in an algorithm?
• Which algorithmic approach is well suited for finding the shortest path in a graph?
• What is the main function of the bubble sort algorithm?
• What is a primary benefit of using the KMP algorithm for substring searches?
• Why might a developer choose to use Mickey v2 in an application?
• What characterizes a binary search tree (BST)?
• What characterizes a priority queue?
• How many rounds does Skipjack use for encryption?
• What does it mean for an algorithm to be efficient?
• What type of data structure is a stack?
• What is the key size for RC4 when used with WPA?
• What is the role of a random number generator in algorithms?
• How is a directed acyclic graph (DAG) utilized in computing?
• How many rounds does the RC2 algorithm perform during encryption?
• How would you define a binary search tree?
• What principle does a queue follow in data structures?
• What is the outcome when implementing a depth-first search algorithm?
• What is the key size range for Twofish encryption?
• Which of the following best describes an efficient algorithm?
• What characterizes an effective algorithm?
• Which of the following is NOT a characteristic of greedy algorithms?
• Which of the following describes dynamic programming?
• Which problem can be effectively solved using backtracking?
• For what purpose is Big O notation used?
• Which of the following best describes a binary tree?
• How many bits is the key size for Kasumi (A5/3)?
• When traversing a graph using BFS, what is the systematic approach taken?
• What is the typical round count for the lightweight symmetric block cipher Present?
• Which cipher uses 32 rounds in its encryption process?
• What is the output hash value size of MD6 at its minimum?
• How can one identify a palindromic string?
• What does it mean for a system to be Turing complete?
• What is the block size used by the XTEA encryption algorithm?
• Which algorithm is known for combining both actual cost and estimated cost in its process?
• What does NP-completeness signify in decision problems?
• What is the key feature of the bubble sort algorithm?
• How does a stack differ from a queue?
• What defines a binary tree?
• Which hash function has an output size of 160 bits?
• Which feature of stream ciphers typically allows for faster processing of data?
• Why is the concept of recursion significant in algorithms?
• In graph theory, what does a vertex represent?
• What is the block size, key size, and number of rounds used by the symmetric block cipher 3DES?
• What characterizes merge sort?
• What does dynamic programming primarily utilize to solve problems?
• What distinguishes a heuristic algorithm from a brute force algorithm?
• What is the block size for the Blowfish encryption algorithm?
• How does a merge sort algorithm primarily function?
• What is a simple path in a graph?
• How many rounds are utilized by the RC6 encryption algorithm?
• What is the block size for the RC2 cipher?
• What is a fundamental aspect of designing algorithms?
• What is a linked list?
• Which of the following is a typical application of dynamic programming?
• What does the term “cut” refer to in graph algorithms?
• Which block cipher uses a block size of 64 bits?
• How many rounds does the AES encryption algorithm perform?
• What does it mean if an algorithm has linear time complexity?
• How does a state space representation function in algorithms?
• What is the principle behind Quick Sort?
• RC2 uses how many rounds during encryption?
• How does binary counting work in algorithms?
• Which symmetric block cipher requires a key size of 128, 192, or 256 bits?
• What is the block size, key size, and number of rounds used with the IDEA encryption algorithm?
• What does NP-complete refer to?
• Which problem is commonly solved using a greedy algorithm?
• What is the significance of the key size in symmetric ciphers?
• What is the main function of a stack?
• What is the purpose of an adjacency matrix?
• What are the primary advantages of using a hash table?
• What is the block size used with the Skipjack cipher?
• What is the main objective of Dijkstra's algorithm?
• Which of the following key sizes does Present use?
• What is the block size used by the symmetric block cipher Camellia?
• How does a recursive algorithm operate?
• What is the key size range for the symmetric stream cipher RC4?
• What is the key size in bits for the Skipjack cipher?
• Which technique can be used to find the longest common subsequence?
• Which of the following is NOT one of the four stages of algorithm development?
• Which best describes the A* search algorithm?
• What is one of the main applications for stream ciphers like Mickey v2?
• How many bits is the key size for the Misty1 block cipher?
• Which algorithm explores a branch as far as possible before backtracking?
• What is an algorithm?
• What distinguishes a greedy algorithm from other algorithms?
• In the context of algorithms, what is memoization?
• How does a dynamic array differ from a static array?
• How many rounds does Camellia use if configured for maximum security?