Crowdly
Додати до Chrome
Questions Bank (1229803 total)
For a queue with elements implemented using a pair (front, tail) of references
to a singly-linked list, what is the complexity of the dequeue operation?
✅
✅
0%
0%
0%
Переглянути це питання
For a queue with elements implemented using a single (front) reference
to a singly-linked list, what is the complexity of the dequeue operation?
0%
✅
0%
0%
0%
Переглянути це питання
For a stack with elements implemented using a singly-linked list, what is the complexity of the isempty operation?
✅
❌
❌
❌
❌
Переглянути це питання
For a queue with elements implemented using a single (front) reference
to a singly-linked list, what is the complexity of the isempty operation?
❌
❌
❌
❌
✅
Переглянути це питання
Which of the following are not queue operations?
0%
❌
0%
❌
0%
Переглянути це питання
Which of the following are queue operations?
0%
❌
0%
0%
✅
Переглянути це питання
Which of the following are not stack operations?
0%
0%
0%
0%
0%
Переглянути це питання
Which of the following are stack operations?
0%
0%
0%
❌
❌
Переглянути це питання
Which of the following data structures support adding data to one end and reading it from the other?
0%
0%
0%
0%
0%
Переглянути це питання
In the list: head/0x1 -> 2/0x3 -> 7/0x7 -> 8/NULL, a new node is inserted between 2 and 7. The data of the new node is 5 and it is created in memory address 0xF. What is the content of the address part of number 7 after the insertion?
0%
0%
0%
0%
0%
Переглянути це питання