Crowdly
Додати до Chrome
Questions Bank (1387927 total)
Given the algorithm bla, the binary tree and the pointer p below, what would be a call to bla( p ) return?
Function bla(TreeNode b)
IF b = NULL
return 0
return bla( b.right ) + bla( b.left ) + 1
0%
0%
0%
0%
❌
Переглянути це питання
How much memory - in Big-Oh notation - is needed to store n numbers in an array?
❌
✅
❌
❌
❌
Переглянути це питання
Suppose we are implementing quadratic probing on a hash table with 71 slots and with a hash function hash(x) = x mod 71. An element with key 63 is to be inserted and the first three locations attempted are already occupied. What is the next location that will be tried?
0%
❌
0%
0%
0%
Переглянути це питання
Suppose we are implementing linear probing on a hash table with 100 slots and with a hash function hash(x) = x mod 100. An element with key 5498 is to be inserted and the first three locations attempted are already occupied. What is the next location that will be tried?
0%
0%
❌
0%
0%
Переглянути це питання
What is the range of values computed by the hash function hash(x)= x mod 100?
0%
0%
0%
0%
0%
Переглянути це питання
Which type of tree traversal does not use a stack?
❌
❌
❌
✅
❌
Переглянути це питання
What is Chaining in a Hash Table?
✅
❌
❌
❌
❌
Переглянути це питання
Переглянути це питання
Укажи елемент, графічно-електронна формула атома якого у збудженому стані наведена:
❌
✅
❌
❌
Переглянути це питання
Переглянути це питання