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
Highest voted questions in Programming and DS
1
votes
1
answer
2061
Max heap when stored in an array is always in sorted order
This question is in CLRS,if we have a max heap it is always in sorted order(descending) order.And by extension if we have min heap the array is sorted in ascending order.Is this true? I have a counter example for ... it an heapified representation or not? If we heapify after deletion and store max deleted element then we get sorted array.
This question is in CLRS,if we have a max heap it is always in sorted order(descending) order.And by extension if we have min heap the array is sorted in ascending order....
sripo
2.8k
views
sripo
asked
Nov 15, 2018
DS
sorting
binary-heap
array
data-structures
algorithms
+
–
1
votes
1
answer
2062
AVL Tree
The minimum number of node in an AVL Tree of height $10$ is ____________
The minimum number of node in an AVL Tree of height $10$ is ____________
Lakshman Bhaiya
702
views
Lakshman Bhaiya
asked
Nov 6, 2018
DS
data-structures
avl-tree
+
–
1
votes
0
answers
2063
Intersection among elements of Linked List
Given two unsorted singly-linked lists each with n distinct elements. There exists an efficient intersection algorithm, that computes and returns a new list with common elements between the input lists. How much time does the intersection algorithm requires in worst case, if it is allowed to use constant extra space only?
Given two unsorted singly-linked lists each with n distinct elements. There exists an efficient intersection algorithm, that computes and returns a new list with common e...
srestha
2.5k
views
srestha
asked
Nov 4, 2018
DS
linked-list
data-structures
+
–
1
votes
0
answers
2064
Testbook Test Series: Programming & DS - Hashing
The keys 44, 63, 29, 78, 23, 6, 81, 14, 13, 12 and 52 are inserted into an initially empty hash table of length 12 using linear probing with hash function h(k)= k mod 12. What is the probability that the 10th slot will be ... a probability of filling as 1 because no matter what index we get for the next insert we are going to fill 10th slot only.
The keys 44, 63, 29, 78, 23, 6, 81, 14, 13, 12 and 52 are inserted into an initially empty hash table of length 12 using linear probing with hash function h(k)= k mod 12....
vinay chauhan
958
views
vinay chauhan
asked
Oct 31, 2018
DS
testbook-test-series
data-structures
hashing
+
–
1
votes
1
answer
2065
test series
Gate Fever
1.0k
views
Gate Fever
asked
Oct 29, 2018
1
votes
1
answer
2066
test series(previous year)
pls explain this;i never get its explanation on GO!
pls explain this;i never get its explanation on GO!
Gate Fever
513
views
Gate Fever
asked
Oct 29, 2018
1
votes
1
answer
2067
test series
Consider an empty binary search tree of height $-1.$We need to fill the following sequence of numbers in it $: 11, 12, 13, 14, 15, 16, 17.$The number of ways in which the numbers can be inserted in an empty binary search tree, such that the resulting tree has height $6,$ is _____________ $A)2$ $B)4$ $C)32$ $D)64$
Consider an empty binary search tree of height $-1.$We need to fill the following sequence of numbers in it $: 11, 12, 13, 14, 15, 16, 17.$The number of ways in which the...
mitesh kumar
1.8k
views
mitesh kumar
asked
Oct 28, 2018
Programming in C
data-structures
binary-search-tree
test-series
+
–
1
votes
0
answers
2068
madeaesy test series
how to interpret the statement ptr1=(ptr+=sizeof(int))-2; here...
how to interpret the statement ptr1=(ptr+=sizeof(int))-2; here...
utpal podder
343
views
utpal podder
asked
Oct 28, 2018
1
votes
1
answer
2069
How it works. Please give some example.
Consider the following foo function and identify the return value of foo function. int foo (unsigned int n) { int c, x = 0; while (n! = 0) { if (n & 01) x++; n >>= 1; } return x; } (a) It counts the total number of bits ... counts the number of bits which are zero. (c) It counts the number of occurrences of 01. (d) It returns the same value as n'.
Consider the following foo function and identify the return value of foo function.int foo (unsigned int n){ int c, x = 0; while (n! = 0) ...
Mak Indus
648
views
Mak Indus
asked
Oct 26, 2018
1
votes
0
answers
2070
Reverse Linked list
What is the time complexity of the best-known algorithm to reverse a doubly linked list? $A) O(n)$ $B) O(logn)$ $C) O(1)$ $D) O(n^{2})$
What is the time complexity of the best-known algorithm to reverse a doubly linked list?$A) O(n)$$B) O(logn)$$C) O(1)$$D) O(n^{2})$
Lakshman Bhaiya
1.3k
views
Lakshman Bhaiya
asked
Oct 26, 2018
DS
data-structures
linked-list
+
–
1
votes
0
answers
2071
IISC-CDS Written Test Sample Question
Sayan Bose
2.6k
views
Sayan Bose
asked
Oct 25, 2018
Programming in C
iisc
cds
linked-list
+
–
1
votes
0
answers
2072
TANCET 2016 C Programing
Balaji Jegan
216
views
Balaji Jegan
asked
Oct 23, 2018
Programming in C
tancet
+
–
1
votes
2
answers
2073
Recursion
What is Head recursion and Tail Recursion??
What is Head recursion and Tail Recursion??
Lakshman Bhaiya
650
views
Lakshman Bhaiya
asked
Oct 22, 2018
Programming in C
data-structures
recursion
+
–
1
votes
0
answers
2074
Linked list
If the head of a Linked List is pointing to $k$ th element, then how will you get the elements before $k$ th element?
If the head of a Linked List is pointing to $k$ th element, then how will you get the elements before $k$ th element?
Lakshman Bhaiya
615
views
Lakshman Bhaiya
asked
Oct 17, 2018
DS
data-structures
linked-list
+
–
1
votes
0
answers
2075
made easy
Number of addition performed by above code? Please explain this?
Number of addition performed by above code? Please explain this?
Rudra Pratap
315
views
Rudra Pratap
asked
Oct 16, 2018
Programming in C
programming
+
–
1
votes
0
answers
2076
Explain the following
Please explain this.
Please explain this.
Abhisek Saha
448
views
Abhisek Saha
asked
Oct 14, 2018
Programming in C
programming-in-c
array
pointers
+
–
1
votes
1
answer
2077
nptel lecture on stacks
While calculating the cost of growable array-based stack.... the cost of n pushes came out as a series - 2 + 4 + 8 + 16 +......+2^(logn + 1) and it equals to 4n - 1. I didn't understand how the series sum equals to 4n?
While calculating the cost of growable array-based stack.... the cost of n pushes came out as a series - 2 + 4 + 8 + 16 +......+2^(logn + 1) and it equals to 4n - 1. I di...
himanshu6398
435
views
himanshu6398
asked
Oct 9, 2018
DS
data-structures
stack
+
–
1
votes
0
answers
2078
From parameter pass
i, j; int; void P(x:int) { printf(x+10); i=10; j=20; printf(x); } void main() { i=50; j=60; P(i+j); } o/p = call by name= call by text= call by need=
i, j; int;void P(x:int){printf(x+10);i=10;j=20;printf(x);}void main(){i=50;j=60;P(i+j);} o/p =call by name=call by text=call by need=
Pradeep A
342
views
Pradeep A
asked
Oct 8, 2018
1
votes
1
answer
2079
Vani online test series
how the answer is 23699? For column major order I get answer as 80039. Even if i go by row major order the answer I get is 23599
how the answer is 23699?For column major order I get answer as 80039.Even if i go by row major order the answer I get is 23599
Human
632
views
Human
asked
Oct 8, 2018
1
votes
1
answer
2080
MOCK TEST MADE EASY DS
i am unable to understand how this extern int data type actually works here please help me to understand it??
i am unable to understand how this extern int data type actually works hereplease help me to understand it??
garimanand
337
views
garimanand
asked
Oct 8, 2018
Page:
« prev
1
...
99
100
101
102
103
104
105
106
107
108
109
...
310
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register