What is the alternative name given to the rail fence cipher?

Transposition ciphers are created by:

Find the pivot element from the given input using the median-of-three partitioning method.

Input: 8, 1, 4, 9, 6, 3, 5, 2, 7, 0

The priority queue operations involved in Dijkstra's Algorithm

In a linked list implementation of a queue, which pointer(s) will change during an insertion into a non-empty queue?

The difference between a linear array and a record is:

Consider the following pseudo code, where x and y are positive integers.

begin q := 0 r := x while r >= y do begin r := r – y q := q + 1 end end

The post condition that needs to be satisfied after the program terminates is

What is the output of the following C code?

int c = 0;
void my_function(char *s, int i)
{
    if(s[i] == '\0')
       return;
    if(s[i] == 'a' || s[i] == 'e' || s[i] == 'i' || s[i] == 'o' || s[i] == 'u')
    c++;
    my_function(s,i+1);
}
int main()
{
    my_function("thisisrecursion",0);
    printf("%d",c);
    return 0;
}

Which of the following is Bezout's Identity?

A single array A[1..MAXSIZE] is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables top1 and top2 (topl< top 2) point to the location of the topmost element in each of the stacks. If the space is to be used efficiently, the condition for “stack full” is