Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

0 votes
1 answer
5262
Code for stack push
A stack is implemented as an array Stack of size N. TOS points to the current top of the stack . The initial value of TOS is -1. The code for push operation for a value in stack is given. fill EMPTY BOX 1 and EMPTY BOX 2 if( EMPTY BOX 1) Stack[EMPTY BOX 2] = value;
A stack is implemented as an array Stack of size N. TOS points to the current top of the stack . The initial value of TOS is -1. The code for push operation for a value i...
User Avatar
0 votes
2 answers
5264
Pointers
Now I suppose if i have a statement like *P++ then it is broken down as first (P++) and then *p (because both are unary operator and associtivity is right to left ) and if we have statement like a=*p++ then it is broken down into a=*p and then p is incremented !! Am i right ?
Now I suppose if i have a statement like *P++ then it is broken down as first (P++) and then *p (because both are unary operator and associtivity is right to left ) and ...
User Avatar
0 votes
1 answer
5265
what is the size of stack we need in tail recursion ???
User Avatar
1 votes
2 answers
5266
simple uniform hashing
why in open address hash table with load factor α=n/m<1, the expected number of probes in an unsuccessful search is at most 1/(1-α) assuming uniform hashing ?
why in open address hash table with load factor α=n/m<1, the expected number of probes in an unsuccessful search is at most 1/(1-α) assuming uniform hashing ?
User Avatar
0 votes
1 answer
5267
simple uniform hashing
why in a hash table in which collisions are resolved by a chaining , a successful search takes average- case time ⊖(1+load factor) ,under the assumption of simple uniform hashing ?
why in a hash table in which collisions are resolved by a chaining , a successful search takes average- case time ⊖(1+load factor) ,under the assumption of simple unifo...
User Avatar
0 votes
2 answers
5268
please provide proper explanation..!
what is the output of pro..?? #ifndef include<stdio.h> void main() { #endif printf("%d",900*90/90); }
what is the output of pro..??#ifndef include<stdio.h>void main(){#endifprintf("%d",900*90/90);}
User Avatar
2 votes
2 answers
5269
hashing
In a separate chaining hash table with load factor =0.8, what is the average length of a list ? a) 0.8 b) 1.0 c) 1.25 d) there is not enough information e) there is enough information, but none of the above are correct
In a separate chaining hash table with load factor =0.8, what is the average length of a list ?a) 0.8 b) 1.0 c) 1.25d) there is not enough informatione) there is enough i...
User Avatar
2 votes
2 answers
5270
linear probing
How are elements deleted in linear probing ? (a) Deletion is not allowed (b) they are changed to zero (c) they are marked deleted (d) unchecked deallocation (e) None of the above
How are elements deleted in linear probing ?(a) Deletion is not allowed(b) they are changed to zero(c) they are marked deleted(d) unchecked deallocation(e) None of the ab...
User Avatar
0 votes
1 answer
5271
Is it correct?
void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); push(s, i); } }
void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); push(s, i); } }
User Avatar
1 votes
2 answers
5272
C-programming
On running this code I am getting illegal initialization ..please explain... Also in following link ans is given as d)....(Q-9) http://gpl4you.com/viewquestype.php?type=3&company=VIRTUSA
On running this code I am getting illegal initialization ..please explain...Also in following link ans is given as d)....(Q-9)http://gpl4you.com/viewquestype.php?type=3&c...
User Avatar
0 votes
1 answer
5273
Given a string,in which anything except digits are treated as separators
Given a string,in which anything except digits are treated as separators, and between each set of separators,there is some substring. count number of separators and substrings and return it with only 1 return statement
Given a string,in which anything except digits are treated as separators, and between each set of separators,there is some substring. count number of separators and subst...
User Avatar
0 votes
1 answer
5274
pint= (int*)p; what is use of this statement.
User Avatar
3 votes
2 answers
5277
c programming
What will be output of following program? #include<stdio.h> int main(){ int a = 320; char *ptr; ptr =( char *)&a; printf("%d ",*ptr); return 0; } (A) 2 (B) 320 (C) 64 (D) Compilation error (E) None of above
What will be output of following program?#include<stdio.h>int main(){ int a = 320; char *ptr; ptr =( char *)&a; printf("%d ",*ptr); return 0;}(A) 2(B) 320(C) 64...
User Avatar
0 votes
2 answers
5278
Give an algorithm to finding duplicate parenthesis in a expression ?
suppose expression is like : ((a+b)+((c+d))), so how to find duplicate parenthesis in the given expression ?
suppose expression is like : ((a+b)+((c+d))), so how to find duplicate parenthesis in the given expression ?
User Avatar
0 votes
1 answer
5279
Optimal binary search tree
Given the following table of data what are the minimum expected no.of comparisons required for an Optimal i 0 1 2 3 4 Pi 3/16 3/16 1/16 1/16 Qi 2/16 3/16 1/16 1/16 1/16 BST that can be constructed with the given data
Given the following table of data what are the minimum expected no.of comparisons required for an Optimali01234Pi 3/163/161/161/16Qi2/163/161/161/161/16BST that can be co...
User Avatar
Page: