Programming Language Survey

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

1/53

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

54 Terms

1
New cards

Programming language

A notation for computing to a computer what we want it to do.

2
New cards

“Hardwired” Programs

Pre 1940s computers required you to adjust the internal wiring to perform different tasks.

3
New cards

Assembly language

A set of mnemonic symbols for instruction codes and memory locations.

4
New cards

Assembler

A program that translates the symbolic assembly language code to binary machine code.

5
New cards

Loader

A program that loads the machine code into computer memory.

6
New cards

Mnemonic symbols shortcomings

  • Lacked abstraction of conventional mathematical notation

  • Each type of computer hardware architecture has its own machine language instruction set and requires its own dialect of assembly language

7
New cards

FORTRAN (FORmula TRANslation Language)

  • Developed by Backus in early 1950s

  • Reflected the architecture of a particular type of machine

  • Lacked the structured control statements and data structures of later high-level languages

  • Supported algebraic notation and floating point numbers

8
New cards

ALGOL

  • First language that was machine independent

  • First language to receive a formal specification or definition

  • Supported different numeric types and control statements

  • Introduced arrays

9
New cards

Compiler

Translates programming language statements into machine code.

10
New cards

Pascal

Language for teaching programming in the 1970s

11
New cards

Ada

Language for embedded applications of U.S. Dept. of Defense

12
New cards

Lambda Calculus

Computational model developed by mathematician Alonzo Church which is based on the theory of recursive functions

13
New cards

Lisp

Programming language that uses the functional model of computation

14
New cards

Data abstractions

Simplify the behavior and attributes of data for humans

Ex. numbers, character strings, search trees

15
New cards

Control abstractions

Simplify properties of the transfer of control

Ex. loops, conditional statements, procedure calls

16
New cards

Basic abstractions

collect the most localized machine information

17
New cards

Structured abstractions

Collect intermediate information about the structure of a program

18
New cards

Unit abstractions

Collect large-scale information in a program

19
New cards

Basic data abstraction

Hides internal representation of common data values

  • Variables: hide computer memory locations

  • Data types: names for kinds of data values

  • Declaration: process of giving a variable a name and data type

20
New cards

Data structure

Collects related data values into a single unit

21
New cards

Unit abstraction

Often associated with the concept of an abstract data type

22
New cards

Basic control abstractions

Statements that combine a few machine instructions into an abstract statement that is easier to understand

23
New cards

Syntactic sugar

A mechanism that allows you to replace a complex notation with a simpler, shorthand notation

24
New cards

Iterator

An object associated with a collection

25
New cards

Procedure/subprogram/subroutine

Groups a sequence of actions into a single action that can be called or invoked from other points in the program

Does not return anything

26
New cards

Function

Mathematical, returns one thing

27
New cards

Method

The message sent to an object to make it do something

28
New cards

Runtime environment

The system implementation of the program

29
New cards

Higher-order functions

Functions that can accept other functions as arguments and return functions as values

30
New cards

Unit

A stand-alone collection of procedures providing logically related services to other parts of a program

31
New cards

von Neumann bottleneck

Requirement that a program be described as a sequence of instructions

32
New cards

Imperative language

Three properties

  • Sequential execution of instructions

  • Use of variables representing memory locations

  • Use of assignment to change the values of variables

33
New cards

Language syntax

Similar to the grammar of a natural language

34
New cards

Language semantics

Meaning of a language

35
New cards

A language is successful if

  • It achieves the goals of its designers

  • It attains widespread use in an application area

  • It serves as a model for other languages that are successful

36
New cards

Writability

The quality of a language that enables a programmer to use it to express computation clearly, correctly, concisely, and quickly

37
New cards

Regularity

Refers to how well the features of a language are integrated

Three concepts:

  • Generality

  • Orthogonal design

  • Uniformity

38
New cards

A language designed with security in mind…

  • Discourages programming errors

  • Allows errors to be discovered and reported

39
New cards

Semantically safe

Languages that prevent a programmer from compiling or executing any statements or expressions that violate the language definition

40
New cards

Extensible language

A language that allows the user to add features to it

41
New cards

Macro

Specifies the syntax of a piece of code that expands to other standard code when compiled

42
New cards

Difference between imperative programming and functional programming

The concept of a variable

In math, variables always stand for actual values

In imperative programming languages, variables refer to memory locations that store values

43
New cards

Referential transparency

The property whereby a function’s value depends only on the values of its arguments (and nonlocal variables)

44
New cards

Value semantics

Semantics in which names are associated only to values, not memory locations

45
New cards

In functional programming, functions are…

First-class data values

They can be computed by other functions and parameters to other functions

46
New cards

LISP (LISt Processing)

First language that contained many of the features of modern functional languages

47
New cards

Tail recursive

When the recursive steps are the last steps in any function

48
New cards
49
New cards
50
New cards
51
New cards
52
New cards
53
New cards
54
New cards