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
Recent questions in Programming and DS
2
votes
1
answer
4561
c program
#include<stdio.h> #include<stdlib.h> int main() { int p=9; printf("%d %d",p++,++p); } how it executed and also how printf function executed left to right or right to left?
#include<stdio.h #include<stdlib.h int main() { int p=9; printf("%d %d",p++,++p); } how it executed and also how printf function executed left to right or right to left?
Registered user 7
541
views
Registered user 7
asked
Aug 19, 2016
Programming in C
programming-in-c
undefined-behaviour
non-gate
+
–
2
votes
1
answer
4562
Cormen page 155
The children's subtrees each have size at most 2n/3 - the worst case occurs when the last row of the tree is exactly half full Plz explain this so i get a picture in my head
The children's subtrees each have size at most 2n/3 - the worst case occurs when the last row of the tree is exactly half fullPlz explain this so i get a picture in my he...
Shivangi Verma
668
views
Shivangi Verma
asked
Aug 19, 2016
DS
data-structures
tree
cormen
descriptive
+
–
1
votes
1
answer
4563
C Program
#include<stdio.h> #define CUBE(x) (x*x*x) int main() { int a, b=3; a = CUBE(b++); printf("%d, %d ", a, b); return 0; } Why this give 27,6 as output?
#include<stdio.h #define CUBE(x) (x*x*x) int main() { int a, b=3; a = CUBE(b++); printf("%d, %d ", a, b); return 0; }Why this give 27,6 as output?
komal07
1.1k
views
komal07
asked
Aug 18, 2016
Programming in C
programming-in-c
undefined-behaviour
non-gate
+
–
6
votes
4
answers
4564
C Program
#include<stdio.h> int main() { char *s[] = { "knowledge","is","power"}; char **p; p = s; printf("%s ", ++*p); printf("%s ", *p++); printf("%s ", ++*p); return 0; }
#include<stdio.h int main() { char *s[] = { "knowledge","is","power"}; char p; p = s; printf("%s ", ++*p); printf("%s ", *p++); printf("%s ", ++*p); return 0; }
srestha
3.7k
views
srestha
asked
Aug 17, 2016
Programming in C
programming-in-c
+
–
1
votes
1
answer
4565
#clanguage
What is output of the program?? And why??
What is output of the program?? And why??
papesh
484
views
papesh
asked
Aug 16, 2016
1
votes
0
answers
4566
#Static member variables
Pick the wrong statement about static member cariable in a class written in C++: Only one copy of static data members is created and all objects of the class will share that variable. Memory for static variable is allocated when you declare ... exists before any object of its class is created . All static variables are initialized to zero. All statements are correct
Pick the wrong statement about static member cariable in a class written in C++:Only one copy of static data members is created and all objects of the class will share th...
sh!va
513
views
sh!va
asked
Aug 16, 2016
Programming in C
cpp
+
–
3
votes
2
answers
4567
UGC NET CSE | June 2016 | Part 2 | Question: 24
Which of the following is not an inherent application of stack? Implementation of recursion Evaluation of a postfix expression Job scheduling Reverse a string
Which of the following is not an inherent application of stack?Implementation of recursionEvaluation of a postfix expressionJob schedulingReverse a string
go_editor
3.7k
views
go_editor
asked
Aug 16, 2016
DS
ugcnetcse-june2016-paper2
data-structures
stack
+
–
3
votes
3
answers
4568
UGC NET CSE | June 2016 | Part 2 | Question: 23
Suppose you are given a binary tree with n nodes, such that each node has exactly eiter zero or two children. The maximum height of the tree will be $\frac{n}{2}-1$ $\frac{n}{2}+1$ $(n-1)/2$ $(n+1)/2$
Suppose you are given a binary tree with n nodes, such that each node has exactly eiter zero or two children. The maximum height of the tree will be$\frac{n}{2}-1$$\frac{...
go_editor
14.2k
views
go_editor
asked
Aug 16, 2016
DS
ugcnetcse-june2016-paper2
data-structures
tree
+
–
4
votes
1
answer
4569
UGC NET CSE | June 2016 | Part 2 | Question: 22
Consider the following operations performed on a stack of size 5: Push (a); Pop(); Push(b); Push(c); Pop(); Push(d); Pop(); Pop(); Push(e) Which of the following statements is correct? Underflow occurs Stack operations are performed smoothly Overflow occurs None of the above
Consider the following operations performed on a stack of size 5:Push (a); Pop(); Push(b); Push(c); Pop();Push(d); Pop(); Pop(); Push(e)Which of the following statements ...
go_editor
4.9k
views
go_editor
asked
Aug 16, 2016
DS
ugcnetcse-june2016-paper2
data-structures
stack
easy
+
–
1
votes
0
answers
4570
Structure
Point out the error in the program? #include<stdio.h> int main() { struct emp { char name[20]; float sal; }; struct emp e[10]; int i; for(i=0; i<=9; i++) scanf("%s %f", e[i].name, &e[i].sal); return 0; } [A]. Error: invalid structure member [B]. Error: Floating point formats not linked [C]. No error [D]. None of above
Point out the error in the program?#include<stdio.h int main() { struct emp { char name[20]; float sal; }; struct emp e[10]; int i; for(i=0; i<=9; i++) scanf("%s %f", e[i...
komal07
566
views
komal07
asked
Aug 16, 2016
6
votes
3
answers
4571
#clanguage
int i; i=5; i=i++; printf("%d",i); What is output of this program?? Is it undefined behavior ?? Why??
int i; i=5; i=i++; printf("%d",i);What is output of this program??Is it undefined behavior ?? Why??
papesh
584
views
papesh
asked
Aug 15, 2016
1
votes
1
answer
4572
what is the o/p of the program?
int main() { char *p = "Good"; char a[] = "Good"; printf("%d\t%d\t%s\n", sizeof(p), sizeof(*p)); } According to me ans shld be 2,1 but on running o/p is 8,1. How 8 is the o/p please explain?
int main() { char *p = "Good"; char a[] = "Good"; printf("%d\t%d\t%s\n", sizeof(p), sizeof(*p)); }According to me ans shld be 2,1but on running o/p is 8,1. How 8 is the o...
anonymous
522
views
anonymous
asked
Aug 14, 2016
3
votes
1
answer
4573
Program1
const int perplexed = 2; #define perplexed 3 main() { #ifdef perplexed #undef perplexed #define perplexed 4 #endif printf("%d",perplexed); } a. 0 b. 2 c. 4 d. none of the above
const int perplexed = 2; #define perplexed 3 main() { #ifdef perplexed #undef perplexed #define perplexed 4 #endif printf("%d",perplexed); }a. 0 b. 2 c. 4 d. none of the...
srestha
1.0k
views
srestha
asked
Aug 14, 2016
Programming in C
programming-in-c
+
–
3
votes
1
answer
4574
UGC NET CSE | June 2016 | Part 2 | Question: 15
What is the value returned by the function f given below when n=100? let f(int n) { if (n==0) then return n; else return n+f(n-2); } 2550 2556 5220 5520
What is the value returned by the function f given below when n=100?let f(int n) { if (n==0) then return n; else return n+f(n-2); }2550255652205520
go_editor
3.4k
views
go_editor
asked
Aug 14, 2016
Programming in C
ugcnetcse-june2016-paper2
programming
+
–
4
votes
2
answers
4575
UGC NET CSE | June 2016 | Part 2 | Question: 11
Given i=0, j=1, k=-1, x=0.5, y=0.0, what is the output of the following expression in C language? x*y<i+j $\mid \mid$k -1 0 1 2
Given i=0, j=1, k=-1, x=0.5, y=0.0, what is the output of the following expression in C language?x*y<i+j $\mid \mid$k-1012
go_editor
3.8k
views
go_editor
asked
Aug 14, 2016
Programming in C
ugcnetcse-june2016-paper2
programming-in-c
+
–
7
votes
1
answer
4576
UGC NET CSE | June 2016 | Part 2 | Question: 5
A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in a graph shown below? 2 4 5 6
A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in a graph shown below?2456...
go_editor
5.4k
views
go_editor
asked
Aug 14, 2016
DS
ugcnetcse-june2016-paper2
data-structures
graph-theory
+
–
3
votes
2
answers
4577
UGC NET CSE | June 2016 | Part 2 | Question: 2
The number of different spanning trees in complete graph, $K_4$ and bipartite graph, $K_{2,2}$ have ____ and ___ respectively. 14, 14 16, 14 16, 4 14, 4
The number of different spanning trees in complete graph, $K_4$ and bipartite graph, $K_{2,2}$ have ____ and ___ respectively.14, 1416, 1416, 414, 4
go_editor
5.5k
views
go_editor
asked
Aug 14, 2016
DS
ugcnetcse-june2016-paper2
data-structures
graph-theory
+
–
1
votes
2
answers
4578
UGC NET CSE | December 2011 | Part 2 | Question: 6
A hash table has space for $75$ records, then the probability of collision before the table is $6$% full. $.25$ $.20$ $.35$ $.30$
A hash table has space for $75$ records, then the probability of collision before the table is $6$% full.$.25$$.20$ $.35$$.30$
makhdoom ghaya
3.6k
views
makhdoom ghaya
asked
Aug 13, 2016
DS
ugcnetcse-dec2011-paper2
data-structures
hashing
+
–
1
votes
2
answers
4579
madeeasy
Pankaj kumar
772
views
Pankaj kumar
asked
Aug 13, 2016
3
votes
3
answers
4580
UGC NET CSE | December 2011 | Part 2 | Question: 1
Which of the following data structure is Non-linear type ? Strings Lists Stacks None of the above
Which of the following data structure is Non-linear type ?StringsListsStacksNone of the above
makhdoom ghaya
9.4k
views
makhdoom ghaya
asked
Aug 12, 2016
DS
ugcnetcse-dec2011-paper2
data-structures
+
–
Page:
« prev
1
...
224
225
226
227
228
229
230
231
232
233
234
...
310
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register