Static Arrays

Question 1

What are the 2 most common operations on any data structure?

Answer 1

Reading and Writing

Reading data
Writing data

Question 2

What are the 3 most common operations of an array?

Answer 2

Reading, Deletion, Insertion

Question 3

What is a static array?

Answer 3

Static array is a fixed sized array

Question 4

True or False: Is a static array not fixed in size?

Answer 4

False

Static array is a fixed sized array

It’s not possible to add another element on a static array because of how RAM works

Question 5

True or False: Is a static array fixed in size?

Answer 5

True

Static array is a fixed sized array

Question 6

True or False: Is it possible to add another element on a static array?

Answer 6

False

It’s not possible to add another element on a static array because of ho

Static array is a fixed sized array

Question 7

True or False: Is not possible to add another element on a static array?

Answer 7

True

Static array is a fixed sized array

Question 8

What is the biggest limitation of static array?

Answer 8

Static array is a fixed size array.
It means it’s not possible to change its size, unlike on dynamic array

Question 9

True or False: Is the biggest limitation of static array is its fixed size nature?

Answer 9

True

Static array is a fixed size array.
It means it’s not possible to change its size, unlike on dynamic array

Question 10

True or False: Is the biggest limitation of static array is its readability?

Answer 10

False

Its biggest limitation is its fixed in size

It’s possible to read each element of a static array as long as the indices (plural for index) are known
Static array is a fixed size array.
It means it’s not possible to change its size, unlike on dynamic array

Question 11

What is the time complexity of reading a value of an element of static array if the right index is provided

Answer 11

O(1)

Constant time

In Big O, there are six major types of complexities (time and space):

Constant: O(1)
Linear time: O(n)
Logarithmic time: O(n log n)
Quadratic time: O(n^2)
Exponential time: O(2^n)
Factorial time: O(n!)

Question 12

What is the time complexity of writing a value of an element of static array if the right index is provided

Answer 12

O(1)

Constant time

In Big O, there are six major types of complexities (time and space):

Constant: O(1)
Linear time: O(n)
Logarithmic time: O(n log n)
Quadratic time: O(n^2)
Exponential time: O(2^n)
Factorial time: O(n!)

Question 13

True or False: O(1) is the time complexity of writing a value of an element of static array if the right index is provided

Answer 13

True

O(1) or Big O of 1 is the time complexity

In Big O, there are six major types of complexities (time and space):

Constant: O(1)
Linear time: O(n)
Logarithmic time: O(n log n)
Quadratic time: O(n^2)
Exponential time: O(2^n)
Factorial time: O(n!)

Question 14

True or False: O(n) is the time complexity of reading a value of an element of static array if the right index is provided

Answer 14

False

Big O of n or O(n) is the time complexity

O(n) represents linear time != O(1) represents constant time
In Big O, there are six major types of complexities (time and space):

Constant: O(1)
Linear time: O(n)
Logarithmic time: O(n log n)
Quadratic time: O(n^2)
Exponential time: O(2^n)
Factorial time: O(n!)

Question 15

True or False: O(1) is the time complexity of reading a value of an element of static array if the right index is provided

Answer 15

True

O(1) or Big O of 1 is the time complexity

In Big O, there are six major types of complexities (time and space):

Constant: O(1)
Linear time: O(n)
Logarithmic time: O(n log n)
Quadratic time: O(n^2)
Exponential time: O(2^n)
Factorial time: O(n!)

Question 16

True or False: O(n log n) is the time complexity of writing a value of an element of static array if the right index is provided

Answer 16

False

Big O of n log n or O(n log n) is the time complexity

O(n log n) represents logarithmic time != O(1) represents constant time
In Big O, there are six major types of complexities (time and space):

Constant: O(1)
Linear time: O(n)
Logarithmic time: O(n log n)
Quadratic time: O(n^2)
Exponential time: O(2^n)
Factorial time: O(n!)

Question 17

How does deletion of an element of an array work on memory?

Answer 17

The element of an array is actually not being deleted but instead its being overwritten by an arbitrary value

Question 18

True or False: Can you actually delete an element of an array

Answer 18

False

The element of an array is actually not being deleted but instead its being overwritten by an arbitrary value

Question 19

True or False: It’s not possible to actually delete an element of an array

Answer 19

True

The element of an array is actually not being deleted but instead its being overwritten by an arbitrary value