The position is in C language. Got call through Elitmus. First is written test-- 1. Objective 5 questions -----Compute job completion time using round robin. -----String array and char array were defined with null character in between "Zscaler \0 career", asked about the length and output after printing. -----a[2][3]={1,2,3,4,5,6} output of *(a[0]+2), ((a)+1), 1[[a]]. and 2 more questions, don't remember. Programming questions 1. Reverse the bits of a byte. Ex:- 0xD5 (1110 1001) expected output (1001 0111) -------5 marks. 2. Given a binary tree convert in to double linked list ----10 marks. Extra 5 marks for using non-recursive (convert in to double linked list with single traversal). 3. Find the minimum missing positive integer from given array. {2,3,4,-1,7,6,0} expected 1. {1,2,3,4,-1,7,9,0} expected 5. {-2,-1,0,1,2,4,5,6,11} expected 3 in O(n) complexity.

1. Find the minimum missing positive integer from given array {2,3,4,-1,7,6,0} expected 1 {1,2,3,4,-1,7,9,0} expected 5 {-2,-1,0,1,2,4,5,6,11} expected 3 in O(n) complexity.