Register

Webpage

Programming in C. Recursion.
Filter

Hot questions in Programming and DS

0 votes
1 answer
2781
testseries
Data structure for loop. What is oxf ? can somebody explain
Data structure for loop. What is oxf ? can somebody explain
User Avatar
3 votes
2 answers
2782
ISRO-DEC2017-57
The $in$-$order$ and $pre$-$order$ traversal of a binary tree are $\text{d b e a f c g}$ and $\text{a b d e c f g}$ respectively.The $post$-$order$ traversal of a binary tree is $\text{e d b g f c a}$ $\text{e d b f g c a }$ $\text{d e b f g c a}$ $\text{d e f g b c a}$
The $in$-$order$ and $pre$-$order$ traversal of a binary tree are $\text{d b e a f c g}$ and $\text{a b d e c f g}$ respectively.The $post$-$order$ traversal of a binary ...
User Avatar
0 votes
1 answer
2783
test series
pointers question, can someone please explain me solution
pointers question, can someone please explain me solution
User Avatar
0 votes
1 answer
2785
test series
User Avatar
1 votes
0 answers
2786
testseries
I Index of node in BST = no of nodes in left subtree +1 . Is this definition valid
IIndex of node in BST = no of nodes in left subtree +1 . Is this definition valid
User Avatar
0 votes
0 answers
2788
Output of the Program
#include<stdio.h> int fun1(int x) { x=14; } int fun2(int x) { x=20; } int main() { int(*p)(),m,n; scanf("%d",&m); if(m) p=fun1; else p=fun2; n=(*p)(); printf("%d",n); return 0; } Suppose input given 0
#include<stdio.h int fun1(int x) { x=14; } int fun2(int x) { x=20; } int main() { int(*p)(),m,n; scanf("%d",&m); if(m) p=fun1; else p=fun2; n=(*p)(); printf("%d",n); retu...
User Avatar
1 votes
1 answer
2789
gate 2018
there was a question on global counter variable what is the answer to that question???
there was a question on global counter variablewhat is the answer to that question???
User Avatar
1 votes
1 answer
2792
Linked list
In a circular single linked list how many external pointers are there because in some books there are two external pointers start pointing at first node and last pointing at last node while some given only last pointer and some have only first pointer
In a circular single linked list how many external pointers are there because in some books there are two external pointers start pointing at first node and last pointing...
User Avatar
0 votes
2 answers
2793
testseries
Time complexity circular LL i think aswer is A . this Q is similar to https://gateoverflow.in/61880/complexity but here they haven't mentioned about any pointer. here is my explanation
Time complexity circular LLi think aswer is A . this Q is similarto https://gateoverflow.in/61880/complexity but here they haven't mentioned about any pointer.here is m...
User Avatar
0 votes
0 answers
2794
C programming
User Avatar
0 votes
1 answer
2796
DFS back edge
If a directed graph G is cyclic but can be made acyclic by removing 1 edge then a DFS will encounter exactly 1 Backedge. True or false ?
If a directed graph G is cyclic but can be made acyclic by removing 1 edge then a DFS will encounter exactly 1 Backedge. True or false ?
User Avatar
0 votes
2 answers
2797
Function
swap(int c, int d) { int k,t; k=3; t=c; c=d; d=t; k=c+d+t; } main() { int k=5, l=9; swap(k,l); printf("%d,%d",k,l); } 9,5 5,9 5,19 19,5
swap(int c, int d) { int k,t; k=3; t=c; c=d; d=t; k=c+d+t; } main() { int k=5, l=9; swap(k,l); printf("%d,%d",k,l); }9,55,95,1919,5
User Avatar
0 votes
0 answers
2799
gate overflow book
User Avatar
0 votes
0 answers
2800
C programming
User Avatar
Page: