Register

Webpage

Programming in C. Recursion.
Filter

Most viewed questions in Programming and DS

1 votes
1 answer
4921
Array, Memory Allocation
In what cases does an uninitialized array have values = 0 and for which cases does it have values = garbage values. How to differentiate?
In what cases does an uninitialized array have values = 0 and for which cases does it have values = garbage values. How to differentiate?
User Avatar
–1 votes
1 answer
4922
ME Test series
When searching for a key value 50 in a BST, nodes containing key values 10,30,40,70,90,120.150.175 are traversed in any order . The number of different orders possible in which these key values can occur in search path from the root to the value containing 50 are ________
When searching for a key value 50 in a BST, nodes containing key values 10,30,40,70,90,120.150.175 are traversed in any order . The number of different orders possible in...
User Avatar
0 votes
2 answers
4923
ibps2014
the run time for traversing all the nodes of a binary search tree with n nodes and printing them in an order is 1. o (n log n) 2. o (n) 3. o(sqrt(n)) 4. o (log n)
the run time for traversing all the nodes of a binary search tree with n nodes and printing them in an order is1. o (n log n)2. o (n)3. o(sqrt(n))4. o (log n)
User Avatar
2 votes
1 answer
4924
Programming
#include<stdio.h> int main() { int i, j, k; i = 5; j = ++i; i = j--; k = (i+j)++; printf("%d",k); } What will be the output of the above program? (A) 11 (B) 12 (C) Compilation error (D) None of the above
#include<stdio.h int main() { int i, j, k; i = 5; j = ++i; i = j ; k = (i+j)++; printf("%d",k); }What will be the output of the above program?(A) 11(B) 12(C) Compilation ...
User Avatar
1 votes
2 answers
4925
DRDO CSE 2022 Paper 1 | Question: 28
If the maximum height of a binary tree is $\mathrm{N},$ then how many number of nodes will there be?
If the maximum height of a binary tree is $\mathrm{N},$ then how many number of nodes will there be?
User Avatar
0 votes
0 answers
4926
#c programming
#include <stdio.h> int cou=0; int cal(int a,int b){ int c; cou++; if(b==3) return(a*a*a); else{ c=cal(a,b/3); return(c*c*c); } } int main() { int d= cal(4,81); printf("%d",d); return 0; }
#include <stdio.h>int cou=0;int cal(int a,int b){ int c; cou++; if(b==3) return(a*a*a); else{ c=cal(a,b/3); return(c*c*c); }}int ma...
User Avatar
0 votes
0 answers
4927
C programming
User Avatar
0 votes
1 answer
4929
Paramater passing in C
Do C supports Call by reference parameter passing technique ?
Do C supports Call by reference parameter passing technique ?
User Avatar
0 votes
1 answer
4930
program
What will be the output of the following program assuming that parameter passing is call by value procedure P{a, b, c}; begin a:=b:=3; b:b+1; c: a+a end; begin main P(a+b, a, a); Print(a) end.
What will be the output of the following program assuming that parameter passing iscall by valueprocedure P{a, b, c}; begin a:=b:=3; b:b+1; c: a+a end; begin main P(a+b, ...
User Avatar
0 votes
0 answers
4931
Why is the output 6723 and not 7632 ?
#include<stdio.h> int r(){ static int num=9; return num--; } int main() { for(r();r();r()) { printf("%d%d",r(),r()); }; return 0; } Why is the output 6723 and not 7632?
#include<stdio.h>int r(){ static int num=9;return num ;}int main() { for(r();r();r()) {printf("%d%d",r(),r());};return 0;}Why is the output 6723 and not 7632?
User Avatar
0 votes
0 answers
4932
#heap
What is the time taken to delete min element from max heap with and without using heapify?
What is the time taken to delete min element from max heap with and without using heapify?
User Avatar
0 votes
1 answer
4933
Doubt
Consider a stack is used to evaluate fully parenthesized arithmetic expression from left to right. Each opperand is placed on the stack and operators operate on top two elements of the stack. The minimum size of stack required to evaluate given expression is ________.
Consider a stack is used to evaluate fully parenthesized arithmetic expression from left to right. Each opperand is placed on the stack and operators operate on top two e...
User Avatar
0 votes
1 answer
4934
Programming
What is the output of the following program? int main ( ) { char *str = “Gate2015” printf (“%d”, gradeup (str)) ; return 0; } int gradeup (char *P1) { char *P2 = P1 ; while (*++P1) ; return (P1 – P2); } How P1 points to null and P2 to starting based on that they gave answer as 8
What is the output of the following program? int main ( ) { char *str = “Gate2015” printf (“%d”, gradeup (str)) ; return 0; } int gradeup (char *P1) { char *P2 = ...
User Avatar
1 votes
0 answers
4935
General
#include<stdio.h> int main() { int i =6; for(int i=0;i<5;i++) { printf("%d",i); } } This code when run using C compiler gave exception redefinition of i .But with Cplus plus it ran fine and gave output.Why that difference??
#include<stdio.h>int main(){ int i =6; for(int i=0;i<5;i++){ printf("%d",i);}} This code when run using C compiler gave exception redefinition of i .But with Cplus plu...
User Avatar
2 votes
0 answers
4936
C programming
How can we print these alphabets using simple c program? A BC CDEF DEFGHIJ EFGHIJKLMNO
How can we print these alphabets using simple c program? ABCCDEFDEFGHIJEFGHIJKLMNO
User Avatar
0 votes
1 answer
4937
c Programming
what is the difference between a null pointer , a NULL macro ,the ASCII NUL Character and null string?
what is the difference between a null pointer , a NULL macro ,the ASCII NUL Character and null string?
User Avatar
2 votes
1 answer
4938
Test by Bikram | Data Structures | Test 2 | Question: 15
Elements $1,2,3,4,5$ are inserted in a stack in sequence. The elements are printed while popping them out. Which of the following is a wrong print sequence? $3 \ 5 \ 4 \ 2 \ 1$ $1 \ 3 \ 2 \ 4 \ 5$ $5 \ 4 \ 3 \ 2 \ 1$ $2 \ 4 \ 1 \ 5 \ 3$
Elements $1,2,3,4,5$ are inserted in a stack in sequence. The elements are printed while popping them out. Which of the following is a wrong print sequence?$3 \ 5 \ 4 \ 2...
User Avatar
1 votes
1 answer
4940
GATE Overflow Test Series | Data Structures | Test 1 | Question: 4
The data structures most suitable to do an inorder and level order traversals of a binary tree respectively are Stack and Queue Queue and Stack Stack and Stack Queue and Queue
The data structures most suitable to do an inorder and level order traversals of a binary tree respectively areStack and QueueQueue and StackStack and StackQueue and Queu...
User Avatar
Page: