23.
Which of the following ciphered text would have used transposition cipher for encryption of the plain text "DATASTRUCTURE"?

25.
In the not recently used algorithm, which page is to be replaced when the new page comes in?

26.
What is the space complexity of the following recursive implementation to find the factorial of a number?
int fact(int n)
{
     if(_________)
        return 1;
     return n * fact(n - 1);
}
int main()
{
      int n = 5;
      int ans = fact(n);
      printf("%d",ans);
      return 0;
}

29.
What is the output of the following code?
#include<stdio.h>
int recursive_search_num(int *arr, int num, int idx, int len)
{
     if(idx == len)
     return -1;
     if(arr[idx] == num)
       return idx;
     return recursive_search_num(arr, num, idx+1, len);
}
int main()
{
      int arr[8] ={1,2,3,3,3,5,6,7},num=5,len = 8;
      int indx = recursive_search_num(arr,num,0,len);
      printf("Index of %d is %d",num,indx);
      return 0;
}

30.
Which of the following is are two types of traditional cipher?