Most viewed questions in Programming and DS

2 votes
5 answers
2002
A 4-ary tree,i.e. each node has either 0 or 4 children tree has 20 leaf nodes. Then the total number of nodes in the tree are ____.
1 votes
1 answer
2004
void abc(int x, int y){ pf("%d%d", x, y); } void main(){ int a; a = 12; abc(++a, a++); pf("%d", a); }14,12,1413,12,1311,12,1214,14,14
0 votes
0 answers
2005
IN THE VIA HEAP LIST WHY IT IS O(LOGN) FOR SEARCHING??
2 votes
1 answer
2007
What is the worst case running time of searching an element in balanced binary search tree of (2n)! elements
2 votes
1 answer
2008
0 votes
2 answers
2009
anyone explain this prog?? how to output is evaluvated??int main(){ int x = 10, y; y = (x++, printf("x = %d\n", x), ++x, printf("x = %d\n", x), x++); printf("y ...
3 votes
1 answer
2012
0 votes
1 answer
2013
int m= -14;int n=6;int o;o=m%++n;n+=m++ - o;m<<=(o^n)&3;assuming 2's complement arithemetic ; what should be the final value of m,n,o??
3 votes
1 answer
2014
Q)What is the output of the following C program fragment?Assume size of an integer is 4 Bytes#include<stdio.h>int main(){int i = 5;int var = sizeof( i++);printf("%d %d",i...
1 votes
2 answers
2015
How can we print this alphabetical pattern using c?ABCDE BCDE CDE DEABCD BCD CD DABC BC CAB BA
0 votes
2 answers
2016
2 votes
1 answer
2017
Consider the following C-fragment where size of int is 1 BWhich is the output of above program?
2 votes
2 answers
2018
0 votes
0 answers
2019
#include<iostream using namespace std; class abc { public: static int x; int i; abc() { i = ++x; } }; int abc::x; main() { abc m, n, p; cout<<m.x<<" "<<m.i<<endl; }Output...