Unit 10: Recursion

Question 1

ArrayList

Answer 1

A dynamic data structure that allows you to store and manipulate collections of objects. Unlike arrays, ArrayLists can grow or shrink dynamically as needed.

Question 2

Call Stack

Answer 2

A data structure that keeps track of function calls in a program. It stores information about the order and location of function calls, allowing the program to keep track of where to return after each function call is completed.

Question 3

Iterative Code

Answer 3

Refers to programming constructs or algorithms that involve repetition using loops. It allows for executing a block of code multiple times until certain conditions are met.

Question 4

Recursion

Answer 4

A programming technique where a function calls itself to solve a problem by breaking it down into smaller, similar subproblems.

Question 5

Traversal

Answer 5

Refers to the process of visiting and accessing each element in a data structure, such as an array or a tree, in a specific order.

Question 6

Arrays.copyOfRange

Answer 6

A method in Java that creates and returns a new array containing elements from another array within specified range indexes (start index inclusive and end index exclusive).

Question 7

Binary Search

Answer 7

An efficient algorithm used to locate a target value within a sorted array by repeatedly dividing the search interval in half.

Question 8

Conquer Step

Answer 8

The part of an algorithm where the solutions to smaller subproblems are combined or merged together to solve the original problem.

Question 9

Divide Step

Answer 9

A strategy used in problem-solving algorithms where a complex problem is divided into smaller, more manageable subproblems.

Question 10

Factorial

Answer 10

Refers to the product of an integer and all the positive integers below it. For example, the factorial of 5 (written as 5!) is equal to 5 x 4 x 3 x 2 x 1.

Question 11

Merge Sort

Answer 11

An efficient, comparison-based sorting algorithm that divides an unsorted list into smaller sublists, sorts those sublists recursively, and then merges them back together to obtain a sorted list.

Question 12

Sequential Search

Answer 12

Another term for linear search, where each element in a list is checked one by one until the target value is found or the end of the list is reached.

Question 13

traverseArray

Answer 13

Accessing each element of the array one by one, usually in a sequential manner.

Question 14

Recursive Call

Answer 14

When a function calls itself within its own code, allowing for repetitive execution of the same set of instructions.

Question 15

Abstraction/Method Writing

Answer 15

The process of simplifying complex systems by breaking them down into smaller, more manageable parts. Method writing refers to defining behaviors or actions that an object can perform.

Question 16

Algorithm Analysis

Answer 16

The process of evaluating the efficiency and performance of an algorithm. It involves analyzing factors such as time complexity, space complexity, and scalability to determine how well an algorithm will perform in different scenarios.

Question 17

Algorithms

Answer 17

Step-by-step procedures or instructions for solving problems or performing tasks. They provide clear instructions on how to solve problems efficiently.

Question 18

Artificial Intelligence and Machine Learning

Answer 18

Refers to the development of computer systems capable of performing tasks that typically require human intelligence, such as speech recognition or decision-making and a subset of AI, that involves training algorithms on large datasets to make predictions or take actions without being explicitly programmed.

Question 19

Control Structures

Answer 19

Programming constructs that determine the flow of execution in a program. They allow you to make decisions and repeat actions based on certain conditions.

Question 20

Data Structure

Answer 20

A way of organizing and storing data in a computer so that it can be accessed and used efficiently. It provides a systematic way to manage and manipulate data.

Question 21

Data Structures

Answer 21

Ways to organize, store, and manipulate data efficiently. They provide different methods of accessing, inserting, deleting, or searching for data elements based on specific requirements.

Question 22

Discrete Math

Answer 22

A branch of mathematics that deals with countable and distinct objects. It focuses on topics like sets, logic, relations, functions, and combinatorics.

Question 23

Encapsulation/Class Writing

Answer 23

The practice of hiding internal details and providing a public interface for interacting with an object. Class writing involves defining the blueprint or template for creating objects in object-oriented programming.

