暗記メーカー

暗記メーカー

​
ログイン
Data Structures and Algorithms (Mocktest) BSIT 307
52問 • 1年前
  • Xai Alexandrei Delos Reyes
    • 通報

    問題一覧

  • 1

    is a special format for storing and organizing data.

    Data Structure

  • 2

    Elements are accessed in a sequential order but may be stored unsystematically.

    Linear

  • 3

    Elements are stored and accessed in a non- sequential order.

    Non-Linear

  • 4

    is a logical description of how data is viewed as well as the operations that are allowed without regard to how they will be implemented.

    Abstract Data Type

  • 5

    the data and the operations

    Public or External

  • 6

    The representation and the implementation

    Private or internal

  • 7

    used for storing elements where each is a separate object.

    Linked list

  • 8

    An ordered list in which the last element added is the first element retrieved or removed (Last-In, First-Out).

    Stack

  • 9

    an ordered list in which the first element added is the first element retrieved or removed (First-In, First- Out).

    Queue

  • 10

    represents a hierarchical nature of a structure in a graphical form.

    Tree

  • 11

    a special type of queue where elements are processed based on their order (natural or custom).

    Priority Queue

  • 12

    a complete binary tree where the value of each of each parent node is either higher or lower than the value of its child nodes.

    Heap

  • 13

    a collection of elements where each element is unique.

    Set

  • 14

    a set of ordered paurs where elements are known as keys (identifiers) and values (content)

    Set

  • 15

    consists of a set of vertices (or nodes) and a set of edges (relations) between the pairs of vertices

    Graph

  • 16

    is a step-by-step set of instructions to be executed in sequence for solving a problem.

    Algorithm

  • 17

    An algorithm must terminate after a specified number of steps.

    Finiteness

  • 18

    An algorithm should have zero or more well-defined data given before the algorithm begins.

    Input

  • 19

    An algorithm must have one (1) or more results, with specified relation to the input.

    Output

  • 20

    The result of each step depends on the input and/or the result of the previous step.

    Uniqueness

  • 21

    Repeating an action multiple times

    Iteration

  • 22

    Each instruction has to be clear and unambiguous.

    Definiteness

  • 23

    occurs when a function calls itself once or multiple times to solve a problem

    Recursion

  • 24

    A problem is broken into smaller subproblems.

    Divide and Conquer

  • 25

    The optimal approach is always chosen in solving a problem.

    Greedy Algorithms

  • 26

    Similar to Divide and Conquer except that the results of the subproblems are reused for overlapping subproblems.

    Dynamic Programming

  • 27

    Any function that calls itself is...?

    recursive

  • 28

    Recursion that involves a method directly calling itself is called....?

    direct recursion

  • 29

    occurs when a method invokes another method, eventually resulting in the original method being invoked again.

    indirect recursion

  • 30

    When a recursive function fails to stop recursion

    infinite recursion

  • 31

    is the condition that allows the algorithm to stop recurring.

    Base case

  • 32

    means that some data that the algorithm is using is modified.

    Change of state

  • 33

    is a process of repeating a set of instructions. This is also known as “looping.”

    Iteration

  • 34

    The function calls itself twice in the run of the function. Ex. Fibonacci series

    Binary Recursion

  • 35

    The function works in a pair or a group. Ex. determining whether an integer is even or odd

    Mutual Recursion

  • 36

    The function calls itself once each time it is invoked. Ex. finding the factorial

    Linear Recursion

  • 37

    The function makes a recursive call as its very last operation. Ex. finding the greatest common divisor of two (2) non-zero integers

    Tail Recursion

  • 38

    is used for storing a collection of data where each element is a separate object.

    Linked List

  • 39

    Elements in a linked list are called..?

    Nodes

  • 40

    This contains the value of the element.

    Data field

  • 41

    This contains the address (random memory location) of the next node.

    Pointer field

  • 42

    The first node in the list is called...?

    Head

  • 43

    The next node in the list is referred to as the

    Successor

  • 44

    The last node points to _____ since there are no more successive elements.

    null

  • 45

    shows the elements in the list

    Display

  • 46

    adds an element into the list

    Insert

  • 47

    removes a specific element or all the elements from the list

    Delete

  • 48

    finds a specific element in the list

    Search

  • 49

    returns the number of elements in the list

    Count

  • 50

    the basic linked list

    Singly linked list

  • 51

    contains an extra pointer to connect to the previous node in the sequence.

    Doubly linked list

  • 52

    is a linked list in which the last node’s right pointer contains the address of the first node.

    Circular linked list

    • The Contemporary World Mock test (Prelims)

    The Contemporary World Mock test (Prelims)

    Xai Alexandrei Delos Reyes · 58問 · 2年前

    The Contemporary World Mock test (Prelims)

    The Contemporary World Mock test (Prelims)

    58問 • 2年前
    Xai Alexandrei Delos Reyes

    Computing Mock test (Prelims)

    Computing Mock test (Prelims)

    Xai Alexandrei Delos Reyes · 67問 · 2年前

    Computing Mock test (Prelims)

    Computing Mock test (Prelims)

    67問 • 2年前
    Xai Alexandrei Delos Reyes

    Programming Mock Test (Prelims)

    Programming Mock Test (Prelims)

    Xai Alexandrei Delos Reyes · 64問 · 2年前

    Programming Mock Test (Prelims)

    Programming Mock Test (Prelims)

    64問 • 2年前
    Xai Alexandrei Delos Reyes

    Entrepreneurship Mock Test (Prelims)

    Entrepreneurship Mock Test (Prelims)

    Xai Alexandrei Delos Reyes · 23問 · 2年前

    Entrepreneurship Mock Test (Prelims)

    Entrepreneurship Mock Test (Prelims)

    23問 • 2年前
    Xai Alexandrei Delos Reyes

    Computing Mock Test (Midterms) BSIT 107

    Computing Mock Test (Midterms) BSIT 107

    Xai Alexandrei Delos Reyes · 76問 · 2年前

    Computing Mock Test (Midterms) BSIT 107

    Computing Mock Test (Midterms) BSIT 107

    76問 • 2年前
    Xai Alexandrei Delos Reyes

    Math Mock Test (Prelims)

    Math Mock Test (Prelims)

    Xai Alexandrei Delos Reyes · 48問 · 2年前

    Math Mock Test (Prelims)

    Math Mock Test (Prelims)

    48問 • 2年前
    Xai Alexandrei Delos Reyes

    Programming Mock Test (Midterms) BSIT 107

    Programming Mock Test (Midterms) BSIT 107

    Xai Alexandrei Delos Reyes · 52問 · 2年前

    Programming Mock Test (Midterms) BSIT 107

    Programming Mock Test (Midterms) BSIT 107

    52問 • 2年前
    Xai Alexandrei Delos Reyes

    UTS Mock Test (Midterms) BSIT107

    UTS Mock Test (Midterms) BSIT107

    Xai Alexandrei Delos Reyes · 40問 · 2年前

    UTS Mock Test (Midterms) BSIT107

    UTS Mock Test (Midterms) BSIT107

    40問 • 2年前
    Xai Alexandrei Delos Reyes

    Entrepreneurship Mock Test (Midterms) BSIT 107

    Entrepreneurship Mock Test (Midterms) BSIT 107

    Xai Alexandrei Delos Reyes · 38問 · 2年前

    Entrepreneurship Mock Test (Midterms) BSIT 107

    Entrepreneurship Mock Test (Midterms) BSIT 107

    38問 • 2年前
    Xai Alexandrei Delos Reyes

    Contemporary World Mock Test (Midterms) BSIT 107

    Contemporary World Mock Test (Midterms) BSIT 107

    Xai Alexandrei Delos Reyes · 28問 · 2年前

    Contemporary World Mock Test (Midterms) BSIT 107

    Contemporary World Mock Test (Midterms) BSIT 107

    28問 • 2年前
    Xai Alexandrei Delos Reyes

    Math Mocktest (Midterms) BSIT 107

    Math Mocktest (Midterms) BSIT 107

    Xai Alexandrei Delos Reyes · 24問 · 2年前

    Math Mocktest (Midterms) BSIT 107

    Math Mocktest (Midterms) BSIT 107

    24問 • 2年前
    Xai Alexandrei Delos Reyes

    Computer Programming Mocktest (Pre-finals)

    Computer Programming Mocktest (Pre-finals)

    Xai Alexandrei Delos Reyes · 26問 · 2年前

    Computer Programming Mocktest (Pre-finals)

    Computer Programming Mocktest (Pre-finals)

    26問 • 2年前
    Xai Alexandrei Delos Reyes

    Math Mocktest (Pre-Finals)

    Math Mocktest (Pre-Finals)

    Xai Alexandrei Delos Reyes · 19問 · 2年前

    Math Mocktest (Pre-Finals)

    Math Mocktest (Pre-Finals)

    19問 • 2年前
    Xai Alexandrei Delos Reyes

    Computing Mock Test (Pre-finals)

    Computing Mock Test (Pre-finals)

    Xai Alexandrei Delos Reyes · 36問 · 2年前

    Computing Mock Test (Pre-finals)

    Computing Mock Test (Pre-finals)

    36問 • 2年前
    Xai Alexandrei Delos Reyes

    Computing Mock Test Finals

    Computing Mock Test Finals

    Xai Alexandrei Delos Reyes · 26問 · 2年前

    Computing Mock Test Finals

    Computing Mock Test Finals

    26問 • 2年前
    Xai Alexandrei Delos Reyes

    Comprog 2nd sem (prelims) BSIT 205

    Comprog 2nd sem (prelims) BSIT 205

    Xai Alexandrei Delos Reyes · 63問 · 1年前

    Comprog 2nd sem (prelims) BSIT 205

    Comprog 2nd sem (prelims) BSIT 205

    63問 • 1年前
    Xai Alexandrei Delos Reyes

    Discrete Math 2nd sem (prelims) BSIT 205

    Discrete Math 2nd sem (prelims) BSIT 205

    Xai Alexandrei Delos Reyes · 36問 · 1年前

    Discrete Math 2nd sem (prelims) BSIT 205

    Discrete Math 2nd sem (prelims) BSIT 205

    36問 • 1年前
    Xai Alexandrei Delos Reyes

    Art Appreciation (Prelim) BSIT 205

    Art Appreciation (Prelim) BSIT 205

    Xai Alexandrei Delos Reyes · 56問 · 1年前

    Art Appreciation (Prelim) BSIT 205

    Art Appreciation (Prelim) BSIT 205

    56問 • 1年前
    Xai Alexandrei Delos Reyes

    Ethics 2nd sem (Prelims) BSIT 205

    Ethics 2nd sem (Prelims) BSIT 205

    Xai Alexandrei Delos Reyes · 45問 · 1年前

    Ethics 2nd sem (Prelims) BSIT 205

    Ethics 2nd sem (Prelims) BSIT 205

    45問 • 1年前
    Xai Alexandrei Delos Reyes

    STS 2nd Sem (Prelim) BSIT 205

    STS 2nd Sem (Prelim) BSIT 205

    Xai Alexandrei Delos Reyes · 40問 · 1年前

    STS 2nd Sem (Prelim) BSIT 205

    STS 2nd Sem (Prelim) BSIT 205

    40問 • 1年前
    Xai Alexandrei Delos Reyes

    問題一覧

  • 1

    is a special format for storing and organizing data.

    Data Structure

  • 2

    Elements are accessed in a sequential order but may be stored unsystematically.

    Linear

  • 3

    Elements are stored and accessed in a non- sequential order.

    Non-Linear

  • 4

    is a logical description of how data is viewed as well as the operations that are allowed without regard to how they will be implemented.

    Abstract Data Type

  • 5

    the data and the operations

    Public or External

  • 6

    The representation and the implementation

    Private or internal

  • 7

    used for storing elements where each is a separate object.

    Linked list

  • 8

    An ordered list in which the last element added is the first element retrieved or removed (Last-In, First-Out).

    Stack

  • 9

    an ordered list in which the first element added is the first element retrieved or removed (First-In, First- Out).

    Queue

  • 10

    represents a hierarchical nature of a structure in a graphical form.

    Tree

  • 11

    a special type of queue where elements are processed based on their order (natural or custom).

    Priority Queue

  • 12

    a complete binary tree where the value of each of each parent node is either higher or lower than the value of its child nodes.

    Heap

  • 13

    a collection of elements where each element is unique.

    Set

  • 14

    a set of ordered paurs where elements are known as keys (identifiers) and values (content)

    Set

  • 15

    consists of a set of vertices (or nodes) and a set of edges (relations) between the pairs of vertices

    Graph

  • 16

    is a step-by-step set of instructions to be executed in sequence for solving a problem.

    Algorithm

  • 17

    An algorithm must terminate after a specified number of steps.

    Finiteness

  • 18

    An algorithm should have zero or more well-defined data given before the algorithm begins.

    Input

  • 19

    An algorithm must have one (1) or more results, with specified relation to the input.

    Output

  • 20

    The result of each step depends on the input and/or the result of the previous step.

    Uniqueness

  • 21

    Repeating an action multiple times

    Iteration

  • 22

    Each instruction has to be clear and unambiguous.

    Definiteness

  • 23

    occurs when a function calls itself once or multiple times to solve a problem

    Recursion

  • 24

    A problem is broken into smaller subproblems.

    Divide and Conquer

  • 25

    The optimal approach is always chosen in solving a problem.

    Greedy Algorithms

  • 26

    Similar to Divide and Conquer except that the results of the subproblems are reused for overlapping subproblems.

    Dynamic Programming

  • 27

    Any function that calls itself is...?

    recursive

  • 28

    Recursion that involves a method directly calling itself is called....?

    direct recursion

  • 29

    occurs when a method invokes another method, eventually resulting in the original method being invoked again.

    indirect recursion

  • 30

    When a recursive function fails to stop recursion

    infinite recursion

  • 31

    is the condition that allows the algorithm to stop recurring.

    Base case

  • 32

    means that some data that the algorithm is using is modified.

    Change of state

  • 33

    is a process of repeating a set of instructions. This is also known as “looping.”

    Iteration

  • 34

    The function calls itself twice in the run of the function. Ex. Fibonacci series

    Binary Recursion

  • 35

    The function works in a pair or a group. Ex. determining whether an integer is even or odd

    Mutual Recursion

  • 36

    The function calls itself once each time it is invoked. Ex. finding the factorial

    Linear Recursion

  • 37

    The function makes a recursive call as its very last operation. Ex. finding the greatest common divisor of two (2) non-zero integers

    Tail Recursion

  • 38

    is used for storing a collection of data where each element is a separate object.

    Linked List

  • 39

    Elements in a linked list are called..?

    Nodes

  • 40

    This contains the value of the element.

    Data field

  • 41

    This contains the address (random memory location) of the next node.

    Pointer field

  • 42

    The first node in the list is called...?

    Head

  • 43

    The next node in the list is referred to as the

    Successor

  • 44

    The last node points to _____ since there are no more successive elements.

    null

  • 45

    shows the elements in the list

    Display

  • 46

    adds an element into the list

    Insert

  • 47

    removes a specific element or all the elements from the list

    Delete

  • 48

    finds a specific element in the list

    Search

  • 49

    returns the number of elements in the list

    Count

  • 50

    the basic linked list

    Singly linked list

  • 51

    contains an extra pointer to connect to the previous node in the sequence.

    Doubly linked list

  • 52

    is a linked list in which the last node’s right pointer contains the address of the first node.

    Circular linked list