Computational Thinking Challenge

What is an algorithm?

• A collection of data points without a process.

• An algorithm is a step-by-step procedure for solving a problem.

• A random guess about a problem.

• A recipe for cooking a dish.

Define pseudocode and its purpose.

• Pseudocode is a simplified, human-readable representation of an algorithm used for planning and designing code.

• Pseudocode is a graphical representation of algorithms using flowcharts.

• Pseudocode is a type of machine code that runs on computers.

• Pseudocode is a programming language used to write software directly.

Which of the following is a characteristic of a good algorithm?

• Complexity and speed

• Inflexibility and simplicity

• Ambiguity and redundancy

• Clarity and efficiency

What is the primary purpose of using pseudocode?

• To create a detailed programming code.

• To replace the need for actual coding.

• To serve as a final product for software development.

• To outline the logic of an algorithm in a human-readable format.

List three basic data structures.

• Stacks

• Arrays, Linked Lists, Hash Tables

• Trees

• Queues

What is the difference between an array and a linked list?

• An array is a collection of nodes, while a linked list is a single block of memory.

• A linked list allows fast access by index, while an array is slower for insertions.

• An array can grow dynamically while a linked list has a fixed size.

• An array has a fixed size and allows fast access by index, while a linked list is dynamic in size and allows efficient insertions/deletions but slower access.

Explain the concept of a stack in data structures.

• A stack is a linear data structure that follows the Last In First Out (LIFO) principle.

• A stack is a non-linear data structure that allows random access to elements.

• A stack is a type of queue that processes elements in any order.

• A stack is a data structure that follows the First In First Out (FIFO) principle.

What is a queue and how does it differ from a stack?

• A queue is a data structure that only allows insertion at the front.

• A queue allows random access, while a stack does not.

• A queue is a LIFO data structure, while a stack is a FIFO data structure.

• A queue is a FIFO data structure, while a stack is a LIFO data structure.

How do you analyze the efficiency of an algorithm?

• Measure the algorithm's popularity among users.

• Count the number of lines of code in the algorithm.

• Assess the algorithm's performance based on user feedback.

• Evaluate time and space complexity using Big O notation.

What is the Big O notation used for?

• To create user interfaces efficiently.

• To measure the speed of a computer.

• To determine the best programming language.

• To analyze the efficiency of algorithms.