













Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
D278 SCRIPTING AND PROGRAMMING FOUNDATIONS CERTIFICATION EVALUATION TEST 2026 QUESTIONS AND ANSWERS GUARANTEED TO PASS
Typology: Exams
1 / 21
This page cannot be seen from the preview
Don't miss anything!














โ Computational thinking. Answer: Creating a sequence of instructions to solve a problem (aka algorithm) โ Algorithm. Answer: A sequence of instructions that solves a problem โ Flowchart. Answer: A graphical language for creating or viewing computer programs โ Coral Code Language. Answer: A language intended for learning to program Two versions: flowchart and code Looks like pseudocode, but follows rules that allow execution โ Program. Answer: A list of statements Each statement is carrying out some action and executing one at a time
โ String literal. Answer: consists of text (characters) within double quotes Ex: "Go #57!". โ Cursor. Answer: Indicates where the next output item will be placed in the next output The system automatically moves the cursor after the previous output item โ Newline. Answer: \n Special sequence who appearance in an output string literal causes the cursor to move to the next output line Exists visibly in the output โ Comment. Answer: // this is an example of a comment Text a programmer adds to a program to be read by humans but ignored by a program when executing Use // before the comment
โ Assignment statement. Answer: Assigns a variable with a value; and keeps that value during subsequent statement until X is assigned again. Assignment's left side must be a variable (ex. x=5) โ Variable declaration. Answer: Declares a new variable, specifying the variables name and type โ Integer variable type. Answer: Can hold whole number values โ Expression. Answer: A combination of items like variables, literals, operators, and parentheses that evaluate to a value Ex.) y=2*(x+1) โ Identifier. Answer: A name created by a programmer for an item like a variable or function Must be a sequence of letters, underscores, and digits Must start with a letter Case sensitive
โ Reserve word. Answer: A word that is part of the language like: Integer, Get, or Put Cannot use as an identifier โ Naming conventions. Answer: A set of style guidelines defined by a company, team, teacher, etc. for naming variables โ What are two common conventions for distinguishing words?. Answer: Camel case (dogNumber) Underscore (dog_number) โ Literal. Answer: a specific value in code like 2 โ Operator. Answer: A symbol that performs built in calculations ( + , - , * , /) โ Unary minus. Answer: Minus ( - ) used as a negative โ Incremental development. Answer: The process of writing, compiling, and testing a small amount of code, then writing compiling and testing a small amount more, and so on.
โ Type conversion. Answer: A conversion of one data type to another, such as integer or float โ Implicit conversion. Answer: Automatic conversion of one data type to another โ Type cast. Answer: Converts a value of one type to another type โ Modulo Operator (%). Answer: Evaluates to the remainder of the division of two integer operands Ex.) 21 / 4 = 1 โ Constant. Answer: A named value item that holds a value that cannot change; commonly used in programs to hold the value of mathematical or physical constants such has Pi, speed of light, etc. โ Branch. Answer: Sequence of statements only executed under a certain condition โ Decision. Answer: Creates two branches: if the decision is true the first branch executes; else the second brand executes Afterward the branches rejoin
Called if-else branches โ Nested branches. Answer: A branch containing if-else branch โ Multiple branches. Answer: Each decision is independent, this more than one branch can execute โ Equality operator. Answer: Checks whether two operands' values are the same (==) or different (!=) โ Boolean. Answer: A type that has just two values : true or false โ Relational operator. Answer: Checks how one operand's value relates to another (> , <, =, >=, <=) โ Logical operator. Answer: treats operands as being true or false, and evaluates to true or false; includes: and, or, not Commonly used to detect if a value is within a range Ex.) x = 4 (x>1) and (x<9) true
Loop variable updated at the end of the loop body โ While loop. Answer: A loop that repeatedly executes the loop body while the loop's expression evaluates to true Generally used when a number of iterations is not known โ For loop. Answer: A loop consisting of a loop variable initialization, a loop expression, and a loop variable update that typically describes iterating for a specific number of times. Generally used when a number of iterations is known. โ Nested loop. Answer: A loop that appears in the body of another loop (commonly referred to as inner and outer loop) โ Do-while loop. Answer: Loop that first executes the loop body's statements, then checks the loop condition. Useful when the loop should iterate at least once
โ Array. Answer: A special variable having one name, but storing a list of data items with each item being directly accessible (also called a Vector) Must be an integer type, cannot be floating-point โ Element. Answer: Each item in an array โ Index. Answer: Each elements location number within an array (the number in backets) โ Swapping. Answer: Means to assign two variables with each others value (ex. x=3 y=7 swap x=7 y=3) A common method is to use a third variable ex. x=22 y= tempVal = x x=y y = tempVal x=99 y=
โ Computational problem. Answer: Specifies the input that can be answered using a computer and the desired output. โ Np- complete. Answer: A set of problems for which no efficient algorithm exists โ Algorithm efficiency. Answer: typically measured by the algorithm's computational complexity โ Computational complexity. Answer: The amount of resources used by the algorithm Most common resources considered are the runtime and memory usages โ Runtime complexity. Answer: A function, T(N), that represents the number of constant time operations performed by the algorithm on an input of size N. โ Algorithm best case. Answer: The scenario where the algorithm does the minimum possible number of operations โ Algorithm worst case. Answer: The scenario where the algorithm does the maximum possible number of operations
Input data size must remain a variable. โ Space complexity. Answer: a function, S(N), that represents the number of fixed-size memory units used by the algorithm for an input of size N. โ Auxillary Space Complexity. Answer: The space complexity not including the input data Ex.) S(N) = k โ Linear search. Answer: a search algorithm that starts from the beginning of a list, and checks each element until the search key is found or the end of the list is reached โ Runtime. Answer: the time the algorithm takes to execute โ Binary search. Answer: a search algorithm that starts at the middle of a sorted set of numbers and removes half of the data; this process repeats until the desired value is found or all elements have been eliminated.
โ Testing phase. Answer: Part of SDLC Checks that the program correctly meets the goals โ Waterfall approach. Answer: Carrying out the SDLC phases in sequence. โ Agile approach. Answer: Building program by doing small amounts of SDLC phases in sequences and then repeating Also called spiral approach โ Object. Answer: A grouping of data (variables) and operations that can be performed on that data (functions) โ Abstraction. Answer: To have a user interact with an item at a high-level, with lower-level internal details hidden from the user/ Also called information hiding or encapsulation โ Abstract data type (ADT). Answer: a data type whose creation and update are constrained to specific well-defined operations
A class can be used to implement an ADT โ Universal modeling language. Answer: A modeling language for software design that uses different types of diagrams to visualize the structure and behavior of programs Consists of several structural and behavioral diagrams โ Structural diagram. Answer: Visualizes static elements of software, such as types of variables and functions used in the program โ Behavioral diagram. Answer: visualizes dynamic behavior of software, such as the flow of an algorithm โ Activity diagram. Answer: A flow chart used to describe the flow of an activity or set of activities โ Use case diagram. Answer: Behavioral diagram used to visually model how a user interacts with a software program. Often used to specify behavioral requirements of programs
โ Interpreted language. Answer: A language that is run one statement at a time by another program called an interpreter. Ex.) Python, JavaScript, MATLAB (aka scripting languages Interpreted languages tend to be easier for new programmers โ Statically typed language. Answer: Means each variable's type must be declared and cannot change while the program runs Most compiled languages are this Ex.) C, C++, Java โ Dynamically types languages. Answer: Means a variable's type may change while a program executes, usually based on what is assigned to the variable Common with interpreted languages Ex.) python โ Object-oriented language. Answer: Supports decomposing a program into objects.
Ex.) C++, Java, Python and C# provide extensive object-oriented support โ Markup Language. Answer: allows a developer to describe a document's content, desired formatting, or other features. Ex.) HTML โ Library. Answer: A set of pre-written functions (and other items) that can carry out common tasks that a programmer can use to improve productivity A library's functions typically all relate to the same purpose A programmer may include several libraries in a single program โ Troubleshooting. Answer: A systematic process for finding and fixing a problem's cause in a system โ Hypothesis. Answer: States a possible cause of a problem (a true or false statement) โ Test. Answer: A procedure whose results validates or invalidates a hypothesis