Data Structures Review

Data Structures Review

Assessment

Flashcard

Computers

University

Practice Problem

Hard

Created by

Wayground Content

FREE Resource

Student preview

quiz-placeholder

12 questions

Show all answers

1.

FLASHCARD QUESTION

Front

Quick Sort runs in O(n) if all elements are equal.

Back

True

2.

FLASHCARD QUESTION

Front

Binary search is an example of binary recursion

Back

False

3.

FLASHCARD QUESTION

Front

Bucket sort is always better than quick sort because it has linear time complexity.

Back

False

4.

FLASHCARD QUESTION

Front

Let n be the number of elements in the stack. The push method of the stack runs in

Back

O(1)

5.

FLASHCARD QUESTION

Front

The space usage of ArrayQueue is O(n) where n is the number of elements in the queue.

Back

False

6.

FLASHCARD QUESTION

Front

One of these is not a method from the Positional List ADT: addFirst(p, e), addBefore(p, e), set(p, e), addAfter(p, e)

Back

addFirst(p, e)

7.

FLASHCARD QUESTION

Front

The return type of the 'set' method of Positional List is

Back

E

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?