暗記メーカー

暗記メーカー

​
ログイン
CC4 REVIEW QUIZ
63問 • 1年前
  • ユーザ名非公開
    • 通報

    問題一覧

  • 1

    give the 5 DS AND ALGO DESIGN GOALS/IMPLEMENTATION GOALS

    EFFICIENCY, CORRECTNESS, ROBUSTNESS, ADOPTABILITY, REUSABILITY

  • 2

    this is a machine that manipulates data.

    COMPUTER

  • 3

    this is the concealing of the implementation details of data object from the outside world

    DATA ENCAPSULATION

  • 4

    this is the collection of objects and set of operations that act on those objects

    DATA TYPES

  • 5

    the storing and organizing data in a computer so that it can be used efficiently.

    DATA STRUCTURE

  • 6

    a separation between specification of a data object and its implementation

    DATA ABSTRACTIONS

  • 7

    DATA TYPES ABOUT BASIC

    PRIMITIVE

  • 8

    DATA TYPES ABOUT COMPLEX

    COMPOSIVE

  • 9

    it may be organized in many different

    DATA

  • 10

    used for manipulation of data.

    ALGORITHM

  • 11

    Accessing each record exactly once so that certain items in the record may be processed.

    TRAVERSING (Retrieving/Visiting)

  • 12

    Adding new records to the structure.

    INSERTION (Update/Inputing)

  • 13

    Finding the location of the record

    SEARCHING (Finding)

  • 14

    Removing a data into a structure

    DELETING

  • 15

    Used by OS, compilers, DBMS, data communications

    DATA STRUCTURE/+ ALGORITHMS

  • 16

    Give the 7 DATA STRUCTURE/+ ALGORITHMS

    Image processing digital signal processing simulations numerical computations cryptography data compressionS genetic studies

  • 17

    give the 4 LINEAR DATA STRUCTURE

    ARRAY STACK LIFO QUEUE FIFO LINKED LIST

  • 18

    Its elements form a sequence

    LINEAR DATA STRUCTURE

  • 19

    NON-LINEAR DATA STRUCTURE is…

    represent data containing a hierarchical relationship between elements

  • 20

    finite set of instructions that takes some raw data as input and transforms it in to refined data.

    ALGORITHM

  • 21

    Each instruction is clear and unambiguous

    DEFINITENESS

  • 22

    Zero or more quantities are externally supplied

    INPUT

  • 23

    At least one quantity is produced

    OUTPUT

  • 24

    algorithm terminates after a fi nite number of steps

    FINITENESS

  • 25

    Every instruction must be basic enough to be carried out

    EFFECTIVENESS

  • 26

    search for a given item in large data collection

    SEARCHING

  • 27

    arrange data items

    SORTING

  • 28

    reduce the size of data and program files

    COMPRESSION

  • 29

    encryption of data

    ENCODING

  • 30

    designed for digital signal processing

    FAST FOURIER TRANSFORMS

  • 31

    identification of geometric shapes

    GEOMETRIC

  • 32

    comparing images and shapes

    PATTERN MATCHING

  • 33

    identify different programming constructs

    PARSING

  • 34

    this is a classification of algorithms that repeated in loops until the goal is achieved

    ITERATIVE

  • 35

    the DIVIDE AND CONQUER is classification in algorithms which definitions is true?

    fragmented into subproblems which are solved partially

  • 36

    an immediately available best solution at each step is chosen

    GREEDY

  • 37

    all possible solutions are explored

    BACK TRACKING

  • 38

    NATURAL LANGUAGE is expressing an algorithm which definitions is true?

    must be well defined and unambiguous

  • 39

    an expressing algorithm that used flowcharts

    GRAPHIC REPRESENTATIONS

  • 40

    low level implementation must be removed and replaced by natural language

    PROGRAMMING LANGUAGE

  • 41

    FROM A PERFORMANCE POINT OF VIEW, WE DEFINE 2 CRITERIA and the “the amount of computer time needed by a progra m to run to completion” is?

    TIME COMPLEXITY

  • 42

    FROM A PERFORMANCE POINT OF VIEW, WE DEFINE 2 CRITERIA and the “the amount of memory needed by a program to run to completion” is?

    SPACE COMPLEXITY

  • 43

    we have TWO PHASES IN PERFORMANCE EVALUATION the “priori testing” is known as?

    PERFORMANCE MEASUREMENT

  • 44

    we have TWO PHASES IN PERFORMANCE EVALUATION and the “priori estimate” is known as?

    PERFORMANCE ANALYSIS

  • 45

    independent. Memory does not change

    FIXED PART

  • 46

    Helps to compare algorithms

    ASYMPTOTIC NOTATION

  • 47

    Dependent. Memory do change

    VARIABLE PART

  • 48

    LONG?

    WORST CASE RUNNING TIME

  • 49

    MEDIUM/AVERAGE?

    AVERAGE CASE RUNNING TIME

  • 50

    SHORT?

    BEST CASE RUNNING TIME

  • 51

    way of solving a problem or calculation in less time by using more storage space (or memory), or by solving a problem in very little space by spending a longtime.

    TIME SPACE TRADEOFF

  • 52

    is a finite, ordered sequence of data itemsknown as elements.

    LIST

  • 53

    each element has a positionin the list.

    ORDERED

  • 54

    A list is said to be______ when it contains no elements.

    EMPTY

  • 55

    number of elements currently stored

    LENGTH OF LIST

  • 56

    The beginning of the list is called the _____, the end of the list iscalled the ____.

    HEAD & TAIL

  • 57

    There are two standard approaches to implementing lists,

    ARRAYBASED LIST & LINKED LIST

  • 58

    It is a collection of Homogenous, ordered andFinite set of elements. It is a Linear data Structure. Its data type can be Primitive, Composite or Other Data Types.

    ARRAY

  • 59

    same element type and have the same structure

    HOMOGENEOUS

  • 60

    Adding operation is also sometimes referred to as ________

    ASSIGNING

  • 61

    It adds new element in a specified position, without replacing any existing element The position is specified in terms of index value or position relative to an existing element.

    INSERTING MAGKA IBA SA ADDING

  • 62

    involves accessing and processing an array element exactly once ~It is also called Visiting.

    TRAVERSING

  • 63

    It is also called Accessing - To retrieve an element we must know the Index value

    RETRIEVING

    • examen Alexandru

    examen Alexandru

    ユーザ名非公開 · 40問 · 8日前

    examen Alexandru

    examen Alexandru

    40問 • 8日前
    ユーザ名非公開

    MPLE

    MPLE

    ユーザ名非公開 · 41問 · 13日前

    MPLE

    MPLE

    41問 • 13日前
    ユーザ名非公開

    Weekly Test 3

    Weekly Test 3

    ユーザ名非公開 · 50問 · 13日前

    Weekly Test 3

    Weekly Test 3

    50問 • 13日前
    ユーザ名非公開

    Weekly Test 2

    Weekly Test 2

    ユーザ名非公開 · 50問 · 13日前

    Weekly Test 2

    Weekly Test 2

    50問 • 13日前
    ユーザ名非公開

    Weekly Test 1

    Weekly Test 1

    ユーザ名非公開 · 50問 · 13日前

    Weekly Test 1

    Weekly Test 1

    50問 • 13日前
    ユーザ名非公開

    Refresher SPDI 1

    Refresher SPDI 1

    ユーザ名非公開 · 9問 · 13日前

    Refresher SPDI 1

    Refresher SPDI 1

    9問 • 13日前
    ユーザ名非公開

    Refresher SPDI 1

    Refresher SPDI 1

    ユーザ名非公開 · 100問 · 13日前

    Refresher SPDI 1

    Refresher SPDI 1

    100問 • 13日前
    ユーザ名非公開

    Definition of Terms 3

    Definition of Terms 3

    ユーザ名非公開 · 90問 · 13日前

    Definition of Terms 3

    Definition of Terms 3

    90問 • 13日前
    ユーザ名非公開

    Definition of Terms 2

    Definition of Terms 2

    ユーザ名非公開 · 90問 · 13日前

    Definition of Terms 2

    Definition of Terms 2

    90問 • 13日前
    ユーザ名非公開

    Definition of Terms 1

    Definition of Terms 1

    ユーザ名非公開 · 90問 · 13日前

    Definition of Terms 1

    Definition of Terms 1

    90問 • 13日前
    ユーザ名非公開

    WT 6

    WT 6

    ユーザ名非公開 · 50問 · 13日前

    WT 6

    WT 6

    50問 • 13日前
    ユーザ名非公開

    WT 3

    WT 3

    ユーザ名非公開 · 50問 · 13日前

    WT 3

    WT 3

    50問 • 13日前
    ユーザ名非公開

    WT 1

    WT 1

    ユーザ名非公開 · 50問 · 13日前

    WT 1

    WT 1

    50問 • 13日前
    ユーザ名非公開

    SPI version D pt 2

    SPI version D pt 2

    ユーザ名非公開 · 61問 · 13日前

    SPI version D pt 2

    SPI version D pt 2

    61問 • 13日前
    ユーザ名非公開

    RNPCP Chapter 6 to 9

    RNPCP Chapter 6 to 9

    ユーザ名非公開 · 94問 · 13日前

    RNPCP Chapter 6 to 9

    RNPCP Chapter 6 to 9

    94問 • 13日前
    ユーザ名非公開

    Item 303 Bituminous Seal Coat

    Item 303 Bituminous Seal Coat

    ユーザ名非公開 · 20問 · 13日前

    Item 303 Bituminous Seal Coat

    Item 303 Bituminous Seal Coat

    20問 • 13日前
    ユーザ名非公開

    Item 301 Bituminous Prime Coat

    Item 301 Bituminous Prime Coat

    ユーザ名非公開 · 10問 · 13日前

    Item 301 Bituminous Prime Coat

    Item 301 Bituminous Prime Coat

    10問 • 13日前
    ユーザ名非公開

    Item 300 Aggregate Surface Course

    Item 300 Aggregate Surface Course

    ユーザ名非公開 · 11問 · 13日前

    Item 300 Aggregate Surface Course

    Item 300 Aggregate Surface Course

    11問 • 13日前
    ユーザ名非公開

    Item 206 Chemically Stabilized Road Mix Subbase/Base Course

    Item 206 Chemically Stabilized Road Mix Subbase/Base Course

    ユーザ名非公開 · 11問 · 13日前

    Item 206 Chemically Stabilized Road Mix Subbase/Base Course

    Item 206 Chemically Stabilized Road Mix Subbase/Base Course

    11問 • 13日前
    ユーザ名非公開

    Item 207 Portland Cement Stabilized Treated Plant Mix Base Course

    Item 207 Portland Cement Stabilized Treated Plant Mix Base Course

    ユーザ名非公開 · 13問 · 13日前

    Item 207 Portland Cement Stabilized Treated Plant Mix Base Course

    Item 207 Portland Cement Stabilized Treated Plant Mix Base Course

    13問 • 13日前
    ユーザ名非公開

    問題一覧

  • 1

    give the 5 DS AND ALGO DESIGN GOALS/IMPLEMENTATION GOALS

    EFFICIENCY, CORRECTNESS, ROBUSTNESS, ADOPTABILITY, REUSABILITY

  • 2

    this is a machine that manipulates data.

    COMPUTER

  • 3

    this is the concealing of the implementation details of data object from the outside world

    DATA ENCAPSULATION

  • 4

    this is the collection of objects and set of operations that act on those objects

    DATA TYPES

  • 5

    the storing and organizing data in a computer so that it can be used efficiently.

    DATA STRUCTURE

  • 6

    a separation between specification of a data object and its implementation

    DATA ABSTRACTIONS

  • 7

    DATA TYPES ABOUT BASIC

    PRIMITIVE

  • 8

    DATA TYPES ABOUT COMPLEX

    COMPOSIVE

  • 9

    it may be organized in many different

    DATA

  • 10

    used for manipulation of data.

    ALGORITHM

  • 11

    Accessing each record exactly once so that certain items in the record may be processed.

    TRAVERSING (Retrieving/Visiting)

  • 12

    Adding new records to the structure.

    INSERTION (Update/Inputing)

  • 13

    Finding the location of the record

    SEARCHING (Finding)

  • 14

    Removing a data into a structure

    DELETING

  • 15

    Used by OS, compilers, DBMS, data communications

    DATA STRUCTURE/+ ALGORITHMS

  • 16

    Give the 7 DATA STRUCTURE/+ ALGORITHMS

    Image processing digital signal processing simulations numerical computations cryptography data compressionS genetic studies

  • 17

    give the 4 LINEAR DATA STRUCTURE

    ARRAY STACK LIFO QUEUE FIFO LINKED LIST

  • 18

    Its elements form a sequence

    LINEAR DATA STRUCTURE

  • 19

    NON-LINEAR DATA STRUCTURE is…

    represent data containing a hierarchical relationship between elements

  • 20

    finite set of instructions that takes some raw data as input and transforms it in to refined data.

    ALGORITHM

  • 21

    Each instruction is clear and unambiguous

    DEFINITENESS

  • 22

    Zero or more quantities are externally supplied

    INPUT

  • 23

    At least one quantity is produced

    OUTPUT

  • 24

    algorithm terminates after a fi nite number of steps

    FINITENESS

  • 25

    Every instruction must be basic enough to be carried out

    EFFECTIVENESS

  • 26

    search for a given item in large data collection

    SEARCHING

  • 27

    arrange data items

    SORTING

  • 28

    reduce the size of data and program files

    COMPRESSION

  • 29

    encryption of data

    ENCODING

  • 30

    designed for digital signal processing

    FAST FOURIER TRANSFORMS

  • 31

    identification of geometric shapes

    GEOMETRIC

  • 32

    comparing images and shapes

    PATTERN MATCHING

  • 33

    identify different programming constructs

    PARSING

  • 34

    this is a classification of algorithms that repeated in loops until the goal is achieved

    ITERATIVE

  • 35

    the DIVIDE AND CONQUER is classification in algorithms which definitions is true?

    fragmented into subproblems which are solved partially

  • 36

    an immediately available best solution at each step is chosen

    GREEDY

  • 37

    all possible solutions are explored

    BACK TRACKING

  • 38

    NATURAL LANGUAGE is expressing an algorithm which definitions is true?

    must be well defined and unambiguous

  • 39

    an expressing algorithm that used flowcharts

    GRAPHIC REPRESENTATIONS

  • 40

    low level implementation must be removed and replaced by natural language

    PROGRAMMING LANGUAGE

  • 41

    FROM A PERFORMANCE POINT OF VIEW, WE DEFINE 2 CRITERIA and the “the amount of computer time needed by a progra m to run to completion” is?

    TIME COMPLEXITY

  • 42

    FROM A PERFORMANCE POINT OF VIEW, WE DEFINE 2 CRITERIA and the “the amount of memory needed by a program to run to completion” is?

    SPACE COMPLEXITY

  • 43

    we have TWO PHASES IN PERFORMANCE EVALUATION the “priori testing” is known as?

    PERFORMANCE MEASUREMENT

  • 44

    we have TWO PHASES IN PERFORMANCE EVALUATION and the “priori estimate” is known as?

    PERFORMANCE ANALYSIS

  • 45

    independent. Memory does not change

    FIXED PART

  • 46

    Helps to compare algorithms

    ASYMPTOTIC NOTATION

  • 47

    Dependent. Memory do change

    VARIABLE PART

  • 48

    LONG?

    WORST CASE RUNNING TIME

  • 49

    MEDIUM/AVERAGE?

    AVERAGE CASE RUNNING TIME

  • 50

    SHORT?

    BEST CASE RUNNING TIME

  • 51

    way of solving a problem or calculation in less time by using more storage space (or memory), or by solving a problem in very little space by spending a longtime.

    TIME SPACE TRADEOFF

  • 52

    is a finite, ordered sequence of data itemsknown as elements.

    LIST

  • 53

    each element has a positionin the list.

    ORDERED

  • 54

    A list is said to be______ when it contains no elements.

    EMPTY

  • 55

    number of elements currently stored

    LENGTH OF LIST

  • 56

    The beginning of the list is called the _____, the end of the list iscalled the ____.

    HEAD & TAIL

  • 57

    There are two standard approaches to implementing lists,

    ARRAYBASED LIST & LINKED LIST

  • 58

    It is a collection of Homogenous, ordered andFinite set of elements. It is a Linear data Structure. Its data type can be Primitive, Composite or Other Data Types.

    ARRAY

  • 59

    same element type and have the same structure

    HOMOGENEOUS

  • 60

    Adding operation is also sometimes referred to as ________

    ASSIGNING

  • 61

    It adds new element in a specified position, without replacing any existing element The position is specified in terms of index value or position relative to an existing element.

    INSERTING MAGKA IBA SA ADDING

  • 62

    involves accessing and processing an array element exactly once ~It is also called Visiting.

    TRAVERSING

  • 63

    It is also called Accessing - To retrieve an element we must know the Index value

    RETRIEVING