AdvancedProgramming_intro

What is Big O?

• A term used to describe the size of a data structure.
• A programming language.
• A measure of how fast a computer can perform calculations.
• A notation used to describe the performance or complexity of an algorithm.

Which of these algorithms has linear time complexity? (O(n))

• Linear search algorithm
• Depth-first search algorithm
• Bubble sort algorithm
• Binary search algorithm

FIFO. Which data structure typically operates like this?

• Stack
• Binary Tree
• Linked List
• Queue

What's a definition of 'recursion'?

• Recursion is a programming concept where a function calls another function to solve a problem.
• Recursion is a programming concept where a function solves a problem by using a loop.
• Recursion is a programming concept where a function solves a problem by using conditional statements.
• Recursion is a programming concept where a function calls itself to solve a problem by breaking it down into smaller subproblems.

What is the time complexity of a binary search?

• O(n^2)
• O(log n)
• O(1)
• O(n)

LIFO. Which data structure typically operates like this?

• Stack
• Linked List
• Heap
• Queue

What is the definition of a linked list?

• A linked list is a type of array.
• A linked list is a sorting algorithm.
• A linked list is a data structure that consists of a sequence of nodes.
• A linked list is a data structure that stores data in a tree-like structure.

What is a design pattern?

• A design pattern is a reusable solution to a commonly occurring problem in software design.
• A design pattern is a type of fabric used in clothing design.
• A design pattern is a random arrangement of colors and shapes.
• A design pattern is a specific algorithm or code snippet.

What is the time complexity to access a specific index in an array?

• O(n)
• O(log n)
• O(n^2)
• O(1)

Why do we usually measure time complexity as the number of steps, rather than the amount of time something takes?

• To have a consistent and objective measure of the efficiency of an algorithm.
• To make it easier to compare different algorithms.
• To ensure that the measure is independent of the specific implementation details.
• To avoid the influence of external factors like hardware and software.