Computer Science Programming Concepts and Data Structures

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/26

flashcard set

Earn XP

Description and Tags

Vocabulary practice flashcards defining core programming concepts, function terminology, variable scopes, containers, and foundational searching and sorting algorithms.

27 Terms

1
New cards

Call

The action of triggering the operation of a designated function or named sequence of instructions during execution.

2
New cards

Void

A return type specifier indicating that a function performs its task without producing or returning a value to the invocation site.

3
New cards

Function

A self-contained, named block of statements designed to perform a specific task plus optionally return a value.

4
New cards

Code Reuse

The practice of leveraging existing software components or functions across multiple parts of a program to reduce duplication.

5
New cards

Stub

A dummy routine with minimal logic acting as a temporary placeholder during software construction so higher-level logic can be tested.

6
New cards

Driver

A testing routine specifically written to invoke plus evaluate a component or module by passing test inputs plus verifying outputs.

7
New cards

Function Header

The opening declaration line of a function specifying its return type, identifier name, plus formal input specifications.

8
New cards

Header

The part of a function containing the return type, name of the function, and any parameters required.

9
New cards

Signature

The unique combination of a function's identifier alongside the ordered sequence plus data types of its input parameters.

10
New cards

Divide and Conquer

An algorithmic paradigm that partitions a complex problem into smaller sub-problems, solves them independently, then combines their results.

11
New cards

Arguments

The actual values or expressions passed into a routine at the moment it is executed.

12
New cards

Parameters

Formal placeholder identifiers defined within a function's declaration that receive incoming values when invoked.

13
New cards

Reference

An alias for an existing entity that grants direct access to modify the original memory slot.

14
New cards

Local Variables

Named memory slots declared inside a specific block or function, accessible only within that enclosed scope.

15
New cards

Static Variables

Named memory slots inside a function whose stored values persist throughout the entire execution lifetime of the program.

16
New cards

Global Variables

Named memory slots declared outside of all functions, accessible plus mutable from any part of the program.

17
New cards

Rows and Columns

The horizontal alignments plus vertical groupings structuring elements within a two-dimensional grid or matrix.

18
New cards

Range-based For-Loop

A repetition structure that automatically traverses every element of a container sequentially without requiring manual index manipulation.

19
New cards

Initialization List

A comma-separated series of values enclosed in braces used to assign starting values to a container or object upon creation.

20
New cards

Off-by-One Error

A logic defect in repetitive code where an operation executes a single iteration too many or too few times, often due to incorrect boundary comparison operators.

21
New cards

Standard Template Library

A built-in C++ collection of generic data structures, algorithms, plus iterators designed to simplify common programming tasks.

22
New cards

Array

A contiguous fixed-size memory sequence storing multiple elements of the same data type accessible by numerical indices.

23
New cards

Vector

A dynamic sequence container capable of automatically adjusting its capacity when elements are added or removed.

24
New cards

Linear Search

A retrieval algorithm that sequentially inspects each element in a collection from beginning to end until a target item is located.

25
New cards

Binary Search

A fast lookup technique for ordered collections that repeatedly bisects the dataset by comparing the target with the middle element.

26
New cards

Bubble Sort

A basic ordering technique that repeatedly steps through a collection, comparing adjacent items plus swapping them if out of sequence.

27
New cards

Selection Sort

A basic ordering technique that repeatedly finds the smallest (or largest) element from an unarranged portion, placing it into its final position.