Skip to content

Data Structure

SWE · Quiz · Summer 26

Paper 1 of 4Section H · Juhayer Jubied (1)Switch

Section H

Paper 1 of 4

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 Department of Software Engineering Faculty of Science & Information Technology Quiz: 1 Semester: Summer 2026 Section: H Course Code: SE-131 Course Title: Data Structure Time: 30 Minutes Marks: 15 1. Suppose you are given an array containing the names of students: {Rafi, Sumi, Nabil, Tania, Rony, Mehedi, Farah, Shuvo}. Write the basic part of the C code to delete the name ‘Mehedi’ from the array. (5 marks) 2. Suppose you have a sorted array with 19 elements: (a, c, d, f, g, i, j, l, m, n, o, p, q, r, s, t, u, v, x). Apply Binary Search to find the element ‘p’ by showing each step of middle index calculation and mention the time complexity of Binary Search. (5 marks) 3. Write two differences between linear and non-linear data structures with examples. (3 marks) 4. A dataset is stored as A = {5, 10, 15, 20, 25, 30}. A student wants to insert a value 18 after the third element and then delete the fifth element. Show the step-by-step array operations. (2 marks)