Home / MCQ Bank / Computer

Computer Css Properties, Css Elements, Css Functions And Tables Difficulty: Medium

What type of graph does the DFS algorithm explore in a systematic manner? What will be the lexicographical order of combinations of 2 elements each formed from the array arr={1,2,3}? . . . . . . . . is used for writing blocks with single replica in memory. Which of the following method add a path or paths to the list of inputs? What will be the output for the following code? #include<stdio.h> void combination(int arr[],int n,int r,int index,int aux[],int i); void print(int arr[], int n, int r) { int aux[r]; combination(arr, n, r, 0, aux, 0); } void combination(int arr[], int n, int r, int index, int aux[], int i) { if (index == r) { for (int j=0; j<r; j++) printf("%d ",aux[j]); printf(", "); return; } if (i >= n) return; aux[index] = arr[i]; combination(arr, n, r, index+1, aux, i+1); combination(arr, n, r, index, aux, i+1); } int main() { int arr[] = {1, 2,2}; int r = 2; int n = sizeof(arr)/sizeof(arr[0]); print(arr, n, r); return 0; }