Praxis Computer Sciences 5652

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

1/100

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 5:08 PM on 4/6/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

101 Terms

1
New cards

digital divide

the gulf between those who have ready access to computers and the Internet, and those who do not.

<p>the gulf between those who have ready access to computers and the Internet, and those who do not.</p>
2
New cards

Solutions to digital divide

*Increase affordability

Empowering usersImprove the relevance of online content Internet infrastructure *developmentAddress gender gap in internet access

3
New cards

Creative Commons

A kind of copyright that makes it easier for people to copy, share, and build on your creative work, as long as they give you credit for it.

<p>A kind of copyright that makes it easier for people to copy, share, and build on your creative work, as long as they give you credit for it.</p>
4
New cards

Open Source

Software that is created for free use by everyone

<p>Software that is created for free use by everyone</p>
5
New cards

Copyright

the exclusive legal right, given to an originator or an assignee to print, publish, perform, film, or record literary, artistic, or musical material, and to authorize others to do the same.

<p>the exclusive legal right, given to an originator or an assignee to print, publish, perform, film, or record literary, artistic, or musical material, and to authorize others to do the same.</p>
6
New cards

Abstraction

Reducing information and detail to focus on essential characteristics.

<p>Reducing information and detail to focus on essential characteristics.</p>
7
New cards

Control abstraction

Don't care "How" it gets done

8
New cards

Data Abstraction

Representing or storing information with methods that separate layers of concerns so that the programmer can work with information while ignoring lower-level details about how the information is represented.

9
New cards

Abstraction allows....

you to modify "parts" of a program without messing up the larger program

10
New cards

Abstraction Hierarchy

Most general concepts on top of the hierarchy and specific concepts on the bottom

11
New cards

pattern recognition

looking for similarities among and within problems

12
New cards

Problem Decomposition

The process of breaking a complex problem or system into parts that are easier to conceive, understand, program, and maintain.

13
New cards

Binary

The binary number system is base 2, using only bits 0 and 1.

14
New cards

Hexadecimal

A base-16 number system that uses sixteen distinct symbols 0-9 and A-F to represent numbers from 0 to 15.

15
New cards

natural language

Person to Person

16
New cards

Oval (Flowchart)

start/end

17
New cards

Rectangle (flowchart)

Action or process

18
New cards

Dimond (Flowchart)

A choice

19
New cards

Arrow (flowchart)

Direction of a choice

20
New cards

Rhombus (flowchart)

Input / Output

21
New cards

Pseudocode

Shorthand notation for programming

22
New cards

Algorithm Analysis

A general process that determines the amount of resources (such as time and storage) necessary to execute any particular algorithm, most commonly using Big O notation, such as O(N) or O(N^2)

23
New cards

Linear Search

Each item in the list is checked in order.

24
New cards

Binary Search

An ordered list is divided in 2 with each comparison.

25
New cards

Bubble Sort

Moving through a list repeatedly, swapping elements that are in the wrong order.

26
New cards

Merge Sort

A list is split into individual lists, these are then combined (2 lists at a time).

27
New cards

recursive algorithm

solves a problem by breaking that problem into smaller subproblems, solving these subproblems, and combining the solutions.

28
New cards

Randomization

a process of randomly assigning subjects to different treatment groups

29
New cards

Heuristic solution

*A problem-solving technique which sacrifices accuracy to increase speed

*Rules of Thumb

30
New cards

Linear Algorithm

Sequential search, searches by checking each element in a set.

31
New cards

Quadratic

degree of 2

32
New cards

exponential function

Constant ratio increase

33
New cards

logarithmic function

What exponent is needed to get a number

34
New cards

control structure

*An instruction that determines the order in which other instructions in a program are executed

*If and Loops

35
New cards

Standard Operators

==, ||, &&

36
New cards

correctness (of a program)

depends on correctness of program components, including code segments and procedures

37
New cards

Extensibility

allows for future growth in a program

38
New cards

modifiability

software is able to be modified

39
New cards

Reusability software

The use of existing assets such as software, knowledge, code into new software

40
New cards

syntax error

a character or string incorrectly placed in a command or instruction that causes a failure in execution.

41
New cards

runtime error

becomes apparent when the program is executed

42
New cards

compile-time error

An error in the source code that makes it impossible to compile. Also called a "syntax error".

43
New cards

overflow error

A calculation produces a result that is greater than the computer can deal with or store with the available number of bits

44
New cards

round-off error

the error produced when a decimal result is rounded in order to provide a meaningful answer.

45
New cards

logic error

An error in a program that makes it do something other than what the programmer intended.

46
New cards

sequence

the order in which things happen or should happen

47
New cards

selection

A generic term for a type of programming statement (usually an if-statement) that uses a Boolean condition to determine, or select, whether or not to run a certain block of statements.

48
New cards

Iteration Control Structure

*Represents the computer's ability to repeat a series of instructions

*Loops

49
New cards

Assignment Operator

the "=" sign in an assignment statement

