Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

0 votes
0 answers
2462
C-programming
#include<stdio.h> int main() { int i = 4, ans; ans = ++i+ ++i + ++i; printf("%d\n", ans); return 0; } What is the output of this program ?
#include<stdio.h>int main(){ int i = 4, ans; ans = ++i+ ++i + ++i; printf("%d\n", ans); return 0;}What is the output of this program ?
User Avatar
0 votes
1 answer
2463
OUTPUT OF PROGRAM
User Avatar
1 votes
1 answer
2464
Programming Output question
User Avatar
1 votes
1 answer
2465
ace test
The number of ways we can insert 11, 12, 13, 14, 15, 16, 17 in empty binary search tree such that resulting tree has the height of 6 = ___________ [height of a tree with single node is 0.]
The number of ways we can insert 11, 12, 13, 14, 15, 16, 17 in empty binary search tree such that resulting tree has the height of 6 = ___________ [height of a tree with ...
User Avatar
0 votes
2 answers
2466
Ace Test Series: Programming & DS - Linked Lists
What is the time complexity to insert a new Node in a singly circular linked list at Starting ? (Number of nodes in list = N) A. O(1) B. O(N)
What is the time complexity to insert a new Node in a singly circular linked list at Starting ? (Number of nodes in list = N)A. O(1)B. O(N)
User Avatar
6 votes
3 answers
2471
MadeEasy Test Series: Programming & DS - Graphs
Consider the following graph: The minimum size of queue required when performing BFS on above graph is ________. (Size of queue is represented by maximum number of element at any time).
Consider the following graph:The minimum size of queue required when performing BFS on above graph is ________.(Size of queue is represented by maximum number of element ...
User Avatar
0 votes
2 answers
2473
Output
User Avatar
0 votes
0 answers
2474
Output
User Avatar
0 votes
1 answer
2476
practice_question
User Avatar
2 votes
1 answer
2477
Min #Stack operations
Let's consider we have a stack with three operations defined on it:: Push,Pop, Peek We have to print "ABCACBA" using the above operations. Give the min no of operations for doing it and also specify the operations in order.
Let's consider we have a stack with three operations defined on it:: Push,Pop, PeekWe have to print "ABCACBA" using the above operations.Give the min no of operations for...
User Avatar
0 votes
0 answers
2478
solve : reflexive relation
R = { (x,y) ∈ z X z : x-y is even integer } is this reflexive how to prove and what this set is representing , z= set of integers
R = { (x,y) ∈ z X z : x-y is even integer } is this reflexive how to prove and what this set is representing , z= set of integers
User Avatar
0 votes
0 answers
2480
Pointer doubt
a and &a are the same thing where a is array name? I am unable to understand diff between (a+1) and (&a+1) when assigned to a pointer #include <stdio.h> int main() { int a[5] = {1,2,3,4,5}; int *ptr = (int*)(&a+1); printf("%d %d", *(a+1), *(ptr-1)); return 0; }
a and &a are the same thing where a is array name? I am unable to understand diff between (a+1) and (&a+1) when assigned to a pointer #include <stdio.h>int main(){ in...
User Avatar
Page: