DS CA1 QUIZ

What is the time complexity of accessing the nth element on an unsorted array?

• O(n)

• O(1)

• O(log(n))

• O(n^2)

Which type of sort algorithm is this?

• Insertion
• Bubble
• Merge

What is the time complexity of this function / algorithm?

• O(n)

• Colinas debe saber !

• O(n^2)

• O(1)

• O(nlog(n))

Identify selection sort on values: {10, 6, 3, 2, 8}

• {6,10,3,2,8}, {3,6,10,2,8}, {2,3,6,8,10}

• {6,10,3,2,8}, {3,6,10,2,8}, {2,3,6,10,8}, {2,3,6,8,10}

• {2,6,3,10,8}, {2,3,6,10,8}, {2,3,6,10,8}, {2,3,6,8,10}

• {2,6,3,10,8}, {2,3,6,10,8}, {2,3,6,8,10}

How can we describe an array in the best possible way?

• The Array shows a hierarchical structure.

• Arrays are immutable (Not Modifiable)

• Container that stores the elements of similar types

• The Array is not a data structure

What is the time complexity of this function / algorithm?

• O(n)

• O(log(n))

• O(1)

• O(n^2)

• Preguntale al frances

What is the disadvantage of array data structure?

• Elements of an array can be accessed in constant time

• Elements are stored in contiguous memory location

• The amount of memory to be allocated should be known beforehand

• Multiple other data structures can be implemented using Array

which one is the example of built in data type

• Deletion

• List

• Stack

• Integers

Which of the following data structure is linear type?

• List

• Tree

• Graph

• All of the above

a collection of items stored at contiguous memory locations.

• index

• Array

• stack

• queue