Recent questions in Programming and DS

0 votes
2 answers
1741
i am getting 4,3,4,3,8,2 is it right?????
1 votes
1 answer
1743
Entries in a stack are "ordered". What is the meaning of this statement?
2 votes
1 answer
1744
Preorder is same as :a) depth-first order b) breadth-first searchc) topological order d) linear order
1 votes
1 answer
1746
0 votes
1 answer
1747
What is the Output of Following Program Snippet ?#include <stdio.h struct Key{ int X; char P; };int main(){ struct Key Values[] = {10,'A',20,'B',3...
0 votes
0 answers
1748
What is the value of p and q at the end?#include<stdio.h>int main(){ int n=1024; int p=0,q=0; int i,j; for( i = 1;i<=n;i=2*i) p=p+5; for(j = 1;j<=p;...
1 votes
2 answers
1749
13. What does the error "Null Pointer Assignment" mean and what causes this error?
0 votes
1 answer
1750
6. Would the following program compile?main( ) { int a = 10, *j; void *k; j = k = &a; j++ ; k++; printf ("\n %u %u", j, k ) ; }Please explain above program with some exam...
1 votes
1 answer
1751
(5) Would the following program give a compilation error or warning?main() { float i = 10, *j; void *k; k=&i; j= k; printf("\n%f", *j); }
0 votes
1 answer
1752
Can a binary tree or BST can be constructed with dynamic programming? Can it be constructed through greedy method?Plz give some algorithm and explain
0 votes
0 answers
1755
0 votes
1 answer
1757
According to me Option D.Because it should be an error because *("INDIA" + 2 ) = 'D' and we are doing 'D' = 'I' which is not valid so Error ???But answer is C
0 votes
2 answers
1759
how does AVL tree requires o(logn) for all the operation i.e search insert and deletewhile other tree (bst,binary) requires o(n) is it due to balancing factor that avl tr...