D278 - Scripting and Programming Foundations

Question 1:

System architecture

Interactions between system components

Various actions a user might perform

Question 2:

Defining program goals

Writing program code

Specifying system details and architecture

Question 3:

A blueprint for creating an object

A function that performs operations

A variable type

Question 4:

A single variable

A group of related functions

An instance of a class

Question 5:

A complete function with logic

A function that has not yet been fully implemented

A function that runs with default values

Question 6:

The amount of space an algorithm takes

The number of calculations required to solve a problem

The total size of the data processed by an algorithm

Question 7:

A program loop

A flowchart symbol

A sequence of steps to solve a problem

Question 8:

Searching through a list from start to end

A linear search algorithm

Searching by repeatedly dividing the list into halves

Question 9:

The scenario where an algorithm performs the fewest operations

The scenario where an algorithm performs the maximum possible number of operations

The average number of operations the algorithm performs

Question 10:

A search algorithm that checks every element until the desired element is found

A binary search method

An algorithm for sorting numbers

Question 11:

A set of problems with known efficient algorithms

A problem for which no known efficient algorithm exists

A problem that is solved by linear search

Question 12:

The time it takes for a system to boot up

The function that represents the number of operations in relation to input size

The size of the data in memory

Question 13:

To perform all phases of SDLC at once

To repeat SDLC phases multiple times with improvements

To skip testing and go to production

Question 14:

The size of the code needed to implement an algorithm

The number of operations and space an algorithm needs

The number of inputs needed for a function

Question 15:

A method that finds an optimal solution quickly

An algorithm that tries to find a near-optimal solution in less time

A brute force approach to problem-solving

Question 16:

Describing the structure of a program

Visualizing the steps of an algorithm or process

Describing data types in a program

Question 17:

Writing a single module for the entire program

Dividing a program into smaller, manageable sections

Creating multiple copies of the same code

Question 18:

Having multiple functions with the same name but different parameters

Calling a function multiple times within a loop

Using too many functions in a program

Question 19:

A value that cannot change during program execution

A variable that can be reassigned

A dynamic value that is updated every loop iteration

Question 20:

The result returned by a function

The name of the function

The input to the function provided during its definition

D278 Scripting and Programming Foundations - Set 5 - Part 1