GALGOTIAS COLLEGE OF ENGINEERING AND TECHNOLOGY

1, Knowledge Park-II, Greater Noida, U.P.

Odd Semester 2022-23

Subject: Data Structure Subject Code: BCS-301

Branch: CSE Semester: III

CO-1: Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in
memory, used by the algorithms and their common applications

Assignment-1

1. Define data structures. Describe about its need and types. Why do we need a
datatype?
2. Explain Asymptotic Notation with suitable example.
3. What do you mean by tradeoffs between iteration and recursion?
4. Given an array, arr [1:9, -4:1, 5:10] with a base value of 400 and the size of each
element is 2 Bytes in memory find the address of element arr[5][-1][8] with the
help of row-major order?
5. Define a sparse matrix. Suggest a space efficient representation for space
matrices.
6. What do you mean by tradeoffs between iteration and recursion?
7. Write a recursive program to find the sum of digits of the given number. Also,
calculate the time complexity
8. Write a C program to add two polynomials using a linked list.
9. Write a C Program to insert and delete a node after a given node in the
singly linked list.
10.Explain the following
a) Abstract Data type (ADT)
b) Difference Between Link List and Array
c) Time and Space Complexity
d) Algorithm and its characteristics