Register

Webpage

Programming in C. Recursion.
Filter

Highest voted questions in Programming and DS

0 votes
1 answer
4921
Made easy
Consider we have an algorithm which generate preorder of any tree in Ο(log n) time, we have to create a Binary Search Tree with n distinct element. Which of the following will represents the worst case time complexity ? Ο(n) Ο(n log n) Ο(n2) Ο(1)
Consider we have an algorithm which generate preorder of any tree in Ο(log n) time, we have to create a Binary Search Tree with n distinct element. Which of the followin...
User Avatar
0 votes
2 answers
4922
testbook
payload value should be divided by here they take 505 it should be 504 so it become 504/8=63??
payload value should be divided by here they take 505 it should be 504 so it become 504/8=63??
User Avatar
0 votes
2 answers
4924
data structure tree doubt
A 5-ary tree is a tree in which every internal node has 3 children.The number of leaf nodes in such a tree with 10 internal nodes is______
A 5-ary tree is a tree in which every internal node has 3 children.The number of leaf nodes in such a tree with 10 internal nodes is______
User Avatar
0 votes
1 answer
4925
circular linked list_doubt
Given a head pointer what is the time complexity: 1. To insert the element at front 2.To delete the element at front 3.To insert the element at end 4.To delete the element at front 5.To insert the element at the middle To delete the element at the middle
Given a head pointer what is the time complexity:1. To insert the element at front2.To delete the element at front3.To insert the element at end4.To delete the element at...
User Avatar
0 votes
0 answers
4926
data structure
User Avatar
0 votes
2 answers
4927
C programming
a=4 and b=3 printf("%d",a+++b); output.?? My doubt is that we will read from left as a++ or as ++b.
a=4 and b=3printf("%d",a+++b);output.??My doubt is that we will read from left as a++ or as ++b.
User Avatar
0 votes
0 answers
4928
Testbook
Can anyone clarify hy they are getting 269 and and I am getting 258?
Can anyone clarify hy they are getting 269 and and I am getting 258?
User Avatar
0 votes
0 answers
4929
doubt
User Avatar
0 votes
0 answers
4930
madeeasytestseries#ds
Consider a complete Binary Tree ‘T’ with key of root node be ‘P’. It is given that the left and right subtree of ‘P’ satisfies minheap property. What is the time taken to convert the given tree ‘T’ to a max heap ? a. Ο(log n) b. Ο(n) c. Ο(n log n) d. Ο(n2)
Consider a complete Binary Tree ‘T’ with key of root node be ‘P’. It is given that the left and right subtree of ‘P’satisfies minheapproperty. What is the tim...
User Avatar
0 votes
1 answer
4931
madeeasytestseries
Consider a complete Binary Tree ‘T’ with key of root node be ‘P’. It is given that the left and right subtree of ‘P’ satisfies minheap property. What is the time taken to convert the given tree ‘T’ to a max heap ? a. Ο(log n) b. Ο(n) c. Ο(n log n) d. Ο(n2)
Consider a complete Binary Tree ‘T’ with key of root node be ‘P’. It is given that the left and right subtree of ‘P’satisfies minheapproperty. What is the tim...
User Avatar
0 votes
0 answers
4932
linked list
how much time take, if Insert/delete at end in linked list? a) when last element is unknown. b) when last element is known
how much time take, if Insert/delete at end in linked list?a) when last element is unknown.b) when last element is known
User Avatar
0 votes
0 answers
4933
find output
User Avatar
0 votes
0 answers
4934
find output
User Avatar
0 votes
1 answer
4935
Testbook
#plz check?? i think its 7 ??
#plz check?? i think its 7 ??
User Avatar
0 votes
0 answers
4936
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.
User Avatar
0 votes
1 answer
4937
MADE EASY TEST SERIES
​​ 15, 20, 25, 30 15, 20, 15, 20 15, 15, 15, 15 None of these
​​15, 20, 25, 3015, 20, 15, 2015, 15, 15, 15None of these
User Avatar
0 votes
0 answers
4939
MADE EASY TEST SERIES
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into binary heap. Such that resulted binary heap is max heap ________. Made easy says that there are 8 possible ways but I don't get more than 4.
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into binary heap. Such that resulted binary heap is max heap ________.Made easy says that there are ...
User Avatar
0 votes
1 answer
4940
Made easy
int CALL(int K) { if(K<3) return 1; else CALL(K-1) + CALL(K-3) +1; } value returned by CALL(CALL(5))is.............
int CALL(int K){if(K<3)return 1;else CALL(K-1) + CALL(K-3) +1;}value returned by CALL(CALL(5))is.............
User Avatar
Page: