ADS LAB Quiz-2

ADS LAB Quiz-2

University

10 Qs

quiz-placeholder

Similar activities

TIẾP THỊ QUA CÔNG CỤ TÌM KIẾM VÀ TỐI ƯU HÓA CÔNG CỤ TÌM KIẾM

TIẾP THỊ QUA CÔNG CỤ TÌM KIẾM VÀ TỐI ƯU HÓA CÔNG CỤ TÌM KIẾM

University

8 Qs

The red crested tree rat quiz. 🐭

The red crested tree rat quiz. 🐭

5th Grade - Professional Development

8 Qs

Negara Kesatuan Republik Indonesia

Negara Kesatuan Republik Indonesia

1st Grade - University

10 Qs

UAE QUIZ

UAE QUIZ

KG - University

12 Qs

Pre-Test Modul I

Pre-Test Modul I

University

10 Qs

Kuiz Teroka Ilmu: Maklumat di Hujung Jari

Kuiz Teroka Ilmu: Maklumat di Hujung Jari

University

10 Qs

2024-25 Fall Blue WordMasters Challenge Vocabulary Quiz

2024-25 Fall Blue WordMasters Challenge Vocabulary Quiz

6th Grade - University

15 Qs

Grade 5 lesson 12 part 1

Grade 5 lesson 12 part 1

1st Grade - University

14 Qs

ADS LAB Quiz-2

ADS LAB Quiz-2

Assessment

Quiz

Education

University

Hard

Created by

roja laveti

Used 1+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following special type of trie is used for fast searching of the full texts?

Ctrie

Hash tree

Suffix tree

T tree

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following is not true?

Trie requires less storage space than hashing

Trie allows listing of all the words with same prefix

Tries are collision free

Trie is also known as prefix tree

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the worst case time complexity for search, insert and delete operations in a general Binary Search Tree?

O(n) for all

O(Logn) for all

O(Logn) for search and insert, and O(n) for delete

O(Logn) for search, and O(n) for insert and delete

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

How can we define a AVL tree?

A tree which is binary search tree and height balanced tree.

A tree which is a binary search tree but unbalanced tree.

A tree with utmost two children

A tree with utmost three children

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Why do we prefer Red Black tree over AVL tree?

Red Black trees are not strictly balanced

Red black tree requires lesser rotations than AVL tree.

AVL tree needs more space to store the balance factor.

Both Red black tree requires lesser rotations than AVL tree and AVL tree needs more space to store the balance factor.

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is a splay operation?

moving parent node to down of child

moving a node to root

moving root to leaf

removing leaf node

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?

O(n)

O(n*m)

O(m)

O(log n)

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?