Skip to content

Algorithms

CSE · Quiz · Spring 25

Section 66_H

This browser can’t show the PDF here

Open it, and your phone’s PDF viewer takes it, or download it.

Read the questions as text

Read off the PDF by AI, so it may have mistakes. The PDF is the original.

Daffodil International University Class Test Student ID: ....................................... Program: B.Sc. in CSE Semester: Spring-2025 Course Code: CSE Course Title: Algorithm Section: 66_H Date: ........................... Class Test No: 01 Teacher's Signature: ........................... 1. Suppose you have a data composition like the diagram given below, theoretically which algorithm would be best to find a given element's presence in the data composition? Do you think you can implement the proposed algorithm practically? Justify your answer. [Figure: A graph showing a bell-shaped curve on a grid] 2. For the given elements below choose an appropriate algorithm to sort the elements in descending order. Show the simulation also justify your choice: 8 9 2 12 15 78 22 50 51 53