Mastering DataStructure and Algorithms with C and C++

Question 1

what is a reference?

Answer 1

it’s just another name for the variable and it must be initialized when it’s declared

Question 2

what are the two phases of recursion?

Answer 2

1 - calling time(ascending)

2 - returning time(Descending)

Question 3

what is the difference between recursion and looping?

Answer 3

recursion has descending while loops has ascending only

Question 4

what are the types of recursion?

Answer 4

1 - Tail recursion
2 - Head recursion
3 - Tree recursion
4 - Indirect recursion
5 - Nested recursion

Question 5

what is the tail recursion?

Answer 5

the last call in the function is the recursion

Question 6

what is a head recursion?

Answer 6

the first call in the function is the recursive call

Question 7

what is the difference between linear recursion and tree recursion?

Answer 7

linear recursion calls itself only one time but tree recursion calls itself more than one time

Question 8

what is the O() for tree recursion

Answer 8

k^N for k is the number of recursion calls in the function

Question 9

what is the indirect recursion?

Answer 9

when a function calls another function recursively and the second one calls the first one like a circular call

Question 10

what is the nested recursion?

Answer 10

the function parameter is another recursive function

Question 11

what is the formula that use to access an index of single array?

Answer 11

L + i * w

l -> first address of array
i -> index
w -> size of data type

Question 12

how are the 2D array stored in memory?

Answer 12

1 - row major mapping

2 - column major mapping

Question 13

how to improve linear search?

Answer 13

it’s common if u search for one key that it will be searched for again so u can do:
1 - transposition:
each time u search for the same key u move it one step closer to the beginning of the array
2 - move to front or move to head
place the element in the first position of the element which will make it O(1)