Computer Science and Engineering Data Structures - 1 Experiments

Aim

Overview

Recap

Pretest

Insert Heap

Aim Concept Process Demo Practice Exercise Quiz

Extract Min

Aim Concept Process Demo Practice Exercise Quiz

Heap Sort

Aim Concept Fast Build Process Demo Practice Quiz

Code Assessment

Posttest

Heap Sort

Choose difficulty:

Beginner

Intermediate

Advanced

1. The array 5, 4, 1, 2, 3 is sorted in ascending order. Which option provides the correctly sorted array?

a: 1, 2, 3, 4, 5 Explanation

Explanation

b: 5, 4, 3, 2, 1 Explanation

Explanation

c: 1, 1, 2, 2, 3, 3, 4, 4, 5, 5 Explanation

Explanation

d: Depends on which data structure is used Explanation

Explanation

2. Which of the following statements about logarithms is correct?

a: Log₂8 = 3 Explanation

Explanation

b: Logₑ2 is the same as Log₂e Explanation

Explanation

c: Log₁₀100 is smaller than Log₂8 Explanation

Explanation

d: Log₃27 is the same as Log₉81 Explanation

Explanation

3. Which of the following is true about Binary Trees?

a: Every binary tree is either complete or full Explanation

Explanation

b: Every complete binary tree is also a full binary tree Explanation

Explanation

c: Every full binary tree is also a complete binary tree Explanation

Explanation

d: No binary tree is both complete and full Explanation

Explanation

e: None of the above Explanation

Explanation

4. Level of a node is distance from root to that node. For example, level of root is 1 and levels of left and right children of root is 2. The maximum number of nodes on level i of a binary tree is (the operator '^' indicates power):

a: 2^(i-1) Explanation

Explanation

b: 2^i Explanation

Explanation

c: 2^(i+1) Explanation

Explanation

d: 2^[(i+1)/2] Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)