Register

Webpage

Programming in C. Recursion.
Filter

Most answered questions in Programming and DS

0 votes
0 answers
5141
Tree data structure
How many binary trees are possible with given preorder:- ABCD And given postorder:- cdba
How many binary trees are possible with given preorder:- ABCDAnd given postorder:- cdba
User Avatar
0 votes
0 answers
5142
data structure
what is complexity 1)to convert infix to prefix 2) to convert infix to postfix 3)convert infix to prefix using stack plz someone tell?
what is complexity1)to convert infix to prefix 2) to convert infix to postfix 3)convert infix to prefix using stackplz someone tell?
User Avatar
0 votes
0 answers
5143
Timothy Williams - Programming Output
static char hello[]='hello'; printf("%s",hello); The output will be same as- puts("hello"); puts(hello); printf("%s", "hello"); puts("hello\n"); Answer is 1,2 and 3. Can anyone tell what's the problem with 4 option? It is also printing hello.
static char hello[]='hello'; printf("%s",hello);The output will be same as-puts("hello");puts(hello);printf("%s", "hello");puts("hello\n");Answer is 1,2 and 3.Can anyone ...
User Avatar
0 votes
0 answers
5145
Hashing
What is clustering effect in hashing How quadratic and pseudorandom method of hashing works What is the difference between chaining and linklist method of hashing
What is clustering effect in hashing How quadratic and pseudorandom method of hashing worksWhat is the difference between chaining and linklist method of hashing
User Avatar
0 votes
0 answers
5146
madeasy test series
The minimum size that an array may require to store a binary tree with ‘n’ nodes is _______. A log$2^{log_{2}(n+1)} -1$ B 2^{n}-1 C n + 1
The minimum size that an array may require to store a binary tree with ‘n’ nodes is _______.A log$2^{log_{2}(n+1)} -1$B 2^{n}-1C n + 1
User Avatar
0 votes
0 answers
5147
Data structure
Which of the following statement are true? 1. Computing the most frequently occurring elements in an array a(1....n) can be done in o(nlogn) time.
Which of the following statement are true?1. Computing the most frequently occurring elements in an array a(1....n) can be done in o(nlogn) time.
User Avatar
0 votes
0 answers
5148
data structtures
complexity of algorithm to interchange the nth and mth element (node) of singly link list is: a.m+n b.m if m>=n otherwise n c.m if m<=n otherwise n d.m+min(m,n) ans given c???????????how
complexity of algorithm to interchange the nth and mth element (node) of singly link list is:a.m+nb.m if m>=n otherwise nc.m if m<=n otherwise nd.m+min(m,n)ans given c?...
User Avatar
0 votes
0 answers
5149
ace test series
void fun(char **) innt main() { char *argv[]={"ab",cd","ef","gh"}; fun(argv); return 0; } voidfun(char **p) { char *t; t=(p+=sizeof(int))[-1]; pritf("%s\n",t); } output is a)cd b)gh c)ef d)ab
void fun(char )innt main(){char *argv[]={"ab",cd","ef","gh"};fun(argv);return 0;}voidfun(char p){char *t;t=(p+=sizeof(int))[-1];pritf("%s\n",t);}output isa)cdb)ghc)efd)...
User Avatar
0 votes
0 answers
5150
C prog
What is lvalue and rvalue error in c
What is lvalue and rvalue error in c
User Avatar
0 votes
0 answers
5151
self-Doudt
can null graph can be biparted graph ?
can null graph can be biparted graph ?
User Avatar
1 votes
0 answers
5153
General
#include<stdio.h> int main() { int i =6; for(int i=0;i<5;i++) { printf("%d",i); } } This code when run using C compiler gave exception redefinition of i .But with Cplus plus it ran fine and gave output.Why that difference??
#include<stdio.h>int main(){ int i =6; for(int i=0;i<5;i++){ printf("%d",i);}} This code when run using C compiler gave exception redefinition of i .But with Cplus plu...
User Avatar
4 votes
0 answers
5154
Arrays
main ( ) { static char [3] [4] = {“abcd”, “mnop”, “fghi”}; putchar (**a); }
main ( ){static char [3] [4] = {“abcd”, “mnop”, “fghi”};putchar ( a);}
User Avatar
0 votes
0 answers
5156
trees
The number of possible ordered trees with 3 nodes A, B, C is:
The number of possible ordered trees with 3 nodes A, B, C is:
User Avatar
1 votes
0 answers
5157
linked list
Let P be a single linked list.Let Q be a pointer to an intermediate node 'X' in the list.What is the worst case time complexity of best known algorithm to delete the node 'X ' from the list
Let P be a single linked list.Let Q be a pointer to an intermediate node 'X' in the list.What is the worst case time complexity of best known algorithm to delete the node...
User Avatar
0 votes
0 answers
5159
Recursion
T(n) =$\log$n + T($\sqrt{n}$) How to solve this?
T(n) =$\log$n + T($\sqrt{n}$)How to solve this?
User Avatar
Page: