Sandip University Interview Questions and Answers

Recursion examples include factorial calculation, Fibonacci sequence, binary search, tree traversal, and maze solving.

• Factorial calculation: n! = n * (n-1)!, base case: 0! = 1

• Fibonacci sequence: F(n) = F(n-1) + F(n-2), base cases: F(0) = 0, F(1) = 1

• Binary search: Divide array in half, recursively search in one half based on comparison

• Tree traversal: Inorder, preorder, postorder traversal of binary tree

• Maze solving: Rec...read more

malloc is used to allocate memory without initializing it, while calloc is used to allocate memory and initialize it to zero.

• malloc allocates a block of memory of specified size, while calloc allocates a block of memory for an array of elements and initializes them to zero

• malloc does not initialize the allocated memory, while calloc initializes the allocated memory to zero

• malloc takes one argument (size of memory to al...read more