Mock Feb

Question 1

What is the constant graph with big O notation?

Answer 1

• O(C)
• Example y=3
• Used for identifying odd or even

Question 2

What is the logarithmic graph with big O notation?

Answer 2

• O(log_2(n))
• y = log(x)
• Binary Search

Question 3

What is the linear graph with big O notation?

Answer 3

• O(n)
• y = 3x
• Linear Search

Question 4

What is the Linear Logarithmic big O notation?

Answer 4

• O(nlog(n))
• Used for merge sort

Question 5

What is the graph for polynomial with big notation?

Answer 5

• O(n^2)
• y=x^3
• USed for bubble sort

Question 6

What is the exponential graph?

Answer 6

• O(2^n)
• y=3^x
• Recursively calculating fibonacci numbers

Question 7

What is LIFO?

Answer 7

• Last in first out
• Last item you push is the first item that you pop
• Used in Stacks

Question 8

What is FIFO?

Answer 8

• FIrst in first out
• Popped in the front
• Pushed from the back

Question 9

What is a stack?

Answer 9

• A way of storing objects
• Uses a single pointer which keeps moving to point to the current item
• Pushing an item onto a full stack will cause stack overflow
• Poppng an item in an empty stack will cause stack underflow

Question 10

What are strong data structure?

Answer 10

• Standard types
• Basus for other types
• Fixed allocated amount of memory when defined
• Interger,character,strong

Question 11

Whats the advantages of a static data structure?

Answer 11

• Fixed memoery allocation - easy to add and remove items
• Easier to program - no checks on data structure size at any point

Question 12

What are the disadvantages of static data structures?

Answer 12

• Unefficient as memoery has been set aside regardless of weather its needed or not whilst the program is executing

Question 13

What are dynamic data structures?

Answer 13

• Memoery allocated as the program executes
• Used when the amount of items in a list is unkown
• Requires a maximum size avoiding memory collisions

Question 14

What are the disadvatages of dynamic data structure?

Answer 14

• Overflow and underflow possible due to dynamic memory allocation
• Harder to program as software needs to keep track of its size and data item locations

Question 15

What the advantage of dynamic data structures?

Answer 15

• Most efficient use of memory as only whats needed is used

Question 16

What is heap?

Answer 16

• Pool of memory to allocate variables during execution of programs
• Makes dynamic variables possible due to changes in variable size during execition
• Allows for efficient use of memory with data of unkown chanigng size

Question 17

What is memory leakage?

Answer 17

• Program assigns memory to variable but doesnt reassign back to heap once finished
• Repeating until memory runs out and crsh occurs

Question 18

What is a garbage collector?

Answer 18

• Common in modern programming langages
• Checks memory assigned to dynamic variables and checks if they are completed
• And automatically free the memory