Question 24

Graphics

Answer 24

Involves creating visual representations using computers. It encompasses various techniques such as rendering 2D or 3D images, manipulating pixels, applying transformations, and simulating realistic effects like lighting and shadows.

Question 25

Graphs

Answer 25

Data structures that consist of nodes (vertices) and edges, where the edges represent relationships between the nodes. They are used to model connections or relationships between different entities.

Question 26

GUIs (Graphical User Interfaces)

Answer 26

GUIs are visual interfaces that allow users to interact with software applications using graphical elements such as buttons, menus, and windows. They provide an intuitive way for users to navigate through an application without needing extensive knowledge of programming languages.

Question 27

Hash maps

Answer 27

Data structures that store key-value pairs, where each key is unique. They use a hash function to convert the key into an index in an array, allowing for efficient retrieval and insertion of values.

Question 28

Inheritance

Answer 28

A concept in object-oriented programming where a class inherits the properties and behaviors of another class. It allows for code reuse and promotes the creation of hierarchical relationships between classes.

Question 29

Linear Search

Answer 29

A simple searching algorithm that sequentially checks each element in a list until it finds the target value or reaches the end of the list.

Question 30

Logic and Proofs

Answer 30

Involves the study of formal reasoning, including deductive reasoning, symbolic logic, truth tables, and proof techniques such as direct proof, contrapositive proof, and proof by contradiction.

Question 31

Memory Analysis

Answer 31

Refers to the process of examining and understanding the contents of a computer’s memory. It involves analyzing data structures, variables, and other information stored in memory to gain insights into how a program is functioning or to identify potential security vulnerabilities.

Question 32

Memory Usage

Answer 32

Refers to the amount of computer memory (RAM) that a program or process requires to run. It is a measure of how much space is occupied by data and instructions in the computer’s memory.

Question 33

Object-oriented programming (OOP)

Answer 33

A programming paradigm that organizes code into objects, which are instances of classes. It emphasizes the use of objects to represent real-world entities and their interactions.

Question 34

Polymorphism

Answer 34

Refers to the ability of objects to take on multiple forms or have multiple types. In programming, it allows different objects to be treated as instances of a common superclass, enabling flexibility and extensibility.

Question 35

Probability

Answer 35

The branch of mathematics that studies uncertainty or randomness. It involves calculating the likelihood or chance that an event will occur based on mathematical models.

Question 36

Programming Language Construction

Answer 36

Involves designing and implementing programming languages. It includes creating syntax rules, defining data types, and developing compilers or interpreters that translate code written in a specific language into machine-readable instructions.

Question 37

Runtime Analysis

Answer 37

Refers to analyzing the efficiency of an algorithm by measuring its execution time and memory usage. It helps determine how well an algorithm scales with input size.

Question 38

Searching Algorithms

Answer 38

Methods used to find specific elements or values within a collection of data.

Question 39

Selection Sort

Answer 39

A simple sorting algorithm that repeatedly finds the minimum element from an unsorted portion of the list and swaps it with the first element of that portion until the entire list is sorted.

Question 40

Sets

Answer 40

Collections of unique elements with no specific order. They do not allow duplicate values and provide operations like union, intersection, and difference.

Question 41

Sorting Algorithms

Answer 41

Techniques used to arrange elements in a specific order (e.g., ascending or descending) within a collection of data.

Question 42

State Machines

Answer 42

Computational models that consist of a set of states and transitions between those states. They are used to represent systems that change from one state to another based on inputs or events.

Question 43

Trees

Answer 43

Hierarchical data structures consisting of nodes connected by edges. Each node has zero or more child nodes, except for the root node which has no parent. Trees are commonly used for organizing data in a hierarchical manner.

Question 44

Web Development

Answer 44

Refers to the process of creating and maintaining websites. It involves designing, coding, and implementing various elements such as web pages, user interfaces, and databases.