BSC CSIT Semester 3 – Data Structure and Algorithms () Questions & Answers | Past TU Exam Papers

Question 1

What is asymptotic analysis? Explain theta notation with example.

Marks: 5

Year: 2080 Final TU

1. Asymptotic Analysis Definition Asymptotic analysis is a method used to analyze the performance of an algorithm by measuring how its time or space complexity grows as the input size (n) becomes ver

Question 2

Explain big oh notation in brief. Find big oh of the following function: f(x) = 5x4 + 9x2 + 7x + 9.

Marks: 5

Year: 2081 Final TU

1. Definition of Big-O Notation Big-O notation (O) is an asymptotic notation used to describe the upper bound of the time or space complexity of an algorithm. It represents the worst-case performanc

Question 3

Why do we need asymptotic notation? Describe about Big O notation with its curve.

Marks: 5

Year: 2079 Final TU

1. Need for Asymptotic Notation Asymptotic notation is used to describe the performance of algorithms in terms of time and space complexity as input size increases. Why it is needed: - Ignores machi

Question 4

How do you find complexity of algorithms? Explain

Marks: 5

Year: 2078 Final TU

1. Definition of Complexity Algorithm complexity is a measure of the efficiency of an algorithm. It helps us understand: - Time Complexity: How much time an algorithm takes relative to input size n.

Question 5

What is dynamic memory allocation? Compare data structure with abstract data type.

Marks: 5

Year: 2077 Final TU

Definition Dynamic memory allocation is the process of allocating memory to a program at runtime instead of at compile time. It allows a program to request memory from the heap as needed, making effic