gpt-3.5-turbo-0301· OpenAI
WildChat-4.8M (AI2)
Data Structure and algorithm assignment Say true or false write me the answer 1. Data…
- User
Data Structure and algorithm assignment Say true or false write me the answer
- Data structure helps to manage and organize data.
- Algorithm is sequence of computational steps to solve a problem.
- Algorithm cannot change structure of data.
- Sorting is the process of finding particular element of an array.
- Array size is dynamic which can easily grow or reduced at run time.
- Stack data structure follows first in first out (FIFO) principle.
- Assistant
- True
- True
- False
- False
- False
- False
- User
Data Structure and algorithm course Say true or false and write me the answer in front of the question
- Data structure helps to manage and organize data.
- Algorithm is sequence of computational steps to solve a problem.
- Algorithm cannot change structure of data.
- Sorting is the process of finding particular element of an array.
- Array size is dynamic which can easily grow or reduced at run time.
- Stack data structure follows first in first out (FIFO) principle.
- Assistant
- True
- True
- False
- False
- False
- False
- User
choice the best answer and write the answer "
- which of the following is primitive data types
a. array b. linked list c. integer d. none
- which of the following is not properties of algorithm
a. Finiteness b. Language independent c. Correctness d. Ambiguity
- Identify bubble sort run time order.
a. O(n¬¬¬¬2) b. O(n) c. O(1) d. None
- Linear search running time is
a. O(1) b. O(n) c. O(2n) d. O(n2)
- which of the following is sorting algorithm
a. linear b. binary c. bubble d. A and C
- 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)
- Asymptotic notation used to measure best case is
a. Big- omega b. Big Theta c. Big-O d. None
- 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
- Queue operation that remove item from front size is known as
a. Pop b. Enqueue c. Pop d. None
- stack operation that insert item into stack is known as
a. push b. enqueue c. dequeue d. pop
- Assistant
- c. integer
- d. Ambiguity
- a. O(n^2)
- b. O(n)
- c. Bubble
- d. O(1)
- a. Big-omega
- b. O(n^2)
- c. Pop
- a. push