1
Department of Computer Science and Engineering
United College of Engineering & Research, Prayagraj
Pin - 211010 (India)
Assignment Paper, Session 2025-26 [Odd]
Assignment No.: 1 Semester: III
Course Name: Data Structure
AKTU Course Code: BCS301
Last Date of Submission: 15/09/2025
Note: All questions are compulsory. Max. Marks: 20
Section-A
Ques. Short Answer Type Questions CO Bloom’s Marks
No. Level
1. Define the term Data Structure. List some linear and non-linear data 1
CO-1 L2
structures stating the application area where they will be used.
2. Define algorithm and its characteristics. Explain time and space 1
complexity of an algorithm. Also explain best- and worst-case CO-1 L2
analysis of an algorithm.
3. Explain why do we need a pointer to maintain a linked list structure. 1
CO-1 L1
Also list the advantages and disadvantages of array over linked list.
4. Rank the following typical bounds in increasing order of their growth 1
CO-1 L2
rate: O(log n), O(n4), O(1), O(n2 log n).
5. Define a sparse matrix. Suggest some space efficient representation 1
CO-1 L2
for space matrices.
Section-B
Ques. Long Answer Type Questions CO Bloom’s Marks
No. Level
Consider a multi-dimensional Array A[90][30][40] with base address
1. 2000. Calculate the address of A[20][20][20] in row major order and 3
CO-1 L3
column major order. Assume the first element is stored at A[2][2][2]
and each element take 2 bytes.
Write advantages and disadvantages of linked list over arrays. Write a
2. 'C' function to create a new linked list by selecting alternate elements 3
CO-1 L3
of a given linked list. Also write a C program to insert a node at kth
position in a singly linked list.
2
Discuss the representation of polynomial of single variable using
3. linked list. Write 'C' functions to add two such polynomials CO-1 L3 3
represented by linked list.
An array ARR[-5…15, 10…20] stores elements in Row Major Wise
4. with each element requiring 2 bytes of storage. Evaluate the address CO-1 L3 3
of ARR[10][15] when the base address is 2500.
Write a Pseudo code that will concatenate two linked lists. Function
5. should have two parameters, pointers to the beginning of the lists and CO-1 L3 3
the function should link second list at the end of the first list.
CO - Course Outcome
Bloom’s Level Wise Marks Distribution
L1- L2-
L3-Applying L4-Analyzing L5-Evaluating L6-Creating
Remembering Understanding
1 4 15 0 0 0
