Register

Webpage

Programming in C. Recursion.
Filter

Most viewed questions in Programming and DS

1 votes
0 answers
1741
Array
Consider X[1...n] and Y[1...n] be two arrays, each containing n numbers both of which already sorted. What is the time complexity to find the median by combining two arrays? O(n) O(log n) O(nlogn) O(loglog n)
Consider X[1...n] and Y[1...n] be two arrays, each containing n numbers both of which already sorted. What is the time complexity to find the median by combining two arra...
User Avatar
2 votes
2 answers
1743
NIELIT 2017 DEC Scientist B - Section B: 31
Consider a complete binary tree where the left and the right sub trees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is: $\Omega(\log n)$ $\Omega(n\log n)$ $\Omega(n)$ $\Omega(n^2)$
Consider a complete binary tree where the left and the right sub trees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a he...
User Avatar
2 votes
2 answers
1747
UGC NET CSE | December 2013 | Part 3 | Question: 16
Match the following with respect to the programming language $:$ ... $\text{a-ii, b-iv, c-i, d-iii}$ $\text{a-ii, b-iii, c-iv, d-i}$
Match the following with respect to the programming language $:$$\begin{array}{} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Structured language} &...
User Avatar
1 votes
1 answer
1750
What is the Output?
#include<stdio.h> int main() { int a = 10, b = 20, c = 30, d = 40; printf("%d%d%d",a, b, c); printf("%d%d%d", d); return 0; } What is the Output and when I run it I am getting some wierd answer. Please explain ?
#include<stdio.h>int main(){int a = 10, b = 20, c = 30, d = 40;printf("%d%d%d",a, b, c);printf("%d%d%d", d);return 0;}What is the Output and when I run it I am getting so...
User Avatar
2 votes
1 answer
1751
No. of Binary trees
FIve nodes labelled 1,2,3,4,5 are used to construct different binary trees. How many such binary trees can be constructed whose preorder traversal is 1,2,3,4,5 ?
FIve nodes labelled 1,2,3,4,5 are used to construct different binary trees. How many such binary trees can be constructed whose preorder traversal is 1,2,3,4,5 ?
User Avatar
1 votes
1 answer
1752
array
Consider a three dimensional array A[30][40][50], find the location of the array element A[5][6][7] , if the base address of array A is 150 and each element take 4 byte of memory.
Consider a three dimensional array A[30][40][50], find the location of the array element A[5][6][7] , if the base address of array A is 150 and each element take 4 byte...
User Avatar
0 votes
2 answers
1754
ISRO APRIL 2018
How many lines of output does the following C code produce? #include<stdio.h> main() { float sum=0.0,j=1.0,i=2.0; while (i/j > 0.001) { j=j+1; sum=sum+(i/j); printf("%f\n", sum); } } 0-9 line of output 10-19 lines of output 20-29 lines of output More than 29 lines of output
How many lines of output does the following C code produce?#include<stdio.h main() { float sum=0.0,j=1.0,i=2.0; while (i/j 0.001) { j=j+1; sum=sum+(i/j); printf("%f\n", ...
User Avatar
2 votes
1 answer
1756
Heaps
How many Binary Max-Heaps can be constructed from the elements {1,1,2,2,3,3,4,4} ?
How many Binary Max-Heaps can be constructed from the elements {1,1,2,2,3,3,4,4} ?
User Avatar
3 votes
1 answer
1759
C Recursion
User Avatar
1 votes
1 answer
1760
Self-Doubt
In a circular linked list last node points to the : $Head$ $Tail$ $First Node$
In a circular linked list last node points to the :$Head$$Tail$$First Node$
User Avatar
Page: