Reference

SNo Questions to Course

Outcome
1 How many types of Data Structures are there. Briefly describe each of them. CO1

2 How you can differentiate best time, worst time and average time of an algorithm. CO1

3 Explain the various operations which can be applied in different Data Structures. CO1

4 Differentiate space and time complexity. CO1

Find the time complexity of following code:
5 for (int i=0 ; i<n; i++) CO1
cout<<i;
Find space complexity of the code
Algorithm sum (a,b,c,d)
6 { CO1
return a+b*c/d;
}

Oriental Institute Of Science & Technology, Bhopal

Department Of Computer Science & Engineering
Subject- Data Structure
Subject Code:CS-303
Semester: III
Assignment 1 (Jul-Dec 2023)