Recent activity by HanuamntappaBudihal

1 answer
1
#include<stdio.h int main() { int M = 2; int arr[M][M] = {0}; // Trying to initialize all values as 0 int i, j; for (i = 0; i < M; i++) { for (j = 0; j < M; j++) ...
2 answers
3
void main() { int i=6; for( i; i; i ) { printf(“%d”,i); } }
3 answers
4
#include <stdio.h>int arr[] = { 10, 20, 30, 40, 50 };static int count ;inc() {return ++count;}int main(){arr[count++]=inc();printf("%d ", arr[count]);printf("%d ", arr[0]...
1 answer
5
3 answers
6
4 answers
9
A sorting technique that guarantees that records with same primary key in the same order in the sorted list as in the original unsorted list is said to be....
4 answers
10
Find output #include<stdio.h void main() { int i=0; for(; i++ ; printf("%d",i)); printf("%d",i); }Plz explain ?
2 answers
11
1 answer
12
when is it possible in binary search tree that (preorder,inorder) ,(postorder,inorder),and (preorder,postorder) are equal.please explain AND what about binary tree
3 answers
13
The number of divisors of $6000$, where $1$ and $6000$ are also considered as divisors of $6000$ is$40$$50$$60$$30$