Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

0 votes
1 answer
3581
Gate 2017 Set 1 minimum Comparisons
Consider an array A of size 31 consisting of 0's followed by number of 1's. In order to find the smallest index i such that A[i]=1 minimum number of comparisons required in worst case by optimal algorithm?
Consider an array A of size 31 consisting of 0's followed by number of 1's. In order to find the smallest index i such that A[i]=1 minimum number of comparisons required ...
User Avatar
0 votes
0 answers
3582
pre-post increment
#include <stdio.h> int main(void) { int i,j,k,l; i=j=k=l=4; int a=(++i)*(++i)*(++i); int b = (j++)*(j++)*(j++); int c = (k++)*(++k)*(k++); int d = (l++)*(++l)*(++l); printf("%d\t%d\t%d\t%d",a,b,c,d); return 0; } Please explain the output. Thanks in advance. The output is: 252 64 125 150
#include <stdio.h>int main(void){int i,j,k,l;i=j=k=l=4;int a=(++i)*(++i)*(++i);int b = (j++)*(j++)*(j++);int c = (k++)*(++k)*(k++);int d = (l++)*(++l)*(++l);printf("%d\t%...
User Avatar
0 votes
1 answer
3587
Hashing
If h is any hashing function and is used to hash n keys into a table of size m, here n<=m, the expected number of collisions involving a particular key x is a) Less than 1 b) Less than n c) Less than m d) Less than n/2
If h is any hashing function and is used to hash n keys into a table of size m, here n<=m, the expected number of collisions involving a particular key x isa) Less than 1...
User Avatar
0 votes
3 answers
3588
Data Structure In-Order Predecessor
If a node in a BST has two children, then its in-order predecessor has a) No left child b) No right child c) 2 children d) no child
If a node in a BST has two children, then its in-order predecessor hasa) No left childb) No right childc) 2 childrend) no child
User Avatar
0 votes
2 answers
3593
Choose the correct statement about HEAP
I. A heap is always nearly complete tree. II. Worst case complexity of heapify operation is O( log n) III. Worst case complexity of build heap operation is O( n log n) a. I only b. I and II only c. II and III only d. I, II and III
I. A heap is always nearly complete tree.II. Worst case complexity of heapify operation is O( log n)III. Worst case complexity of build heap operation is O( n log n)a. I ...
User Avatar
0 votes
1 answer
3595
online quiz on khan academy
What is the asymptotic relationship between the function lgn and logn(base = 8)? options: 1.lgn = Big-oh(logn(base = 8)) 2.lgn = Omega(logn(base = 8)) 3.lgn = Theta(logn(base = 8)) 4.All
What is the asymptotic relationship between the function lgn and logn(base = 8)?options:1.lgn = Big-oh(logn(base = 8))2.lgn = Omega(logn(base = 8))3.lgn = Theta(logn(base...
User Avatar
1 votes
1 answer
3597
Programming Output
Determine the output- #include <stdio.h> int main(void) { char *p="gateoverflow"; *(p+5)='z'; printf("%s",p); return 0; }
Determine the output-#include <stdio.h int main(void) { char *p="gateoverflow"; *(p+5)='z'; printf("%s",p); return 0; }
User Avatar
0 votes
1 answer
3599
madeeasy
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 of collisions occurred while mapping the given sequence is ______.
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...
User Avatar
1 votes
1 answer
3600
Space complexity
Which of the following algorithm have the smallest memory requirement i.e Low space complexity including data space and run time stack for recursive calls. A)insertion sort B)quick sort C)merge sort D)selection sort
Which of the following algorithm have the smallest memory requirement i.e Low space complexity including data space and run time stack for recursive calls.A)insertion sor...
User Avatar
Page: