What is the disadvantage of using splay trees?

height of a splay tree can be linear when accessing elements in non-decreasing order.

splay tree performs unnecessary splay when a node is only being read

What are the operations that could be performed in O(logn) time complexity by red-black tree?

insertion, deletion, finding predecessor, successor

only finding predecessor, successor

When to choose Red-Black tree, AVL tree and B-trees?

many inserts, many searches and when managing more items respectively

many searches, when managing more items respectively and many inserts respectively

sorting, sorting and retrieval respectively

retrieval, sorting and retrieval respectively

Which of the following is an application of Red-black trees and why?

can be used in process schedulers, maps, sets

used to store strings efficiently

used to store integers efficiently

When it would be optimal to prefer Red-black trees over AVL trees?

when there are more insertions or deletions

when log(nodes) time complexity is needed

Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?

because of resizing issues of hash table and better ordering in redblack trees

because they can be implemented using trees

How can you save memory when storing color information in Red-Black tree?

using least significant bit of one of the pointers in the node for color information

using another array with colors of each node

storing color information in the node structure

using negative and positive numbering

What is the special property of red-black trees and what root should always be?

a color which is either red or black and root should always be black color only

a color which is either green or black

Why do we impose restrictions like . root property is black . every leaf is black . children of red node are black . all leaves have same black

to get logarithm time complexity

to get exponential time complexity

to get constant time complexity

What is the speciality of cartesian sorting?

it sorts partially sorted set of data quickly

it considers cartesian product of elements

it sorts elements in less than O(logn)

What is a Cartesian tree?

a tree which obeys heap property and whose inorder traversal yields the given sequence

a skip list in the form of tree

a tree which obeys cartesian product

a tree which obeys heap property only

Consider a sequence of numbers to have repetitions, how a cartesian tree can be constructed in such situations without violating any rules?

use any tie-breaking rule between repeated elements

cartesian tree is impossible when repetitions are present

construct a max heap in such cases

construct a min heap in such cases

Cartesian trees are most suitable for?

minimum range query and lowest common ancestors

A treap is a cartesian tree with ___________

additional value, which is a priority value to the key generated sequentially

additional value, which is a priority value to the key generated randomly

additional operations like remove a range of elements

Which of the following is the correct definition for a horizontal link?

connection between node and a child of equal levels

connection between two child nodes

connection between root node and leaf node

CPS02-Day2-NWC -Set01

Authored by CCC info@ccc.training

English

Professional Development

Used 1+ times

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

Content View
Student View

30 questions

Show all answers

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

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following options is an application of splay trees?

cache Implementation

networks

send values

receive values

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What are splay trees?

self adjusting binary search trees

self adjusting binary trees

a tree with strings

a tree with probability distributions

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following property of splay tree is correct?

it holds probability usage of the respective sub trees

any sequence of j operations starting from an empty tree with h nodes at most, takes O(jlogh) time complexity

sequence of operations with h nodes can take O(logh) time complexity

splay trees are unstable trees

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Why to prefer splay trees?

easier to program

space efficiency

easier to program and faster access to recently accessed items

quick searching

MULTIPLE CHOICE QUESTION

1 min • 1 pt

When we have red-black trees and AVL trees that can perform most of operations in logarithmic times, then what is the need for splay trees?

no there is no special usage

In real time it is estimated that 80% access is only to 20% data, hence most used ones must be easily available

redblack and avl are not upto mark

they are just another type of self balancing binary search trees

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Is it true that splay trees have O(logn) amortized complexity?

true

false

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Continue with Google

Continue with Email

Continue with Microsoft

or continue with

Facebook

Apple

Others

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

Already have an account?

Similar Resources on Wayground

25 questions

BAHASA INGGRIS SESI 2

Quiz

•

Professional Development

25 questions

TKT Glossary quiz Unit 2 Lexis

Quiz

•

Professional Development

25 questions

Name the Author II

Quiz

•

6th Grade - Professio...

26 questions

Repaso Intro 3

Quiz

•

Professional Development

26 questions

20. Final Test Basic Grammar

Quiz

•

Professional Development

28 questions

Christmas Trivia Game 2020

Quiz

•

Professional Development

27 questions

ADV2 - BB U7

Quiz

•

Professional Development

30 questions

English: Hoot Quiz

Quiz

•

KG - Professional Dev...

Popular Resources on Wayground

10 questions

How much do you know about our Portrait of an Eagle?

Quiz

•

10th Grade

10 questions

Fast Food Slogans

Quiz

•

6th - 8th Grade

21 questions

Continents and Oceans

Quiz

•

6th Grade

20 questions

Parts of Speech

Quiz

•

5th Grade

16 questions

Subject & Predicate

Quiz

•

5th Grade

25 questions

Multiplication Facts

Quiz

•

5th Grade

12 questions

Map Skills

Quiz

•

3rd Grade

22 questions

Continents and Oceans

Quiz

•

5th Grade

Discover more resources for English

10 questions

How to Email your Teacher

Quiz

•

Professional Development

11 questions

NFL Football logos

Quiz

•

KG - Professional Dev...

14 questions

Fall Trivia

Quiz

•

11th Grade - Professi...

20 questions

Sports trivia

Quiz

•

Professional Development

20 questions

90s Cartoons

Quiz

•

Professional Development

20 questions

Block Buster Movies

Quiz

•

10th Grade - Professi...

CPS02-Day2-NWC -Set01

What is a splay operation?

Which of the following options is an application of splay trees?

What are splay trees?

Which of the following property of splay tree is correct?

Why to prefer splay trees?

When we have red-black trees and AVL trees that can perform most of operations in logarithmic times, then what is the need for splay trees?

Is it true that splay trees have O(logn) amortized complexity?

What is the disadvantage of using splay trees?

What does the other nodes of an expression tree(except leaves) contain?

What are the operations that could be performed in O(logn) time complexity by red-black tree?

Access all questions and much more by creating a free account

Similar Resources on Wayground

Popular Resources on Wayground

Discover more resources for English