History and Introduction Pt. 1

studied byStudied by 0 people
0.0(0)
learn
LearnA personalized and smart learning plan
exam
Practice TestTake a test on your terms and definitions
spaced repetition
Spaced RepetitionScientifically backed study method
heart puzzle
Matching GameHow quick can you match all your cards?
flashcards
FlashcardsStudy terms and definitions

1 / 28

encourage image

There's no tags or description

Looks like no one added any tags here yet for you.

29 Terms

1

programming language

a notation for communicating to a computer what we want

it to do

New cards
2

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.

New cards
3

John von Neumann

had the idea that a computer should be

permanently hardwired with a small set of general-purpose

operations

New cards
4

opcode

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

performed called

New cards
5

data value integers

The last three lines of codes represents what

New cards
6

program instructions

The first five lines of code represent

New cards
7

instruction’s operands

The remaining 12 bits contain codes for what

New cards
8

assembly language

a type of language that relies on software tools to

automate some of the tasks of the programmers.

New cards
9

assembler

translates the symbolic assembly language code to binary

machine code.

New cards
10

loader

automatically loads the machine code for this instruction into computer

memory.

New cards
11

FORTRAN

one of the precursor of high-level

programming languages. Developed in early 1950s by

John Backus.

New cards
12

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).

New cards
13

data abstraction

simplify for human users the

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

trees.

New cards
14

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.

New cards
15

basic abstraction

collect the most localized machine information.

New cards
16

structured abstraction

collect intermediate information about the structure of a program.

New cards
17

unit abstraction

collect large-scale information in a program.

New cards
18

data structure

is the principal method for collecting related data values

into a single unit.

New cards
19

array

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

New cards
20

syntactic sugar

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

replace a complex notation with a simpler, shorthand notation.

New cards
21

iterator

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

New cards
22

procedure

sometimes also called a subprogram or subroutine.

New cards
23

procedure declaration and procedure invocation

Procedural abstraction involves two things:

New cards
24

function

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

New cards
25

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 _ _ _ _

New cards
26

imperative language

its primary feature is a sequence of

statements that represent commands

New cards
27

functional paradigm

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

lambda calculus.

New cards
28

logic paradigm

based on symbolic logic.

New cards
29

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

New cards
robot