Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

0 votes
1 answer
5022
How to find the number of height balanced nodes in a tree in O(n) time ?
A node is height balanced if difference between height of left subtree and right subtree is either -1 , 0 or 1 , so how to count such nodes , without maintaining any extra field in the node except for left and right child pointers .
A node is height balanced if difference between height of left subtree and right subtree is either -1 , 0 or 1 , so how to count such nodes , without maintaining any extr...
User Avatar
0 votes
1 answer
5023
garbage collection
Why C language does not provide heap or garbage collection ?? Is there any higher level mechanism??
Why C language does not provide heap or garbage collection ?? Is there any higher level mechanism??
User Avatar
2 votes
3 answers
5024
Linked list
Why linked list not suitable for binary search?
Why linked list not suitable for binary search?
User Avatar
1 votes
1 answer
5025
Programing
Explanation pls ? void main(){ float a; a=6.7; if(a==6.7) printf("A"); else printf("B"); }
Explanation pls ? void main(){ float a; a=6.7; if(a==6.7) printf("A"); else printf("B"); }
User Avatar
0 votes
3 answers
5026
programing
int main(){ int a; a = 1; while(a-- >= 1) while(a-- >= 0); printf("%d", a); }
int main(){ int a; a = 1; while(a >= 1) while(a >= 0); printf("%d", a); }
User Avatar
0 votes
1 answer
5027
Is Infix, Pre-fix and Postfix evaluation there (in syllabus) in Stacks topic under Data Structures?
Is Infix, Pre-fix and Postfix evaluation there (in syllabus) in Stacks topic under Data Structures?
Is Infix, Pre-fix and Postfix evaluation there (in syllabus) in Stacks topic under Data Structures?
User Avatar
0 votes
3 answers
5028
what is stackoverflow?
User Avatar
0 votes
1 answer
5029
C Programming doubt
What is the difference between struct node* head= NULL and struct node* head= (struct node*)NULL ?
What is the difference between struct node* head= NULL and struct node* head= (struct node*)NULL ?
User Avatar
1 votes
3 answers
5031
C pointer doubt
What is the difference when I write in program mynode * head; add_node(&head,10); add_node( struct node ** head, into value); To this mynode *head; add_node (head,10); add_node( struct node* head, into value) Which is the correct way of writing?
What is the difference when I write in program mynode * head; add_node(&head,10); add_node( struct node head, into value);To this mynode *head; add_node (head,10); add_...
User Avatar
0 votes
2 answers
5032
about c language
what is function in c pragramming to take mod of number in c ie. |-15|=15
what is function in c pragramming to take mod of number in c ie. |-15|=15
User Avatar
0 votes
2 answers
5033
c array
Under which of the following conditions, the size of an one-dimensional array need to be specified ? a) when initialization is a part of definition b) when it is a declaration c) when it is a formal parameter or actual parameter d) none of the above
Under which of the following conditions, the size of an one-dimensional array need to be specified ?a) when initialization is a part of definitionb) when it is a declarat...
User Avatar
1 votes
1 answer
5034
Output of c program
void fun(int *p) { int q = 10; p = &q; } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; }
void fun(int *p) { int q = 10; p = &q; } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; }
User Avatar
0 votes
1 answer
5036
sparse matrix
How many real links are required to store a sparse matrix of 10 rows , 10 columns ,and 15 non zeros entries.(pick up the closest answer)
How many real links are required to store a sparse matrix of 10 rows , 10 columns ,and 15 non zeros entries.(pick up the closest answer)
User Avatar
0 votes
0 answers
5037
Hash table
Consider a hash table with 'm' slots that uses chaining for collision resolution. the table is initially empty. What is probability that after 4 keys are inserted then atleast a chain of size 3 is created? (assume simple uniform hashing is used) a. m-1 b. m-4 c. m-3(m-1) d. 3m-1
Consider a hash table with 'm' slots that uses chaining for collision resolution. the table is initially empty. What is probability that after 4 keys are inserted then at...
User Avatar
0 votes
1 answer
5038
array
User Avatar
0 votes
2 answers
5039
If we store n keys in a hash table of size m=n^2 , then what is the probability of any collision ?
The hash function is randomly chosen from a universal class of hash functions , then what is the probability of any collision ?
The hash function is randomly chosen from a universal class of hash functions , then what is the probability of any collision ?
User Avatar
0 votes
2 answers
5040
Select a data structure that you have seen previously, and discuss its strengths and limitations.
Select a data structure that you have seen previously, and discuss its strengths and limitations.
Select a data structure that you have seen previously, and discuss its strengths and limitations.
User Avatar
Page: