Introduction to Computer Science & Programming Concepts

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

1/45

flashcard set

Earn XP

Description and Tags

Comprehensive vocabulary flashcards covering fundamental programming concepts, control structures, roles, operators, functions, data structures, and algorithms from the lecture notes.

46 Terms

1
New cards

For Loop

A control structure that lets us repeat code a fixed number of times.

2
New cards

While Loop

A control structure that lets us repeat code as long as a condition is true.

3
New cards

Condition

Code put inside an if statement or while loop that returns true or false, allowing you to "ask a question" to your code.

4
New cards

Pseudocode

A brief explanation of code written in plain English.

5
New cards

Define a Function

To write a function with all of the code inside it.

6
New cards

Call a Function

To give the command so the computer will run the code for that function.

7
New cards

Comment

A message in code that explains what is going on; it is ignored by the computer.

8
New cards

Top Down Design

The act of breaking down a large problem into smaller, easier problems to solve.

9
New cards

If Else Statement

A control structure that runs either one section of code or another depending on a test, where only one section will run based on whether the condition is true or false.

10
New cards

Debugging

The process of fixing a problem in your code.

11
New cards

Indentation

The visual structure of code layout that uses whitespace, such as spaces or tabs, to organize code into a hierarchy.

12
New cards

Pair Programming

A collaborative programming practice where two programmers work together at one computer on the same piece of code.

13
New cards

Driver

The role in pair programming responsible for controlling the mouse and keyboard, typing out the code, and solving the current task while keeping the navigator's plan-of-action in mind.

14
New cards

Navigator

The role in pair programming responsible for reading the problem, narrating the plan-of-action, checking for typos or errors as code is produced, and thinking of alternative, more efficient solutions.

15
New cards

Event

An action (such as clicking the mouse or pressing a key on the keyboard) that a program detects and uses as input.

16
New cards

Variable

A place in a program where data is stored.

17
New cards

Computer

A person or device that makes calculations, stores data, and executes instructions according to a program.

18
New cards

Callback Function

A function passed as a parameter to another function in order to be called later.

19
New cards

input()

A function that prints a prompt and retrieves text entered by the user.

20
New cards

Function

A command that you get to invent and name that allows a program to be broken into smaller parts, making it easier to understand.

21
New cards

Print

Displaying text on the screen.

22
New cards

Computer Science

The study of computational thinking, which is the thinking humans need in order to describe a step-by-step process to a computer.

23
New cards

Input Output (I/O)

A general programming term referring to the flow of information into and out of a program.

24
New cards

Snake Case

A naming convention in computing where spaces are replaced by underscore characters and the first letter of each word is lowercase.

25
New cards

Type Conversion

The process of converting the value of one data type (such as integer, string, or float) to another data type.

26
New cards

Arithmetic Operators

Operators used to perform basic mathematical tasks, including addition (++, subtraction (−-, multiplication (∗*), division (//), and modulus (%\%).

27
New cards

Comparison Operators

Operators used to make comparisons between values, including equal to (====), not equal to (!=!=), less than (<<), less than or equal to (<=<=, greater than or equal to (>=>=, and greater than (>>).

28
New cards

Pseudorandom

Computed values that are not actually random because pure randomness is impossible, but appear random and are random enough for most purposes.

29
New cards

Boolean

A variable that can have one of two values: True or False.

30
New cards

Break

A statement used in for loops and while loops that exits the current loop and resumes execution at the next statement.

31
New cards

Continue

A statement used in while and for loops that rejects all remaining statements in the current iteration and moves control back to the top of the loop for the next iteration.

32
New cards

Logical Operators

Operators used to make logical associations between boolean values.

33
New cards

Scope

The part of the program in which a variable exists, such as globally throughout the program or locally within a specific function.

34
New cards

Local Variable

A variable that is restricted to use within a certain scope of a program.

35
New cards

Return

A statement that exits a function, optionally passing back an expression to the caller; returns None if called with no arguments.

36
New cards

Exceptions

Runtime errors in a program that stop program execution by default.

37
New cards

Try and Except

Programming constructs used to gracefully handle exceptions so that a program can continue execution in spite of them.

38
New cards

Parameters

Pieces of information declared in a function definition; variables in the declaration of a function.

39
New cards

Arguments

The actual values or data passed into a function's parameters when the function is called.

40
New cards

Application Programming Interfaces (APIs)

Specifications and libraries that simplify complex programming tasks by providing sets of clearly defined methods of communication among various computing components.

41
New cards

Data Abstraction

Grouping related data under one name so a program can use the data without depending on its specific details, such as how many items there are.

42
New cards

Managing Complexity

Making a program easier to write, read, and change, such as by replacing many separate variables with a single list.

43
New cards

Efficiency

An estimate of the computational resources an algorithm uses, usually expressed in terms of the size of the input.

44
New cards

Heuristic

An approach that produces a solution that is not guaranteed to be optimal, used when finding an optimal solution is impractical.

45
New cards

Linear Search

A search algorithm that checks each element in order until it finds the target or reaches the end of the list.

46
New cards

Binary Search

A search algorithm performed on a sorted list that checks the middle element and eliminates half of the remaining elements with each comparison.