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
1
votes
1
answer
2461
ace test
The number of ways we can insert 11, 12, 13, 14, 15, 16, 17 in empty binary search tree such that resulting tree has the height of 6 = ___________ [height of a tree with single node is 0.]
The number of ways we can insert 11, 12, 13, 14, 15, 16, 17 in empty binary search tree such that resulting tree has the height of 6 = ___________ [height of a tree with ...
Mr_22B
408
views
Mr_22B
asked
Dec 10, 2017
Programming in C
binary-search-tree
combinatory
+
–
0
votes
2
answers
2462
Ace Test Series: Programming & DS - Linked Lists
What is the time complexity to insert a new Node in a singly circular linked list at Starting ? (Number of nodes in list = N) A. O(1) B. O(N)
What is the time complexity to insert a new Node in a singly circular linked list at Starting ? (Number of nodes in list = N)A. O(1)B. O(N)
Mr_22B
2.4k
views
Mr_22B
asked
Dec 10, 2017
Programming in C
ace-test-series
linked-list
data-structures
+
–
0
votes
0
answers
2463
Data structure
Consider an implementation of towers of hanoi where there are 25 discs(numbered from 0 to 24) and three pegs(source, auxiliary, destination). We have to move all 25 discs from source peg to destination peg using auxiliary peg only. What is the number of ... number 0) respectively to complete the task in least possible time ? 16777216 and 1 1 and16777216 16777215 and 1 1 and 16777215
Consider an implementation of towers of hanoi where there are 25 discs(numbered from 0 to 24) and three pegs(source, auxiliary, destination). We have to move all 25 discs...
heena singh
333
views
heena singh
asked
Dec 10, 2017
0
votes
4
answers
2464
MadeEasy Test Series 2018: Programming & DS - Arrays
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10, The location of A [20] [20] [30] is ________. (Assume the first element is stored at A[1][1][1] and each element take 1 memory location)
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10, The location of A [20] [20] [30] is ________....
rohit vishkarma
997
views
rohit vishkarma
asked
Dec 10, 2017
Programming in C
made-easy-test-series
3-dimensional-array
array
data-structures
+
–
4
votes
2
answers
2465
TIFR CSE 2018 | Part B | Question: 6
Consider the following implementation of a binary tree data strucrure. The operator $+$ denotes list-concatenation. That is, $[a,b,c]+[d,e]=[a,b,c,d,e].$ struct TreeNode: int value TreeNode leftChild TreeNode rightChild function preOrder(T): if T == null: ... $\text{Cannot be uniquely determined from given information.}$
Consider the following implementation of a binary tree data strucrure. The operator $+$ denotes list-concatenation.That is, $[a,b,c]+[d,e]=[a,b,c,d,e].$struct TreeNode: i...
Arjun
1.4k
views
Arjun
asked
Dec 10, 2017
DS
tifr2018
data-structures
binary-tree
+
–
16
votes
5
answers
2466
TIFR CSE 2018 | Part A | Question: 7
Consider the following function definition. void greet(int n) { if(n>0) { printf("hello"); greet(n-1); } printf("world"); } If you run $\textsf{greet(n)}$ ... "helloworld" $\textsf{n+1}$ times "helloworld" $\textsf{n}$ times "helloworld", followed by "world"
Consider the following function definition. void greet(int n) { if(n>0) { printf("hello"); greet(n-1); } printf("world"); }If you run $\textsf{greet(n)}$ for some non-neg...
Arjun
2.9k
views
Arjun
asked
Dec 10, 2017
Programming in C
tifr2018
programming
programming-in-c
recursion
+
–
6
votes
3
answers
2467
MadeEasy Test Series: Programming & DS - Graphs
Consider the following graph: The minimum size of queue required when performing BFS on above graph is ________. (Size of queue is represented by maximum number of element at any time).
Consider the following graph:The minimum size of queue required when performing BFS on above graph is ________.(Size of queue is represented by maximum number of element ...
rahul sharma 5
3.9k
views
rahul sharma 5
asked
Dec 9, 2017
Programming in C
made-easy-test-series
data-structures
graph-theory
+
–
0
votes
2
answers
2468
MadeEasy Test Series: Programming & DS - Graphs
In DFS traversal every vertex of the graph is visited exactly once. True / False?
In DFS traversal every vertex of the graph is visited exactly once. True / False?
rahul sharma 5
880
views
rahul sharma 5
asked
Dec 9, 2017
Programming in C
made-easy-test-series
data-structures
graph-theory
+
–
0
votes
2
answers
2469
Output
Shivam Chauhan
567
views
Shivam Chauhan
asked
Dec 9, 2017
Programming in C
programming-in-c
output
+
–
0
votes
0
answers
2470
Output
Shivam Chauhan
422
views
Shivam Chauhan
asked
Dec 9, 2017
Programming in C
programming
programming-in-c
+
–
1
votes
1
answer
2471
Linked list doubt previous year question
The following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list. The function is called with the list containing the integers 1, 2, 3, 4, 5, 6, 7 in the given order. What will be the contents of the list after ... ;value = temp; p = q ->next; q = p? p ->next : 0; } } What is meant by line 1?
The following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list. The function is called with the list containing th...
hem chandra joshi
811
views
hem chandra joshi
asked
Dec 9, 2017
Programming in C
linked-list
+
–
0
votes
1
answer
2472
practice_question
akash.dinkar12
534
views
akash.dinkar12
asked
Dec 9, 2017
2
votes
1
answer
2473
Min #Stack operations
Let's consider we have a stack with three operations defined on it:: Push,Pop, Peek We have to print "ABCACBA" using the above operations. Give the min no of operations for doing it and also specify the operations in order.
Let's consider we have a stack with three operations defined on it:: Push,Pop, PeekWe have to print "ABCACBA" using the above operations.Give the min no of operations for...
Tuhin Dutta
617
views
Tuhin Dutta
asked
Dec 9, 2017
Programming in C
data-structures
stack
+
–
0
votes
0
answers
2474
solve : reflexive relation
R = { (x,y) ∈ z X z : x-y is even integer } is this reflexive how to prove and what this set is representing , z= set of integers
R = { (x,y) ∈ z X z : x-y is even integer } is this reflexive how to prove and what this set is representing , z= set of integers
sumit goyal 1
405
views
sumit goyal 1
asked
Dec 9, 2017
0
votes
2
answers
2475
MadeEasy Test Series: Programming & DS - Recursion
I am getting answer 13 but answer given is 17 !
I am getting answer 13 but answer given is 17 !
Prakhar Shukla 1
547
views
Prakhar Shukla 1
asked
Dec 8, 2017
Programming in C
made-easy-test-series
data-structures
programming-in-c
recursion
+
–
0
votes
0
answers
2476
Pointer doubt
a and &a are the same thing where a is array name? I am unable to understand diff between (a+1) and (&a+1) when assigned to a pointer #include <stdio.h> int main() { int a[5] = {1,2,3,4,5}; int *ptr = (int*)(&a+1); printf("%d %d", *(a+1), *(ptr-1)); return 0; }
a and &a are the same thing where a is array name? I am unable to understand diff between (a+1) and (&a+1) when assigned to a pointer #include <stdio.h>int main(){ in...
Kiran Karwa
359
views
Kiran Karwa
asked
Dec 8, 2017
1
votes
1
answer
2477
Heap Deletion
For searching an element from heap,then delete it from heap Why will it take O(n+log n) time and not O(n log n) time?
For searching an element from heap,then delete it from heapWhy will it take O(n+log n) time and not O(n log n) time?
srestha
515
views
srestha
asked
Dec 8, 2017
DS
data-structures
binary-heap
time-complexity
+
–
0
votes
0
answers
2478
gateforum test series
NK987
286
views
NK987
asked
Dec 8, 2017
0
votes
0
answers
2479
MadeEasy Test Series: Programming & DS - Trees
True / False:- 1. : The difference between the number of nodes in a binary tree that have exactly two children and the number of leaf nodes is 1 2. Deletion of root of AVL tree will take O(n) time so that, resulted tree also have property of ... is correct as we can do in logn so o(n) is also correct. Given answer is : 1 is true and second is false.
True / False:-1. : The difference between the number of nodes in a binary tree that have exactly two children and the number of leaf nodes is 12. Deletion of root of AVL...
rahul sharma 5
629
views
rahul sharma 5
asked
Dec 7, 2017
DS
made-easy-test-series
data-structures
algorithms
tree
+
–
1
votes
0
answers
2480
gateforum booklet
Consider inserting the key 10,22,31,4,15,28,17,88,59 using open addressing technique into hash table of length m=11 with hash function h(k)= k mod 11 what is no of collisions encountered? A) 7 B) 10 C)12 D) none of these given ans is d is it right?
Consider inserting the key 10,22,31,4,15,28,17,88,59 using open addressing technique into hash table of length m=11 with hash function h(k)= k mod 11 what is no of colli...
ADITYA CHAURASIYA 5
242
views
ADITYA CHAURASIYA 5
asked
Dec 7, 2017
Page:
« prev
1
...
119
120
121
122
123
124
125
126
127
128
129
...
310
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register