Scribd
Upload
12 views

Unit 1 Assignment (1)

Uploaded by

rcvikram2005
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

Unit 1 Assignment (1)

Uploaded by

rcvikram2005
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

School of Engineering & Technology

Department: CSE Session: 2024-2025


Programme: B.Tech CSE & AIML; B.Sc Semester: III
Course Code: ENCS205/ENBC201 Number of students: 64
Course Name: Data Structure Faculty: Rahul Singh

Assignment 1
Instructions:

 Assignment needs to be submitted by date


 Assignment must be submitted on (include moodle link)
 Use of ChatGPT and similar tools is strictly prohibited.
 Assignment must be written on dedicated assignment copy for data structures subject.
 All assignments must be prepared as per the format shared in classes
 Assignments need to be submitted by each individual.
 Total marks:10
 This assignment contributes to total 10% of internal evaluation
 Assignments will be evaluated on the basis of the following metrics.
 Originality:
 Correctness:
 Completeness:

COs Assignment Details Marks


CO2 XI. Explain the concept of time complexity. Why is it important in analyzing
algorithms?

XII. Determine the time complexity of the following code snippet:

XIII. Calculate the space complexity of a function that takes an array of size n as input
and creates a new array of the same size to store the result.

XIV. Implement a function in any programming language to reverse an array in place.


XV. Compare and contrast Big O, Big Omega, and Big Theta notations, providing
examples for each.

XVI. Analyze the time complexity of the following code snippet using Big O notation:

Faculty Signature: Approved by:

Date: Date:

You might also like