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
0
votes
1
answer
4381
Circular Queue
monty
726
views
monty
asked
Jan 30, 2017
DS
data-structures
circular-queue
+
–
1
votes
1
answer
4382
UGC NET CSE | December 2012 | Part 2 | Question: 45
What is the result of the following expression? (1 & 2) + (3 & 4) 1 3 2 0
What is the result of the following expression?(1 & 2) + (3 & 4)1320
go_editor
3.5k
views
go_editor
asked
Jul 11, 2016
Programming and DS
ugcnetcse-dec2012-paper2
programming-in-c
operators
+
–
0
votes
1
answer
4383
AVL trees
Arnabi
772
views
Arnabi
asked
Jan 28, 2017
Programming in C
avl-tree
data-structures
time-complexity
+
–
4
votes
2
answers
4384
DS-BST
If preorder of a BST is passed as an argument to the above function. Function returns 1 if, a)All the leaf nodes of the tree are at same level b) All the nodes of the tree have atmost 1 child c) True is a complete binary tree, where the nodes at each level are completely filled d) None of these
If preorder of a BST is passed as an argument to the above function. Function returns 1 if,a)All the leaf nodes of the tree are at same levelb) All the nodes of the tree ...
srestha
983
views
srestha
asked
Jan 12, 2017
DS
data-structures
tree
+
–
0
votes
0
answers
4385
infix to prefix ( with using stack and without using stack ) accurate and authentic algorithm
someone please post infix to prefix and infix to post fix ( with using stack and without using stack ) accurate and authentic algorithm also please tell the procedure to convert prefix to postfix and vice versa in simple terms
someone please post infix to prefix and infix to post fix ( with using stack and without using stack ) accurate and authentic algorithm also please tell the procedure t...
Meenakshi Sharma
1.7k
views
Meenakshi Sharma
asked
Nov 13, 2016
6
votes
1
answer
4386
c-question
let m=(i++&&j++&&k++) || l++; printf(i,j,k,l,m) //i=-1 j=-1 k=-1 l=2 output:0 0 0 2 1 //i=-1 j=-1 k=0 m=2 output:0 0 1 3 1 //i=0 j=2 k=3 l=2 ouput:1 2 3 3 1
letm=(i++&&j++&&k++) || l++;printf(i,j,k,l,m)//i=-1 j=-1 k=-1 l=2output:0 0 0 2 1//i=-1 j=-1 k=0 m=2output:0 0 1 3 1//i=0 j=2 k=3 l=2ouput:1 2 3 3 1
Ankush Tiwari
2.2k
views
Ankush Tiwari
asked
Sep 12, 2016
0
votes
1
answer
4387
madeeasy
Given the input sequence {11, 33, 43, 99, 34, 79, 19} and hash table of size 10 with the hash function h(k) = k mod 10. If hash table uses quadratic probing, the number of collisions occurred while mapping the given sequence is ______.
Given the input sequence {11, 33, 43, 99, 34, 79, 19} and hash table of size 10 with the hash function h(k) = k mod 10. If hash table uses quadratic probing, the number o...
shefali1
735
views
shefali1
asked
Feb 5, 2017
2
votes
0
answers
4388
Min heap
how to solve this please explain procedure...
how to solve this please explain procedure...
S Ram
584
views
S Ram
asked
Feb 1, 2017
Programming in C
binary-heap
test-series
+
–
3
votes
1
answer
4389
C Program
#include <stdio.h> char *str[]={"FirstSring","Is","Already","Written"}; char **strp[]={str+3,str+2,str+1,str}; char ***strpp=strp; int main(void) { printf("%s",**++strpp); printf("%s",*--*++strpp+3); return 0; } Output of this, and the interpretation?
#include <stdio.h char *str[]={"FirstSring","Is","Already","Written"}; char strp[]={str+3,str+2,str+1,str}; char *strpp=strp; int main(void) { printf("%s", ++strpp); pr...
Samujjal Das
813
views
Samujjal Das
asked
Jan 21, 2017
0
votes
0
answers
4390
Made Easy FLT1 Circular Queue
Doubt: dequeue really deletes the element or just moves the pointer? I'm not getting the answer.
Doubt: dequeue really deletes the element or just moves the pointer? I'm not getting the answer.
target2017
977
views
target2017
asked
Jan 21, 2017
DS
data-structures
queue
circular-queue
+
–
0
votes
1
answer
4391
Ace Test Series: Programming & DS - Programming In C
#include<stdio.h> int main() { char *p; p = "%d\n"; p++; p++; printf(p-2, 400); return 0; } Output : 400 I ran this program and got 400 as output. But I don't understand why it is so?
#include<stdio.h>int main() { char *p; p = "%d\n"; p++; p++; printf(p-2, 400); return 0;}Output : 400I ran this program and got 400 as output. But I don...
Hemant Parihar
544
views
Hemant Parihar
asked
Feb 3, 2017
Programming in C
ace-test-series
programming-in-c
programming
+
–
0
votes
1
answer
4392
UGC NET CSE | August 2016 | Part 2 | Question: 11
Given $i= 0, j = 1, k = - 1, x = 0.5, y = 0.0$ What is the output of given $‘C’$ expression? x * 3 & & 3 || j | k $-1$ $0$ $1$ $2$
Given $i= 0, j = 1, k = - 1, x = 0.5, y = 0.0$ What is the output of given $‘C’$ expression?x * 3 & & 3 || j | k$-1$ $0$ $1$ $2$
makhdoom ghaya
2.2k
views
makhdoom ghaya
asked
Sep 24, 2016
Programming and DS
ugcnetcse-aug2016-paper2
programming-in-c
+
–
0
votes
3
answers
4393
test series
shubhamdarokar
775
views
shubhamdarokar
asked
Jan 19, 2017
Programming in C
test-series
programming-in-c
+
–
2
votes
1
answer
4394
stack and queue
Sanjay Sharma
1.5k
views
Sanjay Sharma
asked
Nov 17, 2016
1
votes
0
answers
4395
Vgate-2
here SJF is given as well as priorities are given, given answer followes only priority scheduling but i think priority is used in case where there is a tie between two processes in SJF what is the correct approach?
here SJF is given as well as priorities are given, given answer followes only priority schedulingbut i think priority is used in case where there is a tie between two pro...
Anusha Motamarri
921
views
Anusha Motamarri
asked
Feb 3, 2017
0
votes
1
answer
4396
pesudo-code output
Sanjay Sharma
274
views
Sanjay Sharma
asked
Mar 1, 2017
4
votes
1
answer
4397
ISRO2008-75
A complete binary tree with the property that the value at each node is at least as large as the values at its children is known as binary search tree AVL tree completely balanced tree Heap
A complete binary tree with the property that the value at each node is at least as large as the values at its children is known asbinary search treeAVL treecompletely ba...
go_editor
3.3k
views
go_editor
asked
Jun 13, 2016
DS
isro2008
data-structures
binary-tree
+
–
4
votes
1
answer
4398
UGC NET CSE | September 2013 | Part 2 | Question: 20
Consider the following statements: A graph in which there is a unique path between every pair of vertices is a tree. A connected graph with e=v-1 is a tree A connected graph with e=v-1 that has no circuit is a tree Which one of the above statements is/are true? I and III II and III I and II All of the above
Consider the following statements:A graph in which there is a unique path between every pair of vertices is a tree.A connected graph with e=v-1 is a treeA connected graph...
shivani2010
3.6k
views
shivani2010
asked
Jun 9, 2016
DS
graph-connectivity
ugcnetsep2013ii
+
–
0
votes
1
answer
4399
C Programming Doubt
char *p; *p='a' ; I know this will give compiler error but can anyone explain what is the actual bug in this and how to rectify it??
char *p;*p='a' ;I know this will give compiler error but can anyone explain what is the actual bug in this and how to rectify it??
sushmita
987
views
sushmita
asked
Jan 9, 2017
Programming in C
programming-in-c
pointers
+
–
3
votes
2
answers
4400
Array-name and pointer manipulation + type casting
#include <stdio.h> int main() { int A[3][4] = {{1,2,3,4}, {4,5,6,7}, {8,9,10,11} }; int *p = &A[0][0]; int *q = (int*)(&A[0]+1); int *z = (int*)(&A+1); int *w = (int*)A; printf("%d\n",*(p + 1)); printf("%d\n",*(q - 2)); printf("%d\n",*(z - 2)); printf("%u %d\n",w,*(w+1)); }
#include <stdio.h int main() { int A[3][4] = {{1,2,3,4}, {4,5,6,7}, {8,9,10,11} }; int *p = &A[0][0]; int *q = (int*)(&A[0]+1); int *z = (int*)(&A+1); int *w = (int*)A; p...
dd
1.2k
views
dd
asked
Dec 13, 2016
Programming in C
programming-in-c
programming
+
–
Page:
« prev
1
...
215
216
217
218
219
220
221
222
223
224
225
...
310
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register