Database Management Systems (DBMS) GTU Chapter 2 Quiz
8 Questions
0 Views

Choose a study mode

Play Quiz
Study Flashcards
Spaced Repetition
Chat to Lesson

Podcast

Play an AI-generated podcast conversation about this lesson

Questions and Answers

What is the cost of linear search in the best case scenario?

  • (br * 2)
  • (br - 2)
  • (br / 2) (correct)
  • (2br)

When can linear search be applied according to the text?

  • Only if the selection is on the primary key attribute
  • When selection condition involves multiple comparisons
  • Only if the file is sorted on the primary key attribute
  • Regardless of selection condition or ordering of records (correct)

What is the cost of binary search as per the text?

  • [log(br) / 2]
  • [br / log2]
  • [log2(br)] (correct)
  • [log(br)]

In which scenario is binary search generally used?

<p>When selection is an equality comparison on the primary key attribute and the file is ordered on the primary key attribute (A)</p> Signup and view all the answers

How do we evaluate expressions with multiple operations according to the text?

<p>By evaluating each operation one by one in appropriate order (D)</p> Signup and view all the answers

What does 'br' represent in the context of cost calculation?

<p>Number of blocks containing records from relation r (A)</p> Signup and view all the answers

Which search algorithm is faster between linear search and binary search?

<p>Binary search (C)</p> Signup and view all the answers

What method is used for evaluating expressions with multiple operations from bottom to top?

<p><em>Pipelining</em> (C)</p> Signup and view all the answers

More Like This

Use Quizgecko on...
Browser
Browser