Scribd Logo
Upload

Welcome to Scribd!

  • 32 views

    CSI104

    Uploaded by

    Tâm Lê
    The document defines key terms related to computer history, binary logic, computer memory, sorting algorithms, programming languages, and data structures. It provides definitions for terms such as the Pascaline and Jacquard Loom as early computing devices, AND, OR, XOR, and NOT as binary logic operators, pages and segmentation as memory allocation techniques, insertion, selection, and bubble sort, procedural and object-oriented programming languages, and stacks and queues as data structures.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    CSI104

    Uploaded by

    Tâm Lê
    32 views3 pages
    The document defines key terms related to computer history, binary logic, computer memory, sorting algorithms, programming languages, and data structures. It provides definitions for terms such as the Pascaline and Jacquard Loom as early computing devices, AND, OR, XOR, and NOT as binary logic operators, pages and segmentation as memory allocation techniques, insertion, selection, and bubble sort, procedural and object-oriented programming languages, and stacks and queues as data structures.

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document defines key terms related to computer history, binary logic, computer memory, sorting algorithms, programming languages, and data structures. It provides definitions for terms such as the Pascaline and Jacquard Loom as early computing devices, AND, OR, XOR, and NOT as binary logic operators, pages and segmentation as memory allocation techniques, insertion, selection, and bubble sort, procedural and object-oriented programming languages, and stacks and queues as data structures.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    32 views3 pages

    CSI104

    Uploaded by

    Tâm Lê
    The document defines key terms related to computer history, binary logic, computer memory, sorting algorithms, programming languages, and data structures. It provides definitions for terms such as the Pascaline and Jacquard Loom as early computing devices, AND, OR, XOR, and NOT as binary logic operators, pages and segmentation as memory allocation techniques, insertion, selection, and bubble sort, procedural and object-oriented programming languages, and stacks and queues as data structures.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 3

    1-9 A 17th-century computing machine that could perform addition and

    subtraction was the ________


    Pascaline
    1-12 The first electronic special-purpose computer was called ________
    ABC
    1-13 One of the first computers based on the von Neumann model was called
    ________ .
    EDVAC
    1-14 The first computing machine to use the idea of storage and
    programming was called ________ .
    the Jacquard loom
    4-11 ________ operator (s) takes two inputs to produce one output.
    AND, OR, or XOR
    4-12 The unary ________ operator inverts its single input.
    NOT
    4-13 ________ operator (s), if the input is two 0s, the output is 0.
    In AND, OR, or XOR
    4-14 ________ operator (s), if the input is two 1s, the output is 0.
    In only XOR
    4-15 For the binary AND operation, only an input of ________ gives an
    output of 1.
    two 1s
    4-16 For the binary OR operation, only an input of ________ gives an output of 0.
    two 0s
    4-18 To flip all the bits of a bit pattern, make a mask of all 1s and then
    ________ the bit pattern and the mask.
    XOR
    4-19 To un-set (force to 0) all the bits of a bit pattern, make a mask of all 0s
    and then ________ the bit pattern and the mask.
    AND
    4-20 To set (force to 1) all the bits of a bit pattern, make a mask of all 1s and then
    ________ the bit pattern and the mask.
    OR
    7-8 In paging, a program is divided into equally sized sections called________ .
    pages
    7-9 In ________ , the program can be divided into differently sized sections.
    demand segmentation
    7-10 In ________ , the program can be divided into equally sized sections called pages,
    but the pages need not be in memory at the same time for execution.
    demand paging
    8-12 In ________ sort, the item that goes into the sorted list is always the first item in
    the unsorted list.
    insertion
    8-13 In ________ sort, the smallest item from the unsorted list is swapped with the item
    at the beginning of the unsorted list.
    selection
    8-14 In ________ sort, the smallest item moves to the beginning of the
    unsorted list. There is no one-to-one swapping.
    Bubble
    FORTRAN is a(n) ________ language.
    procedural
    9-4 Pascal is a(n) ________ language.
    . procedural
    9-5 Java is a(n) ________ language.
    object-oriented
    9-6 LISP is a(n) ________ language.
    functional
    9-7 ________ is a common language in the business -environment.
    COBOL
    9-8 ________ is a popular object-oriented language.
    Java
    9-9 A ________ program can be either an application or an applet.
    Java
    9-10 LISP and Scheme are both ________ languages.
    functional
    9-11 Prolog is an example of a(n) ________ language.
    Declarative
    10-6 ________ is the breaking up of a large project into smaller parts.
    Modularization
    10-7 ________ is a measure of how tightly two modules are bound to each other.
    Coupling
    10-8 ________ between modules in a software system must be minimized.
    Coupling
    10-9 ________ between modules in a software system must be maximized.
    Cohesion
    12-2 A stack is a ________ structure.
    LIFO
    12-3 A (n) ________ list is also known as a queue.
    FIFO

    You might also like