Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage
Programming in C.
Recursion.
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Hot questions in Programming and DS
2
votes
2
answers
2611
Pointers
Consider the declaration below: typedef char *Str_typed; #define Str_defined char* Str_typed s1, s2; Str_defined s3, s4; Which one of the following statements is correct? I. $s1$, $s2$, $s3$ and $s4$ are character pointers II. $s1$, $s2$, $s3$ and $s4$ are characters III. $s1$, $s2$, $s3$ are character pointers while $s4$ is a character IV. None of the above
Consider the declaration below:typedef char *Str_typed; #define Str_defined char* Str_typed s1, s2; Str_defined s3, s4;Which one of the following statements is correct?I....
Junaed Siddiquee
549
views
Junaed Siddiquee
asked
Mar 23, 2018
Programming in C
pointers
+
–
0
votes
0
answers
2612
Inversions
Is it always the case that in an unsorted array using comparison based sorting algorithm the minimum number of comparison required to convert it into sorted array is Equal to number of Inversions present in the Array. Am i saying the statement right ?
Is it always the case that in an unsorted array using comparison based sorting algorithm the minimum number of comparison required to convert it into sorted array is Equa...
Na462
855
views
Na462
asked
Apr 26, 2018
Programming in C
inversion
algorithms
+
–
0
votes
1
answer
2613
Binary Tree
How to generate post order array from given in order array [8,6,9,4,7,2,5] ?
How to generate post order array from given in order array [8,6,9,4,7,2,5] ?
raman.pndy
454
views
raman.pndy
asked
May 14, 2018
Programming in C
binary-tree
data-structures
+
–
4
votes
3
answers
2614
C PROGRAMMING
#include<stdio.h> int main() { int a = 12; void *ptr = (int *)&a; printf("%d", *ptr); getchar(); return 0; } A 12 B Compiler Error C Runt Time Error D 0
#include<stdio.h int main() { int a = 12; void *ptr = (int *)&a; printf("%d", *ptr); getchar(); return 0; }A12BCompiler ErrorCRunt Time ErrorD0
RISHI GUPTA 1
769
views
RISHI GUPTA 1
asked
Apr 1, 2018
1
votes
3
answers
2615
GATE 2018
Maximum no of min spanning trees,.... taking a value of x I answered 2 Is it correct?
Maximum no of min spanning trees,.... taking a value of xI answered 2 Is it correct?
manish sharma 2
1.5k
views
manish sharma 2
asked
Feb 4, 2018
3
votes
0
answers
2616
MultiSubject (CO, DIgital, DS)
A 4-bit modulo-16 ripple counter uses JK flip-flops. If the propagation delay of each FF is 100 ns, the maximum clock frequency that can be used is equal to: Ans 2.5MHz. I think it should be $\frac{1}{16*10^{-7}} = 0.625MHz$ ... minimum number of comparisons that will be needed in the worst case by the optimal algorithm for doing this is Ans = 840 I am getting 860.
A 4-bit modulo-16 ripple counter uses JK flip-flops. If the propagation delay of each FF is 100 ns,the maximum clock frequency that can be used is equal to:Ans 2.5MHz.I t...
Shubhanshu
1.6k
views
Shubhanshu
asked
Jan 25, 2018
Programming in C
data-structures
co-and-architecture
binary-tree
digital-logic
ripple-counter-operation
merge-sort
+
–
0
votes
0
answers
2617
C (strlen)
In this question the length of a given string is given as 12 in the solution but it should be 11 as strlen function exclude null value and give the length.Please give the correct answer to this question?
In this question the length of a given string is given as 12 in the solution but it should be 11 as strlen function exclude null value and give the length.Please give the...
saumya mishra
500
views
saumya mishra
asked
May 19, 2018
3
votes
2
answers
2618
Binary Tree
How many numbers of binary tree can be created with 4 nodes which when traversed in post order gives the sequence D, C, B, A? 1. 14 2. 15 3. 10 4. 16 Please Explain. Is there any formula?
How many numbers of binary tree can be created with 4 nodes which when traversed in post order gives the sequence D, C, B, A?1. 142. 153. 104. 16Please Explain.Is there a...
nishant279
3.6k
views
nishant279
asked
Sep 16, 2017
DS
data-structures
binary-tree
+
–
0
votes
1
answer
2619
SAnfoundary
What data structure would you most likely see in a non-recursive implementation of a recursive algorithm? Linked List Stack Queue Tree please explain also
What data structure would you most likely see in a non-recursive implementation of a recursive algorithm?Linked ListStack QueueTreeplease explain also
Moin Mukhtar
1.1k
views
Moin Mukhtar
asked
Mar 23, 2018
Programming in C
data-structures
recursion
+
–
3
votes
2
answers
2620
c program doubt
#include <stdio.h> #define MULTIPLY(a, b) a*b int main() { printf("%d", MULTIPLY(2+3, 3+5)); return 0; }
#include <stdio.h>#define MULTIPLY(a, b) a*bint main(){ printf("%d", MULTIPLY(2+3, 3+5)); return 0;}
Surya Dhanraj
3.8k
views
Surya Dhanraj
asked
Sep 3, 2017
1
votes
1
answer
2621
queue
The initial configuration of queue is a, b, c, d. ‘a’ is at the front. To get the configuration d, c, b, a how many deletions and additions required: (A) 2 deletions, 3 additions (B) 3 deletions, 2 additions (C) 3 deletions, 4 additions (D) 3 deletions, 3 additions
The initial configuration of queue is a, b, c, d. ‘a’ is at the front. To get the configuration d, c, b, a how many deletions and additions required:(A) 2 deletions, ...
akankshadewangan24
6.7k
views
akankshadewangan24
asked
Jun 27, 2017
Programming in C
queue
+
–
1
votes
2
answers
2622
UGC NET CSE | June 2010 | Part 2 | Question: 25
In a $B$ tree of order $5$, the following keys are inserted as follows : $7, 8, 1, 4, 13, 20, 2, 6$ and $5$ How many elements are present in the root of the tree ? $1$ $2$ $3$ $4$
In a $B$ tree of order $5$, the following keys are inserted as follows : $7, 8, 1, 4, 13, 20, 2, 6$ and $5$ How many elements are present in the root of the tree ?$1$ $2$...
makhdoom ghaya
4.6k
views
makhdoom ghaya
asked
Sep 15, 2016
DS
ugcnetcse-june2010-paper2
data-structures
b-and-bplus-trees
+
–
0
votes
0
answers
2623
IIT interview
In case of dynamic scoping, will an undeclared variable 'a' take the value of previous function's variable even if the variable 'a' in prev function is declared as static?
In case of dynamic scoping, will an undeclared variable 'a' take the value of previous function's variable even if the variable 'a' in prev function is declared as static...
Brijeshbajpai
248
views
Brijeshbajpai
asked
May 20, 2018
Programming in C
interview
+
–
6
votes
3
answers
2624
doubt
Please explain how to solve this.
Please explain how to solve this.
Arnabi
533
views
Arnabi
asked
Dec 13, 2016
DS
array
+
–
6
votes
2
answers
2625
GATE Overflow | Programming | Test 1 | Question: 8
What is the output of this program? #include <stdio.h> int main() { char *ptr; char string[] = "Hello 2017"; ptr = string; ptr += 4; printf("%s",++ptr); } Hello 2017 ello 2017 2017 o 2017
What is the output of this program?#include <stdio.h int main() { char *ptr; char string[] = "Hello 2017"; ptr = string; ptr += 4; printf("%s",++ptr); }Hello 2017ello 201...
Arjun
630
views
Arjun
asked
Oct 18, 2016
Programming in C
go-programming-1
programming
programming-in-c
pointers
+
–
0
votes
2
answers
2626
c programming
#include<stdio.h> main() { static int a=1; ++a; printf("%d",a); if(a<=3) main(); printf("%d",a); } output: $234444$ i m not getting how extra two 4 is coming?
#include<stdio.h main() { static int a=1; ++a; printf("%d",a); if(a<=3) main(); printf("%d",a); }output: $234444$i m not getting how extra two 4 is coming?
Siddharth Bhardawaj
462
views
Siddharth Bhardawaj
asked
Apr 30, 2018
Programming in C
programming-in-c
+
–
5
votes
2
answers
2627
wooe test
In what order we should insert the following elements into an empty AVL tree so that we don’t have to perform any rotation on it. 1, 2, 3, 4, 5, 6, 7 A. 4, 2, 1, 6, 3, 5, 7 B. 4, 2, 6, 1, 3, 5, 7 C. 6, 4, 5, 7, 1, 2, 3 D. 4, 5, 3, 2, 1, 6, 7
In what order we should insert the following elements into an empty AVL tree so that we don’t have to perform any rotation on it. ...
pankaj_vir
923
views
pankaj_vir
asked
Mar 10, 2018
DS
avl-tree
+
–
0
votes
1
answer
2628
C Programming Assignment Operator
Q)What is the output of the following program segment #include<stdio.h> int main() { char a = 7 ; a ^ = 5 ; printf( "%d", printf( "%d", a + = 3 ) ) ; return 0; } A) 5 B) 6 C) 51 D) 15
Q)What is the output of the following program segment#include<stdio.h>int main(){char a = 7 ; a ^ = 5 ;printf( "%d", printf( "%d", a + = 3 ) ) ;return 0;} A) 5 B...
Lakshman Bhaiya
624
views
Lakshman Bhaiya
asked
Apr 22, 2018
Programming in C
programming-in-c
+
–
0
votes
1
answer
2629
Finding Min and Max keys
The minimum and maximum number of keys in the internal nodes of B-r with order 4 is: (a) 1, 3 (b) 2, 4 (c) 1, 4 (d) 2, 3
The minimum and maximum number of keys in the internal nodes of B-r with order 4 is:(a) 1, 3(b) 2, 4(c) 1, 4(d) 2, 3
Shumile
306
views
Shumile
asked
May 16, 2018
Programming in C
algorithms
+
–
1
votes
3
answers
2630
Algorithm-ME
A mean -heap having 1024 elements with the key ranging from 0 to 1023 ,stored in array of 1024 indices the maxmimum difference between keys of all elements that can be stored at (n/2) th index of the array is ___________
A mean -heap having 1024 elements with the key ranging from 0 to 1023 ,stored in array of 1024 indices the maxmimum difference between keys of all elements that can be st...
Aboveallplayer
646
views
Aboveallplayer
asked
Dec 4, 2016
DS
data-structures
binary-heap
numerical-answers
made-easy-test-series
+
–
Page:
« prev
1
...
126
127
128
129
130
131
132
133
134
135
136
...
309
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register