Hot questions in Programming and DS

0 votes
1 answer
4381
0 votes
1 answer
4383
4 votes
2 answers
4384
6 votes
1 answer
4386
letm=(i++&&j++&&k++) || l++;printf(i,j,k,l,m)//i=-1 j=-1 k=-1 l=2output:0 0 0 2 1//i=-1 j=-1 k=0 m=2output:0 0 1 3 1//i=0 j=2 k=3 l=2ouput:1 2 3 3 1
0 votes
1 answer
4387
Given the input sequence {11, 33, 43, 99, 34, 79, 19} and hash table of size 10 with the hash function h(k) = k mod 10. If hash table uses quadratic probing, the number o...
2 votes
0 answers
4388
how to solve this please explain procedure...
3 votes
1 answer
4389
#include <stdio.h char *str[]={"FirstSring","Is","Already","Written"}; char strp[]={str+3,str+2,str+1,str}; char *strpp=strp; int main(void) { printf("%s", ++strpp); pr...
0 votes
0 answers
4390
Doubt: dequeue really deletes the element or just moves the pointer? I'm not getting the answer.
0 votes
1 answer
4391
0 votes
1 answer
4392
0 votes
3 answers
4393
2 votes
1 answer
4394
1 votes
0 answers
4395
here SJF is given as well as priorities are given, given answer followes only priority schedulingbut i think priority is used in case where there is a tie between two pro...
0 votes
1 answer
4396
4 votes
1 answer
4397
A complete binary tree with the property that the value at each node is at least as large as the values at its children is known asbinary search treeAVL treecompletely ba...
0 votes
1 answer
4399
char *p;*p='a' ;I know this will give compiler error but can anyone explain what is the actual bug in this and how to rectify it??