DSA

Question 1

What’s big O notation

Answer 1

It is a way of analyzing the run time (amount of time taken for the algorithm to execute) as the input size grows.
(how the run time grows)

Question 2

What is O(1)?

Answer 2

Time doesn’t change based on input. Most efficient.

Question 3

What is a data structure?

Answer 3

A component used to store and organize data in a computer so that it can be used and stored efficiently.

Question 4

What is integer overflow?

Answer 4

An integer overflow is a type of an arithmetic overflow error when the result of an integer operation does not fit within the allocated memory space. Instead of an error in the program, it usually causes the result to be unexpected.

Question 5

What is the complexity of binary search? why?

Answer 5

O(logn). The input size decreases, as the steps increases. Array cut in half.

Question 6

What is a brute force algorithm? Give examples.

Answer 6

Finds all possible solutions to find a satisfactory solution for a given problem. Eg - linear search,

Question 7

What is a divide and conquer algorithm?

Answer 7

recursively breaks down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly.

Question 8

What condition should be met to do binary search?

Answer 8

Array must be sorted