Register

Webpage

Programming in C. Recursion.
Filter

Most viewed questions in Programming and DS

6 votes
2 answers
2372
Test by Bikram | Data Structures | Test 2 | Question: 20
A sorting technique is called to sort a list of $100$ integers that have been read from a file. If all $100$ values are zero, what would be the execution requirement(in terms of Big -O) if the sort used was selection sort ? $O(N)$ $O(\log N)$ $O(N^2)$ $O(1)$
A sorting technique is called to sort a list of $100$ integers that have been read from a file. If all $100$ values are zero, what would be the execution requirement(in t...
User Avatar
1 votes
1 answer
2373
Time Complexity
What is the time complexity of quick sort when (i) Choosing median of sorted array as pivot.
What is the time complexity of quick sort when (i) Choosing median of sorted array as pivot.
User Avatar
6 votes
2 answers
2375
MadeEasy Test Series: Programming & DS - Heap
The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________.
The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________.
User Avatar
1 votes
1 answer
2376
Which of the following in correct
Assume that there are two lower triangular matrices A and B of size n*n. If matrix A and transpose of B are fit into a rectangular matrix C of size n*(n+1), then a) B[i,j]=C[i,j+1] b)B[i,j]=C[j+1,i] c)B[i,j]=C[j, i+1]
Assume that there are two lower triangular matrices A and B of size n*n. If matrix A and transpose of B are fit into a rectangular matrix C of size n*(n+1), thena) B[i,j]...
User Avatar
1 votes
1 answer
2378
Constant Pointer
Please tell me about all the variations of these above types of questions that can be asked?
Please tell me about all the variations of these above types of questions that can be asked?
User Avatar
1 votes
1 answer
2379
MadeEasy Subject Test: Programming & DS - Heap
The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________.
The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________.
User Avatar
0 votes
1 answer
2380
tree traversal
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
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
User Avatar
1 votes
1 answer
2382
google
main() { int a; scanf("%i"&a); printf("%i %d",a,a); scanf("%d",&a); printf("%i %d",a,a); } suppose user entered 0101 as input .what is printed by above program?
main(){int a;scanf("%i"&a);printf("%i %d",a,a);scanf("%d",&a);printf("%i %d",a,a);}suppose user entered 0101 as input .what is printed by above program?
User Avatar
2 votes
1 answer
2383
explain the output
main( ) { char ch = 200 ; printf ( "\n%d", ch ) ; }
main( ){char ch = 200 ;printf ( "\n%d", ch ) ;}
User Avatar
2 votes
2 answers
2384
what will be the output?
#include<stdio.h> #include<stdlib.h> int main() { struct xx { int x; char s; }; struct xx *t; t->x=5; t->s='a'; printf("%d %c\n", t->x, t->s); }
#include<stdio.h #include<stdlib.h int main() { struct xx { int x; char s; }; struct xx *t; t->x=5; t->s='a'; printf("%d %c\n", t->x, t->s); }
User Avatar
3 votes
1 answer
2385
const pointer
The output of below code is_______________. int main() { int i = 120; int *a = &i; foo(&a); printf("%d ", *a); printf("%d ", *a); } void foo(int **const a) { int j = 210; *a = &j; printf("%d ", **a); }
The output of below code is_______________. int main() { int i = 120; int *a = &i; foo(&a); printf("%d ", *a); printf("%d ", *a); } void foo(int const a) { int j = 210; ...
User Avatar
0 votes
2 answers
2386
How to represent int a=7 in little endian architecture computer.
I saw on http://www.cquestions.com/2009/06/memory-representation-of-int-data-type.html but it seems wrong to me. Please clarify.
I saw on http://www.cquestions.com/2009/06/memory-representation-of-int-data-type.html but it seems wrong to me. Please clarify.
User Avatar
0 votes
2 answers
2389
Made Easy Subject Test 2019: Programming & DS
void PrintValue(int n) { if (n < 0) return; else { printf(n); printValue(--n); printValue(n--); printf(n); } } Output for Print(5) ?
void PrintValue(int n) { if (n < 0) return; else { printf(n); printValue( n); printValue(n ); printf(n); } }Output for Print(5) ?
User Avatar
0 votes
0 answers
2390
Self Doubt
Leaf Nodes =[ Internal nodes with degree 2 ] + 1 It is valid if we consider Tree as undirected graph ? Or is it valid only for Tree when considered as directed graph
Leaf Nodes =[ Internal nodes with degree 2 ] + 1It is valid if we consider Tree as undirected graph ?Or is it valid only for Tree when considered as directed graph
User Avatar
Page: