Skip to content
VUBuddy

CS301 Quiz 4 Jan 2026

Data Structures PDF 35 KBUpdated 23 Oct 2026
Quiz CS301 Quiz 4 Jan 2026 PDF 35 KB
vubuddy.com
Type
Quiz
Course
CS301 Data Structures
Size
PDF 35 KB
Updated
23 Oct 2026
Free download 0 of 3 used today
Download free · 35 KB

You get 3 free files a day on the website. Add the Chrome extension for 30 a day.

Unlimited downloads in the Android app Get it free on Google Play

Preview text

Text from pages 2, 3, 4 of 5. Download the file for all 5 pages.

Quiz 1 - CS301 (Q1/10)

Question:

The scenario “If Ali is brother of Asif and Asif is brother of Uzma then Ali is brother of Uzma” is the example of ___________ property.

A. Transitive

B. Symmetry C. Identity D. Reflexive Copied: 1/6/2026, 4:56:17 PM

Quiz 2 - CS301 (Q2/10)

Question:

In heap's percolateDown method, why do we start our iterations from n/2 instead of n?

  1. Because nth node is a leaf node and it doesn't have any left & right child to get sorted
  2. nth node contains null
  3. Because n node iterations create complexity
  4. nth node key is always largest

Correct answer: Because nth node is a leaf node and it doesn't have any left & right child to get sorted

Copied: 1/6/2026, 4:56:39 PM

Quiz 3 - CS301 (Q3/10)

Question:

The total number of nodes on 10th level of a perfect binary tree are :

A. 256

B. 512

C. 1024

D. Can't be determined Copied: 1/6/2026, 4:56:56 PM

Quiz 4 - CS301 (Q4/10)

Question:

Following data that is array representation of min heap. If we have to get the value 27 from the min heap then how many times deleteMin() method will be called?

  1. 5
  2. 8
  3. 9
  4. 4

Correct answer: 9

Copied: 1/6/2026, 4:57:11 PM

Quiz 5 - CS301 (Q5/10)

Question:

In heap data structure, the time required for insert() method will be proportional to ___________.

A. N B. Nlog2N C. N2

D. log2n

Copied: 1/6/2026, 4:57:43 PM

Quiz 6 - CS301 (Q6/10)

Question:

Which of the following heap method lowers the value of key at position ‘p’ by the amount ‘delta’?

  1. percolateDown(p,delta)
  2. decreaseKey(p,delta)
  3. increaseKey(p,delta)
  4. remove(p,delta)

Correct answer: decreaseKey(p,delta)

Copied: 1/6/2026, 4:58:31 PM

Quiz 7 - CS301 (Q7/10)

Question:

Which one of the following is NOT the property of equivalence relation?

  1. Symmetric
  2. Transitive
  3. Reflexive
  4. Associative

Correct answer: Associative

Copied: 1/6/2026, 4:58:46 PM

Quiz 8 - CS301 (Q8/10)

Question:

To remove any node in the min heap other than the root node, the remove method first calls the _________ method before calling deleteMin().

All CS301 files →
CS301 Data Structures All CS301 handouts, past papers, quizzes and MCQs in one place. Open course page

Get more out of VUBuddy, for free

Android app Free on Google Play
  • Unlimited downloads
  • The explanation behind every MCQ answer
  • Study offline on slow data
Get the Android app
Chrome extension Free on the Chrome Web Store
  • 30 downloads a day instead of 3
  • Sign in and buy Pro Semester here
Add to Chrome

One Pro Semester membership works in both the extension and the app.