Crowdly
Додати до Chrome
Questions Bank (1229820 total)
What is the return value from this block of pseudocode? s ← new Stack() isempty(s) isempty(s) push (45,s) push (-115,s) peek(s) push (103,s) push (55,s) return peek(s)
✅
❌
❌
❌
❌
Переглянути це питання
What is the return value from this block of pseudocode? q ← new Queue() enqueue (127,q) enqueue (105,q) peek(q) enqueue (78,q) enqueue (-35,q) dequeue (q) peek(q) return isempty(q)
0%
0%
0%
0%
0%
Переглянути це питання
What is the return value from this block of pseudocode? q ← new Queue() enqueue (50,q) enqueue (72,q) dequeue (q) dequeue (q) enqueue (40,q) dequeue (q) enqueue (-48,q) return peek (q)
❌
❌
❌
✅
❌
Переглянути це питання
What is the return value from this block of pseudocode? s ← new Stack() q ← new Queue() push (83,s) pop (s) isempty(s) push (56,s) push (-63,s) pop (s) enqueue (32,q) peek(q) peek(s) pop (s) dequeue (q) push (31,s) return peek (s)
❌
❌
❌
❌
✅
Переглянути це питання
What is the return value from this block of pseudocode? s ← new Stack() push (45,s) pop (s) isempty(s) push (65,s) pop (s) push (52,s) pop (s) return isempty(s)
0%
0%
0%
0%
❌
Переглянути це питання
For a queue with elements implemented using a pair (front, tail) of references
to a singly-linked list, what is the complexity of the enqueue operation?
✅
❌
❌
❌
❌
Переглянути це питання
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 queue with elements implemented using a single (front) reference
to a singly-linked list, what is the complexity of the isempty operation?
❌
❌
❌
❌
✅
Переглянути це питання
For a stack with elements implemented using a singly-linked list, what is the complexity of the isempty operation?
✅
❌
❌
❌
❌
Переглянути це питання