Skip to content

Computer Algorithm Design and Analysis

SWE · Quiz · Summer 26

Paper 1 of 2Section 44B · Shadman Samin (1)Switch

Section 44B

Paper 1 of 2

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 Faculty of Science & Information Technology Department of Software Engineering QUIZ-1, Summer 2026 Course Code: SE314; Course Title: Computer Algorithm Design & Analysis Sections: 44B & Teacher: AS Time: 30 Minutes Marks: 15 [The figures in the right margin indicate the full marks and corresponding course outcomes. All portions of each question must be answered sequentially.] 1. Analyze the essential characteristics that define a good algorithm and Calculate the time complexity and space complexity of the given algorithm- int sum(int A[], int n) { int sum = 0, i; for(i = 0; i < n; i++) sum = sum + A[i]; return sum; } Marks: 5 2. Differentiate between Big Oh (O) and Big Omega (Ω) notation. An algorithm has a running time function: f(n)=5n+3 Determine the asymptotic upper bound of the function using Big-O notation. Justify your answer. Marks: 5 3. An e-commerce platform stores the prices (in BDT) of newly added products: 1250, 850, 1999, 450, 750, 2200, 1500, 999 To improve search efficiency, the system first breaks the collection into smaller sections, organizes each section, and then combines them to create one fully ordered list. Illustrate the complete sorting process and provide the final ordered prices. Marks: 5