50
New cards

Arithmetic Operators

perform mathematical calculations

51
New cards

Relational Operators

Used to compare two values. Operators include =,<,>,<=,>=,<>

52
New cards

logical operators

&& [and]

|| [or]

! [not]

53
New cards

floating point

A type that represents numbers with fractional parts.

54
New cards

Global scope variables

*when variables are declared outside of a function

* variables declared globally can even be called

from other files

*can have unintended side effects

55
New cards

Local scope variable

only used for the block of code they are declared in.

56
New cards

Event-driven programming

the program is activated by events such as button clicks.

57
New cards

Dictionary and maps

stores data in an array

58
New cards

Stack

First In Last Out data storage

59
New cards

Push

Add item to top of stack

<p>Add item to top of stack</p>
60
New cards

Pop

To remove an item from the top of a stack.

61
New cards

queue

Data stored in a "line"

"First in, First Out"

62
New cards

Enqueue

To add an item to the rear of a queue.

63
New cards

Dequeue

To remove an item from the front of a queue.

64
New cards

Characteristics of well-documented computer programs

*Usable

*Readable

*Modular

65
New cards

code review

a peer review process in which programmers check over one another's work to ensure its quality

66
New cards

end user

A representative consumer for whom a hardware or software product is designed.

67
New cards

apis

Application Programming Interface, how you define libraries and call them

68
New cards

Data Validation

the process of verifying that a program's input data is within the expected range

69
New cards

Data verification

validates that data is correct and accurate

70
New cards

Components of IDEs

*Text Editor

*Debugger

*Compliler

*Code Completion

*Language Support

*Plug-ins

71
New cards

Low level programming language

A programming language that provides little or no abstraction from a computer's instruction set architecture—commands or functions in the language map closely to processor instructions. Generally this refers to either machine code or assembly language.

72
New cards

High level programming language

A programming language that hides the details of how the computer hardware solves a problem and is therefore easier for a programmer to use.

73
New cards

Procedural Programming

method of programming that uses step-by-step instructions

74
New cards

object-oriented programming

designing a program by discovering objects, their properties, and their relationships

75
New cards

Programming Paradigm

A way of approaching problems; object-oriented, functional, and imperative paradigms are three major paradigms.

76
New cards

Functional Programming

A programming paradigm that uses functions to create programs.

77
New cards

Imperative Programming

where a developer writes code that describes in exacting detail the steps that the computer must take to accomplish the goal

78
New cards

class diagram

Rectangle with name at top, variables in the middle , and methods in the bottom

79
New cards

Inheritance

when subclass get the variables and methods of a super class

80
New cards

overloading a method

giving two methods the same name but different method signatures

81
New cards

overriding a method

redefining a method in a subclass

82
New cards

compilation

turning programming language into machine language

83
New cards

interpretation

the result of a program

84
New cards

source code

A program in a high-level language before being compiled.

85
New cards

object code

The output of the compiler after it translates the program.

86
New cards

8 ______ make up 1 _______

bits, byte

87
New cards

How to remember the smallest bits to largest bits

Kilo

Mega

Giga

Tera

88
New cards

Lossy data compression

data compression technique where the number of bits needed to store or transmit information is reduced, but the original data cannot be reconstructed

89
New cards

Lossless data compression

reduces the file size without any loss of data quality

90
New cards

Encoding

the processing of information so that it can be stored.

91
New cards

Encryption

a process of encoding messages to keep them secret, so only "authorized" parties can read it.

*Need a Key

92
New cards

simulation models

computerized models that can be tested under different scenarios to identify acceptable solutions to problems

93
New cards

modeling

building a model

94
New cards

trace code

Writing down the values of the variables and how they change each time the body of the loop executes.

95
New cards

redundancy

Ability to provide continued service, no matter what happens

96
New cards

Backups

copies of files that you can use to replace the originals if they're lost or damaged

97
New cards

Data Collection

The process of acquiring existing information or developing new information.

98
New cards

aggregation

information is gathered and expressed in a summary form, for purposes such as statistical analysis.

99
New cards

data generation

Development of data, frequently qualitative rather than numerical, by the data collector.

100
New cards

Data generated by sensors

input by physical environment

Explore top flashcards

flashcards
Unit 5 #53-103
53
Updated 341d ago
0.0(0)
flashcards
Q3 SOC SCI QE chapter 12
38
Updated 1118d ago
0.0(0)
flashcards
Personal Finance Midterm Vocab
22
Updated 1174d ago
0.0(0)
flashcards
Chapter 3 Key Concepts
31
Updated 188d ago
0.0(0)
flashcards
Unit 5 #53-103
53
Updated 341d ago
0.0(0)
flashcards
Q3 SOC SCI QE chapter 12
38
Updated 1118d ago
0.0(0)
flashcards
Personal Finance Midterm Vocab
22
Updated 1174d ago
0.0(0)
flashcards
Chapter 3 Key Concepts
31
Updated 188d ago
0.0(0)