Practice — KopHub

CSE/SY Sem 3

Leaderboard Calendar Playground

CSE/SY Sem 3

Leaderboard Class Schedule Code Playground Settings

Appearance

DM ADS DT CN SPM COI

MDM ElectiveMDM

Labs & ProjectsLabs

PYQ Practice

Practice Previous Year Questions from CSE SY SEM-3

Total Questions

10

Solved

0

Attempted

0

Progress

0%

Filters

Subject

Year

Difficulty

Exam Type

What is an AVL tree? Explain the LL and RR rotations with suitable examples.

Medium2022 • End Sem5 Marks

List the properties of a Red-Black tree. Insert the following elements into an initially empty Red-Black tree: `10, 20, 30, 15`.

Hard2022 • End Sem5 Marks

Define a Max-Heap. Build a Max-Heap for the given array: `[4, 10, 3, 5, 1]`.

Easy2022 • Mid Sem4 Marks

Explain Linear Probing and Quadratic Probing collision resolution techniques in Hashing. What is Primary Clustering?

Medium2023 • End Sem6 Marks

Write the algorithm for Depth First Search (DFS) traversal of a graph. Discuss its time and space complexity.

Medium2023 • End Sem5 Marks

Explain Quick Sort with an example. What is its worst-case time complexity and when does it occur?

Easy2023 • Mid Sem5 Marks

Construct an AVL tree for the following sequence of insertions: `14, 17, 11, 7, 53, 4, 13`. Show the tree after each balancing step.

Hard2024 • Mid Sem5 Marks

What is a Minimum Spanning Tree (MST)? Explain Kruskal's algorithm to find the MST.

Medium2024 • End Sem6 Marks

What is double hashing? Give the formula and explain why the second hash function should not evaluate to zero.

Medium2024 • End Sem4 Marks

Explain Heap Sort algorithm. Write a C++ function to implement Heap Sort.

Medium2024 • End Sem5 Marks