Register

Webpage

Programming in C. Recursion.
Filter

Most answered questions in Programming and DS

0 votes
0 answers
4891
Stack and Queues
User Avatar
0 votes
0 answers
4892
Stack and Queues
User Avatar
0 votes
0 answers
4893
D. Ritchie Doubt
Bit fields use for padding.It generally contained integer bits(signed and unsigned). But it cannot contain addresses. Does it mean bit field cannot contain a pointer ? When integer can contain a pointer, how bit field cannot contain a pointer?Are these not contradictory?
Bit fields use for padding.It generally contained integer bits(signed and unsigned). But it cannot contain addresses. Does it mean bit field cannot contain a pointer ?Whe...
User Avatar
0 votes
0 answers
4894
C programming
Something wrong with the code or is it working fine ?
Something wrong with the code or is it working fine ?
User Avatar
1 votes
0 answers
4896
Array and Pointer
#include <stdio.h> main() { int arr[5]; printf("%p,%p\n",arr,&arr); } How do both print the same address?
#include <stdio.h>main(){ int arr[5]; printf("%p,%p\n",arr,&arr);}How do both print the same address?
User Avatar
1 votes
0 answers
4897
Hashing
Suppose we used a hash fu action H(n) to hash n distinct elements (key) into an array T of length m. What is expected number of collision, if simple uniform hashing is used.
Suppose we used a hash fu action H(n) to hash n distinct elements (key) into an array T of length m. What is expected number of collision, if simple uniform hashing is us...
User Avatar
0 votes
0 answers
4899
Programming
User Avatar
2 votes
0 answers
4900
Storage Class
Q. What is the output of following program? int main(){ register int Data =10; int *piSumData = NULL; piSumData = &Data; *piSumData = 5; printf("%d",*piSumData); } 1. Run time error 2. garbage value 3. 10 4. 5
Q. What is the output of following program?int main(){ register int Data =10; int *piSumData = NULL; piSumData = &Data; *piSumData = 5; printf("%d",*piSumData); }1. Run ...
User Avatar
2 votes
0 answers
4901
work book
Let S be a stack with operations push, pop, top, empty. What is displayed after following segment of code executes . for(i=1; i<=5; i++) s.push(i); while(!s.empty()) printf("%d", s.top()); ans with explanation
Let S be a stack with operations push, pop, top, empty. What is displayed after following segment of code executes . for(i=1; i<=5; i++) ...
User Avatar
0 votes
0 answers
4903
increment in array
What is the output of this code in c? int main(){ static int a[][2][3]={0,1,2,3,4,5,6,7,8,9,10,11,12}; int i=-1; int d; d=a[i++][++i][++i]; printf("%d",d); return 0; } how did 2 come as the answer? please explain,thanks.
What is the output of this code in c?int main(){static int a[] [3]={0,1,2,3,4,5,6,7,8,9,10,11,12};int i=-1;int d;d=a[i++][++i][++i]; printf("%d",d); return 0;} how did 2 ...
User Avatar
0 votes
0 answers
4905
Curiousity
Since in a machine we always store numbers in binary then why can't we directly print the binary number itself using any inbuilt function, why do we have to write a separate code for it every time?
Since in a machine we always store numbers in binary then why can't we directly print the binary number itself using any inbuilt function, why do we have to write a separ...
User Avatar
0 votes
0 answers
4906
Programming in c
Minimum number of temporary variables needed to swap two variables is?
Minimum number of temporary variables needed to swap two variables is?
User Avatar
0 votes
0 answers
4907
#G.S.BALUJA # DATA STRUCTURE
How many real links are required to store an sparse matrix of 10 row 10 coloumns and 15 non zero entries...??
How many real links are required to store an sparse matrix of 10 row 10 coloumns and 15 non zero entries...??
User Avatar
0 votes
0 answers
4908
Data structures
Is there any graph whose number of BFS and DFS traversals are different?If so which graph.
Is there any graph whose number of BFS and DFS traversals are different?If so which graph.
User Avatar
0 votes
0 answers
4910
data structures
A ds is reqd. For storing a set of integers such that each of the following operations can be done in O (logN) time where N is the no. Of elements in the set Deletion of smallest element Insertion of an element if it is not already present in the set
A ds is reqd. For storing a set of integers such that each of the following operations can be done in O (logN) time where N is the no. Of elements in the setDeletion of s...
User Avatar
Page: