Register

Webpage

Programming in C. Recursion.
Filter

Highest voted questions in Programming and DS

1 votes
1 answer
2481
output
main() { int a=2; if(a==2) { a=~a+2<<1; printf("%d",a); } else { break; } a)-3 b)-2 c)1 d)compile error
main(){int a=2;if(a==2){a=~a+2<<1;printf("%d",a);}else{break;}a)-3b)-2c)1d)compile error
User Avatar
1 votes
1 answer
2482
computer programing book arihant
i=0; j=--i ; printf( i++ + --i + i-- + j-- + --i + i); the output??
i=0;j= i ;printf( i++ + i + i + j + i + i);the output??
User Avatar
1 votes
0 answers
2483
#doubt
Q1. How many Binary Tree possible with n nodes ? Q2. How many Ordered Binary Tree possible with n nodes ? Q3. How may BinarySearch Tree possible with n nodes ?
Q1. How many Binary Tree possible with n nodes ?Q2. How many Ordered Binary Tree possible with n nodes ?Q3. How may BinarySearch Tree possible with n nodes ?
User Avatar
1 votes
0 answers
2484
Gate 2004
User Avatar
1 votes
1 answer
2485
Complexity
What is the time complexity of adding an element at the front of a circular linked list ? O(n) or theta(n) ? How to find whether it is O or theta ?
What is the time complexity of adding an element at the front of a circular linked list ?O(n) or theta(n) ? How to find whether it is O or theta ?
User Avatar
1 votes
2 answers
2486
Programming and DS ::- BST deletion
What is the time complexity to delete the root node in right skew tree? I knew the three cases of BST deletion:- 0 child,one child,two child. But how can we handle this particular question
What is the time complexity to delete the root node in right skew tree?I knew the three cases of BST deletion:- 0 child,one child,two child.But how can we handle this par...
User Avatar
1 votes
1 answer
2488
Programming
#include<stdio.h> int main() { Float x=0.5; if(x==0.5) Printf("if"); else if(x==0.5f) Printf("else if"); } Explain the code line by line .
#include<stdio.h>int main(){ Float x=0.5;if(x==0.5)Printf("if");else if(x==0.5f)Printf("else if");}Explain the code line by line .
User Avatar
1 votes
1 answer
2489
Programming in c
#include<stdio.h> int main() { Float x=0.1; Printf("%d%d%d",sizeof(x),sizeof(0.1),sizeof(0.1f));
#include<stdio.h>int main(){Float x=0.1;Printf("%d%d%d",sizeof(x),sizeof(0.1),sizeof(0.1f));
User Avatar
1 votes
0 answers
2490
Trees
No. Of possible ordered trees with 3 nodes A,B,C is: a.16 b.12 c.6 d.10
No. Of possible ordered trees with 3 nodes A,B,C is:a.16 b.12c.6d.10
User Avatar
1 votes
1 answer
2491
GATE | GATE MOCK 2017
Consider an array consisting of –ve and +ve numbers. What would be the worst time comparisons an algorithm can take in order to segregate the numbers having same sign altogether i.e all +ve on one side and then all -ve on the other ? (A) N-1 (B) N (C) N+1 (D) (N*(N-1))/2
Consider an array consisting of –ve and +ve numbers. What would be the worst time comparisons an algorithm can take in order to segregate the numbers having same sign a...
User Avatar
1 votes
0 answers
2492
Madeeasy test series
int fun (unsigned int n) { int c=0; while(n!=0) { if(n&01) c++; n>>=1; } return c; } output of the code?? Can someone provide any link on how to solve this kind of question?
int fun (unsigned int n){int c=0;while(n!=0){if(n&01) c++;n>>=1;}return c;}output of the code??Can someone provide any link on how to solve this kind of question?
User Avatar
1 votes
1 answer
2493
data structure
what is the average number of probes in linear probing if load factor is 0.1
what is the average number of probes in linear probing if load factor is 0.1
User Avatar
1 votes
1 answer
2494
data structure
what is compressed adjacency list
what is compressed adjacency list
User Avatar
1 votes
1 answer
2496
Dennis Ritchie book
Verify that the expression getchar() !=EOF is 0 or 1 . here , we can take input of any character and print its Getchar value , is that what we have to do? since at the machine level every charater will be stored at a stream of 0's and 1's .. and also , can we print EOF value also?
Verify that the expression getchar() !=EOF is 0 or 1 . here , we can take input of any character and print its Getchar value , is that what we have to do?since at the ma...
User Avatar
1 votes
1 answer
2497
m array tree
A 3-ary tree is a tree in Which every internal node has exactly three children. Now if the tree has n internal nodes then what will be the number of leaves________??
A 3-ary tree is a tree in Which every internal node has exactly three children. Now if the tree has n internal nodes then what will be the number of leaves________??
User Avatar
1 votes
2 answers
2499
Depth first Search
What should be the answer?? Key is given as opttion B. . !! I was getting D) None
What should be the answer?? Key is given as opttion B. . !! I was getting D) None
User Avatar
1 votes
1 answer
2500
Recursive foreign key
Explain recursive foreign key with suitable example..
Explain recursive foreign key with suitable example..
User Avatar
Page: