History and Introduction Pt. 1

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

1/28

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 4:52 AM on 3/13/25
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

29 Terms

1
New cards

programming language

a notation for communicating to a computer what we want

it to do

2
New cards

computer operators

Before the middle of the 1940s, they “hardwired” their programs. They set switches to adjust the internal wiring of a computer to perform the requested

tasks.

3
New cards

John von Neumann

had the idea that a computer should be

permanently hardwired with a small set of general-purpose

operations

4
New cards

opcode

The first four bits of the line of code indicates the operation to be

performed called

5
New cards

data value integers

The last three lines of codes represents what

6
New cards

program instructions

The first five lines of code represent

7
New cards

instruction’s operands

The remaining 12 bits contain codes for what

8
New cards

assembly language

a type of language that relies on software tools to

automate some of the tasks of the programmers.

9
New cards

assembler

translates the symbolic assembly language code to binary

machine code.

10
New cards

loader

automatically loads the machine code for this instruction into computer

memory.

11
New cards

FORTRAN

one of the precursor of high-level

programming languages. Developed in early 1950s by

John Backus.

12
New cards

ALGOL

provided first of all a standard notation. The language

included notations for structured control statements for sequencing (

begin-end blocks), loops (the for loop), and selection (the if and if-

else statements).

13
New cards

data abstraction

simplify for human users the

behavior and attributes of data, such as numbers, character strings, and search

trees.

14
New cards

control abstraction

simplify properties of the transfer of control, that is, the

modification of the execution path of a program based on the situation at hand.

Examples of control abstractions are loops, conditional statements, and procedure

calls.

15
New cards

basic abstraction

collect the most localized machine information.

16
New cards

structured abstraction

collect intermediate information about the structure of a program.

17
New cards

unit abstraction

collect large-scale information in a program.

18
New cards

data structure

is the principal method for collecting related data values

into a single unit.

19
New cards

array

A typical data structure provided by programming languages is the _ _ _ _ _

20
New cards

syntactic sugar

is used to refer to any mechanism that allows the programmer to

replace a complex notation with a simpler, shorthand notation.

21
New cards

iterator

Another structured form of iteration is provided by an _ _ _ _ _

22
New cards

procedure

sometimes also called a subprogram or subroutine.

23
New cards

procedure declaration and procedure invocation

Procedural abstraction involves two things:

24
New cards

function

An abstraction mechanism closely related to procedures is the _ _ _ _ _

25
New cards

unit

Control can also be abstracted to include a collection of procedures that provide

logically related services to other parts of a program and that form a _ _ _ _

26
New cards

imperative language

its primary feature is a sequence of

statements that represent commands

27
New cards

functional paradigm

based on the abstract notion of a function as studied in the

lambda calculus.

28
New cards

logic paradigm

based on symbolic logic.

29
New cards

object-oriented languages

languages allow programmers to write reusable code that

operates in a way that mimics the behavior of objects in the real world