Skip to content
TheChatArchiveThe Chat Archive
gpt-3.5-turbo-0301· OpenAIAi2 WildChat-4.8M (AI2)

Data Structure and algorithm assignment Say true or false write me the answer 1. Data…

  1. User

    Data Structure and algorithm assignment Say true or false write me the answer

    1. Data structure helps to manage and organize data.
    2. Algorithm is sequence of computational steps to solve a problem.
    3. Algorithm cannot change structure of data.
    4. Sorting is the process of finding particular element of an array.
    5. Array size is dynamic which can easily grow or reduced at run time.
    6. Stack data structure follows first in first out (FIFO) principle.
  2. Assistant
    1. True
    2. True
    3. False
    4. False
    5. False
    6. False
  3. User

    Data Structure and algorithm course Say true or false and write me the answer in front of the question

    1. Data structure helps to manage and organize data.
    2. Algorithm is sequence of computational steps to solve a problem.
    3. Algorithm cannot change structure of data.
    4. Sorting is the process of finding particular element of an array.
    5. Array size is dynamic which can easily grow or reduced at run time.
    6. Stack data structure follows first in first out (FIFO) principle.
  4. Assistant
    1. True
    2. True
    3. False
    4. False
    5. False
    6. False
  5. User

    choice the best answer and write the answer "

    1. which of the following is primitive data types

    a. array b. linked list c. integer d. none

    1. which of the following is not properties of algorithm

    a. Finiteness b. Language independent c. Correctness d. Ambiguity

    1. Identify bubble sort run time order.

    a. O(n¬¬¬¬2) b. O(n) c. O(1) d. None

    1. Linear search running time is

    a. O(1) b. O(n) c. O(2n) d. O(n2)

    1. which of the following is sorting algorithm

    a. linear b. binary c. bubble d. A and C

    1. Effecieny of inserting and deleting element at the begging of linked list is

    a. O(n) b. O(n2) c. O(n3) d. O(1)

    1. Asymptotic notation used to measure best case is

    a. Big- omega b. Big Theta c. Big-O d. None

    1. Big-O order of algorithm with T(n)=4n2+3n+5 run time is

    a. O(1) b. O(n2) c. O(n) d. None

    1. Queue operation that remove item from front size is known as

    a. Pop b. Enqueue c. Pop d. None

    1. stack operation that insert item into stack is known as

    a. push b. enqueue c. dequeue d. pop

  6. Assistant
    1. c. integer
    2. d. Ambiguity
    3. a. O(n^2)
    4. b. O(n)
    5. c. Bubble
    6. d. O(1)
    7. a. Big-omega
    8. b. O(n^2)
    9. c. Pop
    10. a. push