PrelimExam-DSA-FCPC

PrelimExam-DSA-FCPC

University

30 Qs

quiz-placeholder

Similar activities

Oratoria Forense y Debate Jurídico

Oratoria Forense y Debate Jurídico

University

32 Qs

PRASHNOTRI (प्रश्नोत्तरी)

PRASHNOTRI (प्रश्नोत्तरी)

University

25 Qs

cuantas cosas sabes sobre "el jhojan"

cuantas cosas sabes sobre "el jhojan"

University

25 Qs

INTRODUKSYON SA PANANALIKSIK

INTRODUKSYON SA PANANALIKSIK

11th Grade - University

26 Qs

Gênero Textual: Tirinhas

Gênero Textual: Tirinhas

6th Grade - University

28 Qs

Familia Culicidae

Familia Culicidae

University

29 Qs

Sistema Cardiovascular

Sistema Cardiovascular

University

33 Qs

DC014 - 2.1 Introduction to Databases

DC014 - 2.1 Introduction to Databases

University

30 Qs

PrelimExam-DSA-FCPC

PrelimExam-DSA-FCPC

Assessment

Quiz

Others

University

Hard

Created by

ALVIN CERTEZA

Used 3+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

30 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the time complexity of accessing an element in a Python list by index?

O(1)

O(n)

O(log n)

O(n²)

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the average time complexity of searching for an element in an unsorted linked list?

O(1)

O(n)

O(log n)

O(n log n)

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

The time complexity of appending an element to a Python list (average case) is:

O(1)

O(n)

O(log n)

O(n²)

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which operation on a singly linked list requires O(n) time?

Traversal

Access by index

Searching

All of the above

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following is the best case time complexity of inserting at the head of a linked list?

O(n)

O(log n)

O(1)

O(n²)

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the space complexity of storing a string of length n in Python?

O(1)

O(n)

O(n²)

O(log n)

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which operation in Python strings has O(n) complexity?

Indexing

Concatenation

Slicing

Both b and c

Create a free account and access millions of resources

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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?