Scribd
Upload
96 views2 pages

DSA Assignment Guidelines Jan 2021

This document provides information about Assignment 1 for the Data Structures and Algorithms course in January 2021. It instructs students to submit their assignments by January 26th, 2021 at 11:59 PM IST using the assignment submission form link provided. It also includes two sample questions that will be part of the assignment and FAQs addressing how to submit assignments, where to find class links, who to ask for help with doubts, and how students can check if their assignment was successfully submitted.

Uploaded by

suryansh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
96 views2 pages

DSA Assignment Guidelines Jan 2021

This document provides information about Assignment 1 for the Data Structures and Algorithms course in January 2021. It instructs students to submit their assignments by January 26th, 2021 at 11:59 PM IST using the assignment submission form link provided. It also includes two sample questions that will be part of the assignment and FAQs addressing how to submit assignments, where to find class links, who to ask for help with doubts, and how students can check if their assignment was successfully submitted.

Uploaded by

suryansh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

​Data Structures and Algorithm | Jan 2021

Assignment 1 | 18th January 2021

For any doubts regarding the assignment, ask questions in the ​Data
Structures and Algorithms​ Group​ ​in the Community.
Submit Assignments by​ ​26th January 2021 11:59 PM

Assignment Submit Form: ​https://forms.gle/bJBQwoRVk4P8SR4T8

Submit assignments in Appropriate Dropdowns.

Question 1
What is the time, space complexity of following code:
int a = 0, b = 0;
for (i = 0; i < N; i++) {
a = a + 1;
}
for (j = 0; j < M; j++) {
b = b + j;
}

Question 2
What does it mean when we say that an algorithm X is asymptotically more efficient than Y?

a)X will be a better choice for all inputs


b)X will be a better choice for all inputs except possibly small inputs
c)X will be a better choice for all inputs except possibly large inputs
d)Y will be a better choice for small inputs
​Data Structures and Algorithm | Jan 2021
FAQs

Q. When do I submit the Assignments and how?


A. The assignments for the week should be submitted by 26th January 2021 i.e.Tuesday 11:59 PM
IST.
B. You need to submit the answers in Document Format

Q. Where do I get class links for the next session?


A. All sessions will be Live on our Youtube Channel. Subscribe to LetsUpgrade​ ​YouTube Channel​.
You'll also get an email with the link to the live session.
B. It will be also updated in the Community Group in the pinned post.

Q. I have some doubt, who do I ask?


A. Post your Queries on the community, someone will help you out.

Q. How can we know if my assignment is verified or not? And is it successfully


submitted or not?
A. You will receive a mail for your successful submission.

You might also like