Register

Webpage

Programming in C. Recursion.
Filter

Most viewed questions in Programming and DS

2 votes
1 answer
2203
Applied Test Series
The time required to determine the minimum element from the max heap of size O(log(n)) is given by
The time required to determine the minimum element from the max heap of size O(log(n)) is given by
User Avatar
1 votes
1 answer
2204
Zeal Test Series 2019: Programming & DS - Programming In C
The value of z after the execution of the following program is void f(int x) { staticint z; z=z+x; } int main() { int y=10; fork(); fork(); f(y); return 0; } 1.30 2.20 3.40 4. 10
The value of z after the execution of the following program isvoid f(int x) {staticint z;z=z+x;}int main() {int y=10;fork();fork();f(y);return 0;}1.30 2.20 3.40 4. 10
User Avatar
4 votes
1 answer
2205
c programming
What is the output of the program #include<stdio.h> #include<conio.h> void main() { int i,j=20; clrscr(); for(i=1;i<3;i++) { printf("%d,",i); continue; printf("%d",j); break; } getch(); } //A. 1,20 // B. 1,20,1,20 // c. 1,2 // D. 1,2,20,20
What is the output of the program#include<stdio.h>#include<conio.h>void main() {int i,j=20;clrscr();for(i=1;i<3;i++){ printf("%d,",i);continue;printf("%d",j);break;}getch...
User Avatar
1 votes
2 answers
2206
GATE Overflow | Data Structures | Test 1 | Question: 10
With 5 distinct nodes, the maximum no. of binary trees that can be formed is _____
With 5 distinct nodes, the maximum no. of binary trees that can be formed is _____
User Avatar
0 votes
0 answers
2207
data structtures
complexity of algorithm to interchange the nth and mth element (node) of singly link list is: a.m+n b.m if m>=n otherwise n c.m if m<=n otherwise n d.m+min(m,n) ans given c???????????how
complexity of algorithm to interchange the nth and mth element (node) of singly link list is:a.m+nb.m if m>=n otherwise nc.m if m<=n otherwise nd.m+min(m,n)ans given c?...
User Avatar
3 votes
4 answers
2208
GATE Overflow | Data Structures | Test 1 | Question: 8
What is the number of binary trees with $4$ nodes which when traversed in pre-order gives the sequence A, B, C, D?
What is the number of binary trees with $4$ nodes which when traversed in pre-order gives the sequence A, B, C, D?
User Avatar
1 votes
0 answers
2209
Hashing
Keys 9,19,29,39,49,59,69 are inserted into a hash table containing entries from 0 to 9 using hash function H=kmod10 and quadratic probing is used for collision resolution. What is the index into which 59 will be inserted? a)3 b)6 c)8 d)5
Keys 9,19,29,39,49,59,69 are inserted into a hash table containing entries from 0 to 9 using hash function H=kmod10 and quadratic probing is used for collision resolution...
User Avatar
0 votes
0 answers
2211
Hashing Question
Why 4 is multiplied in part. In the solution.
Why 4 is multiplied in part. In the solution.
User Avatar
0 votes
0 answers
2212
Function Pointer question
#include<stdio.h> int main ( ) { int demo ( ); // What is this and what does it do? demo ( ); (*demo) ( ); } int demo ( ) { printf("Morning"); }
#include<stdio.h>int main ( ){ int demo ( ); // What is this and what does it do? demo ( ); (*demo) ( );}int demo ( ){ printf("Morning");}
User Avatar
1 votes
1 answer
2213
Yashavant kanetkar understanding pointer in C, Chepter 1, Question 5.
(5) Would the following program give a compilation error or warning? main() { float i = 10, *j; void *k; k=&i; j= k; printf("\n%f", *j); }
(5) Would the following program give a compilation error or warning?main() { float i = 10, *j; void *k; k=&i; j= k; printf("\n%f", *j); }
User Avatar
4 votes
1 answer
2214
AVL Tree
What are we suppose to take? LR - 2 rotations. RL- 2 rotations. OR LR - 1 rotation. RL- 1 rotation. Kindly Solve and Verify the Total Numbers of Rotations Performed.
What are we suppose to take?LR - 2 rotations.RL- 2 rotations.ORLR - 1 rotation.RL- 1 rotation.Kindly Solve and Verify the Total Numbers of Rotations Performed.
User Avatar
0 votes
1 answer
2215
introduction to algorithm 6.2.3 exercise question
$6.2-3$ What is the effect of calling MAX-HEAPIFY(A,i) when the element A[i] is larger that its children?
$6.2-3$What is the effect of calling MAX-HEAPIFY(A,i) when the element A[i] is larger that its children?
User Avatar
0 votes
2 answers
2216
DRDO 2008
What is the maximum possible height of an AVL tree with 20 nodes?
What is the maximum possible height of an AVL tree with 20 nodes?
User Avatar
3 votes
2 answers
2218
Data Structure
Assume that there are two lower triangular matrices P and Q of size $m\times m$.If matrix P and transpose of Q are fit into rectangular matrix R of size $m\times\left ( m+1 \right )$ then (A) R[i,j+1]=Q[i,j] (B) R[j,i+1]=Q[i,j] (C) R[j+1,i]=Q[i,j] (D)None of above
Assume that there are two lower triangular matrices P and Q of size $m\times m$.If matrix P and transpose of Q are fit into rectangular matrix R of size $m\times\left ( m...
User Avatar
1 votes
2 answers
2219
Programming and DS ::- BST deletion
What is the time complexity to delete the root node in right skew tree? I knew the three cases of BST deletion:- 0 child,one child,two child. But how can we handle this particular question
What is the time complexity to delete the root node in right skew tree?I knew the three cases of BST deletion:- 0 child,one child,two child.But how can we handle this par...
User Avatar
2 votes
2 answers
2220
UGC NET CSE | June 2009 | Part 2 | Question: 28
A binary tree is said to have heap property if the elements along any path : from leaf to root are non-increasing from leaf to root are non-decreasing from root to leaf are non-decreasing from root to leaf are non-increasing
A binary tree is said to have heap property if the elements along any path :from leaf to root are non-increasing from leaf to root are non-decreasing from root to l...
User Avatar
Page: