暗記メーカー

暗記メーカー

​
ログイン
Linear Data Structure
43問 • 1年前
  • iam noone
    • 通報

    問題一覧

  • 1

    is a container which can hold a fix number of items and these items should be of the same type.

    Array

  • 2

    Each item stored in an array is called

    Element

  • 3

    Each location of an element in an array has a numerical _____, which is used to identify the element.

    Index

  • 4

    Basic Operations of array are:

    Traverse Insertion Deletion Search Update

  • 5

    Basic Operations : Array print all the array elements one by one.

    Traverse

  • 6

    Adds an element at the given index.

    Insertion

  • 7

    In Python, we can treat lists as arrays. However, we cannot constrain the type of elements stored in a list.

    True

  • 8

    is a linear data structure that “follows the principle of Last In First Out (LIFO)”. This means the last element inserted inside the _____ is removed first.

    Stack

  • 9

    You can think of the stack data structure as the pile of plates on top of another.

    True

  • 10

    In programming terms, putting an item on top of the stack is called push And Removing an item is called pop.

    true

  • 11

    Add an element to the top of a stack

    Push

  • 12

    Remove an element from the top of a stack

    Pop

  • 13

    Check if the stack is empty

    IsEmpty

  • 14

    Get the value of the top element without removing it

    Peek

  • 15

    is used to keep track of the top element in the stack.

    A pointer called TOP

  • 16

    When initializing the stack, we set its value to ____so that we can check if the stack is empty by comparing _______.

    -1 by comparing TOP == -1.

  • 17

    On pushing an element, we increase the value of TOP and place the new element in the position pointed to by TOP.

    True

  • 18

    On popping an element, we return the element pointed to by TOP and reduce its value.

    true

  • 19

    Before pushing, , we check if the stack is already

    full

  • 20

    Before popping, we check if the stack is already

    empty

  • 21

    is a useful data structure in programming. It is similar to the ticket outside a cinema hall, where the first person entering is the first person who gets the ticket.

    Queue

  • 22

    Queue follows the First In First Out (FIFO) rule - the item that goes in first is the item that comes out first.

    True

  • 23

    Add an element to the end of the queue

    Enqueue

  • 24

    Remove an element from the front of the queue

    Dequeue

  • 25

    Get the value of the front of the queue without removing it

    Peek

  • 26

    There are four(4) different types of queues: Simple Circular Priority Deque

    True

  • 27

    Insertion takes place at the rear and removal occurs at the front. It strictly follows the FIFO (First in First out) rule.

    Simple Queue

  • 28

    the last element points to the first element making a link.

    Circular Queue

  • 29

    The main advantage of a circular queue over a simple queue is __________. If the last position is full and the first position is empty, we can insert an element in the first position. This action is not possible in a simple queue.

    better memory utilization

  • 30

    is a special type of queue in which each element is associated with a priority and is served according to its priority. They are served according to their order in the queue.

    Priority Queue

  • 31

    insertion and removal of elements can be performed from either from the front or rear. Thus, it does not follow the FIFO (First In First Out) rule.

    Deque (Double ended queue)

  • 32

    Data elements are connected through a series of nodes. And, each node contains the data items and address to the next node.

    Linked List

  • 33

    There are three(3) different types of linked list: Singly linked list Doubly Linked list Circular linked list

    True

  • 34

    It is the most common. Each node has data and a pointer to the next node.

    Singly linked list

  • 35

    Add a pointer to the previous nod. Thus, it can go in either direction: forward or backward.

    Doubly linked list

  • 36

    Are used to define the type of value the array will hold.

    Typecode

  • 37

    Represents signed integer of size 1 byte

    b

  • 38

    Represents unsigned integer of size 1 byte

    B

  • 39

    Represents character of size 2 bytes

    u

  • 40

    Represents signed integer of size 2 bytes

    i

  • 41

    Represents unsigned integer of size 2 bytes

    l

  • 42

    Represents floating point of size 4 bytes

    f

  • 43

    Represents floating point of size 8 bytes

    g

    • Data Structure (history)

    Data Structure (history)

    iam noone · 64問 · 1年前

    Data Structure (history)

    Data Structure (history)

    64問 • 1年前
    iam noone

    Searching for Algorithms

    Searching for Algorithms

    iam noone · 22問 · 1年前

    Searching for Algorithms

    Searching for Algorithms

    22問 • 1年前
    iam noone

    Linked list/ Trees and graphs

    Linked list/ Trees and graphs

    iam noone · 51問 · 1年前

    Linked list/ Trees and graphs

    Linked list/ Trees and graphs

    51問 • 1年前
    iam noone

    Sorting algorithms

    Sorting algorithms

    iam noone · 41問 · 1年前

    Sorting algorithms

    Sorting algorithms

    41問 • 1年前
    iam noone

    INTRO TO MS ACCESS(database)

    INTRO TO MS ACCESS(database)

    iam noone · 19問 · 1年前

    INTRO TO MS ACCESS(database)

    INTRO TO MS ACCESS(database)

    19問 • 1年前
    iam noone

    Introduction To Java Programming Language

    Introduction To Java Programming Language

    iam noone · 80問 · 1年前

    Introduction To Java Programming Language

    Introduction To Java Programming Language

    80問 • 1年前
    iam noone

    Mod 2: Comp Prog

    Mod 2: Comp Prog

    iam noone · 55問 · 1年前

    Mod 2: Comp Prog

    Mod 2: Comp Prog

    55問 • 1年前
    iam noone

    COMP PROG MIDTERM

    COMP PROG MIDTERM

    iam noone · 42問 · 1年前

    COMP PROG MIDTERM

    COMP PROG MIDTERM

    42問 • 1年前
    iam noone

    FUNDAMENTALS OF DATABASE (Lesson 1)

    FUNDAMENTALS OF DATABASE (Lesson 1)

    iam noone · 31問 · 1年前

    FUNDAMENTALS OF DATABASE (Lesson 1)

    FUNDAMENTALS OF DATABASE (Lesson 1)

    31問 • 1年前
    iam noone

    FUNDAMENTALS OF DATABASE (part2)

    FUNDAMENTALS OF DATABASE (part2)

    iam noone · 33問 · 1年前

    FUNDAMENTALS OF DATABASE (part2)

    FUNDAMENTALS OF DATABASE (part2)

    33問 • 1年前
    iam noone

    DATABASE 2-5 MOD

    DATABASE 2-5 MOD

    iam noone · 25問 · 1年前

    DATABASE 2-5 MOD

    DATABASE 2-5 MOD

    25問 • 1年前
    iam noone

    DEPTALS (COMP PROG)

    DEPTALS (COMP PROG)

    iam noone · 49問 · 1年前

    DEPTALS (COMP PROG)

    DEPTALS (COMP PROG)

    49問 • 1年前
    iam noone

    HCI HISTORY

    HCI HISTORY

    iam noone · 18問 · 11ヶ月前

    HCI HISTORY

    HCI HISTORY

    18問 • 11ヶ月前
    iam noone

    Module 1 (System Analysis)

    Module 1 (System Analysis)

    iam noone · 18問 · 12ヶ月前

    Module 1 (System Analysis)

    Module 1 (System Analysis)

    18問 • 12ヶ月前
    iam noone

    Module 1 (Data Analytics)

    Module 1 (Data Analytics)

    iam noone · 35問 · 12ヶ月前

    Module 1 (Data Analytics)

    Module 1 (Data Analytics)

    35問 • 12ヶ月前
    iam noone

    Module 2(Data Analytics)

    Module 2(Data Analytics)

    iam noone · 35問 · 11ヶ月前

    Module 2(Data Analytics)

    Module 2(Data Analytics)

    35問 • 11ヶ月前
    iam noone

    Module 1 (Networking)

    Module 1 (Networking)

    iam noone · 25問 · 12ヶ月前

    Module 1 (Networking)

    Module 1 (Networking)

    25問 • 12ヶ月前
    iam noone

    Module 1 (Info Assurance)

    Module 1 (Info Assurance)

    iam noone · 22問 · 12ヶ月前

    Module 1 (Info Assurance)

    Module 1 (Info Assurance)

    22問 • 12ヶ月前
    iam noone

    mod 1 IT LIVING

    mod 1 IT LIVING

    iam noone · 61問 · 11ヶ月前

    mod 1 IT LIVING

    mod 1 IT LIVING

    61問 • 11ヶ月前
    iam noone

    問題一覧

  • 1

    is a container which can hold a fix number of items and these items should be of the same type.

    Array

  • 2

    Each item stored in an array is called

    Element

  • 3

    Each location of an element in an array has a numerical _____, which is used to identify the element.

    Index

  • 4

    Basic Operations of array are:

    Traverse Insertion Deletion Search Update

  • 5

    Basic Operations : Array print all the array elements one by one.

    Traverse

  • 6

    Adds an element at the given index.

    Insertion

  • 7

    In Python, we can treat lists as arrays. However, we cannot constrain the type of elements stored in a list.

    True

  • 8

    is a linear data structure that “follows the principle of Last In First Out (LIFO)”. This means the last element inserted inside the _____ is removed first.

    Stack

  • 9

    You can think of the stack data structure as the pile of plates on top of another.

    True

  • 10

    In programming terms, putting an item on top of the stack is called push And Removing an item is called pop.

    true

  • 11

    Add an element to the top of a stack

    Push

  • 12

    Remove an element from the top of a stack

    Pop

  • 13

    Check if the stack is empty

    IsEmpty

  • 14

    Get the value of the top element without removing it

    Peek

  • 15

    is used to keep track of the top element in the stack.

    A pointer called TOP

  • 16

    When initializing the stack, we set its value to ____so that we can check if the stack is empty by comparing _______.

    -1 by comparing TOP == -1.

  • 17

    On pushing an element, we increase the value of TOP and place the new element in the position pointed to by TOP.

    True

  • 18

    On popping an element, we return the element pointed to by TOP and reduce its value.

    true

  • 19

    Before pushing, , we check if the stack is already

    full

  • 20

    Before popping, we check if the stack is already

    empty

  • 21

    is a useful data structure in programming. It is similar to the ticket outside a cinema hall, where the first person entering is the first person who gets the ticket.

    Queue

  • 22

    Queue follows the First In First Out (FIFO) rule - the item that goes in first is the item that comes out first.

    True

  • 23

    Add an element to the end of the queue

    Enqueue

  • 24

    Remove an element from the front of the queue

    Dequeue

  • 25

    Get the value of the front of the queue without removing it

    Peek

  • 26

    There are four(4) different types of queues: Simple Circular Priority Deque

    True

  • 27

    Insertion takes place at the rear and removal occurs at the front. It strictly follows the FIFO (First in First out) rule.

    Simple Queue

  • 28

    the last element points to the first element making a link.

    Circular Queue

  • 29

    The main advantage of a circular queue over a simple queue is __________. If the last position is full and the first position is empty, we can insert an element in the first position. This action is not possible in a simple queue.

    better memory utilization

  • 30

    is a special type of queue in which each element is associated with a priority and is served according to its priority. They are served according to their order in the queue.

    Priority Queue

  • 31

    insertion and removal of elements can be performed from either from the front or rear. Thus, it does not follow the FIFO (First In First Out) rule.

    Deque (Double ended queue)

  • 32

    Data elements are connected through a series of nodes. And, each node contains the data items and address to the next node.

    Linked List

  • 33

    There are three(3) different types of linked list: Singly linked list Doubly Linked list Circular linked list

    True

  • 34

    It is the most common. Each node has data and a pointer to the next node.

    Singly linked list

  • 35

    Add a pointer to the previous nod. Thus, it can go in either direction: forward or backward.

    Doubly linked list

  • 36

    Are used to define the type of value the array will hold.

    Typecode

  • 37

    Represents signed integer of size 1 byte

    b

  • 38

    Represents unsigned integer of size 1 byte

    B

  • 39

    Represents character of size 2 bytes

    u

  • 40

    Represents signed integer of size 2 bytes

    i

  • 41

    Represents unsigned integer of size 2 bytes

    l

  • 42

    Represents floating point of size 4 bytes

    f

  • 43

    Represents floating point of size 8 bytes

    g