Download D278 WGU SCRIPTING AND PROGRAMMING FOUNDATIONS EXAMINATION TEST COMPLETE STUDY GUIDE WITH and more Exams Programming Paradigms in PDF only on Docsity!
D278 WGU SCRIPTING AND
PROGRAMMING FOUNDATIONS
EXAMINATION TEST COMPLETE STUDY
GUIDE WITH SOLVED Q AND A 2026
โ 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= โ Function definition Answer: Consists of the new function's name and a block of statements. The function's name can be any valid identifier โ Local variable Answer: AA variable declared in a function, which is then accessible only within that function โ Parameter Answer: A functions input specified in a function definition Ex. pizza area function might have diameter as a parameter โ Argument
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. โ Sorting
Defines specifics of how to build a program โ Implementation phase Answer: Part of SDLC Involves writing the program โ 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
โ Sequence diagram Answer: a behavioral diagram that shows interaction between software components and indicates the order of events. Commonly used to illustrate the sequence of events needed to handle a particular scenario in software โ Software Requirements Specification (SRS) Answer: a document describing all requirements for the software product โ Compiled language Answer: A program written in a compiled language is first converted by a tool (compiler) into machine code, which can run on a particular machine. Ex. C, C++, and Java. โ 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
