Data Structures and Algorithms Flashcard

Data Structures and Algorithms Flashcard

Assessment

Flashcard

Computers

Professional Development

Practice Problem

Hard

Created by

Wayground Content

FREE Resource

Student preview

quiz-placeholder

30 questions

Show all answers

1.

FLASHCARD QUESTION

Front

What is the time complexity of accessing an element in an array?

Back

O(1)

2.

FLASHCARD QUESTION

Front

Which data structure is used for implementing recursion?

Back

Stack

3.

FLASHCARD QUESTION

Front

In a binary search tree (BST), the left child node's key is always:

Back

Smaller than the parent node

4.

FLASHCARD QUESTION

Front

Which of the following is the most efficient way to find the maximum element in a heap? O(n), O(log n), O(1), O(n log n)

Back

O(1)

5.

FLASHCARD QUESTION

Front

What is the space complexity of a linked list with 'n' nodes?

Back

O(n)

6.

FLASHCARD QUESTION

Front

Which of the following is an example of a symmetric encryption algorithm? RSA, DES, ElGamal, Diffie-Hellman

Back

DES

7.

FLASHCARD QUESTION

Front

What does the RSA algorithm use for encryption?

Back

Asymmetric Key

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?