Data Structure and Algorithm
Data Structure and Algorithm
INTERNAL ASSIGNMENT
Learners are instructed to download the IA Question Paper, prepare the answers (Soft Copy), and
submit them through Learning Management System (LMS) Portal
The last IA assignment submission date (Set-1 & Set-2 in a single file) is reflected in LMS only.
This is the last date, and no further extension will be considered.
Assignment submissions are accepted only in .pdf format.
Assignments must be typed and formatted as per the following specifications:
o Page Margin – 1 inch on all sides
o Page Orientation – Portrait
o Page Size – A4
o Font Family - Times New Roman
o Font size - 12
o Alignment - Justified.
The total page limit shall not exceed 12 pages.
Answers for 10-mark questions should be approximately 400-500 words and not more than 200-
250 words for 5-mark questions.
The average of both assignments’ marks scored by the learner will be considered Internal Assessment
Marks.
Only ONE submission is allowed per assignment.
Please restrict the assignment document size to <2 MB. Avoid inserting images of very high resolution
into the document to remain within the size limit. The assignment response document should NOT
contain color images or highlighting of text content.
Upon successfully submitting IA in LMS, learners can verify the document submitted against each
course using the preview tab. If the file submitted has been corrupted or the wrong document
submitted, it will not be considered for evaluation.
If the learner resubmits the assignment, it is permissible only on or before the cut-off date, and the last
submission will be considered for evaluation purposes.
Content that has been directly copied from the Internet/SLM and Assignments that have been
copied and shared among students will be automatically rejected and disqualified.
SET-I
Q. No Questions Marks Total Marks
What are the characteristics and Building Blocks of an
1. Algorithm? And what are Control Mechanism and 10 10
Control structures?
A) What are Binary trees? How many types of
Binary trees are there, discuss?
2. 5+5 10
B) Discuss the linked storage representation of
binary tree.
Explain the algorithms of Bubble sort and Merge sort.
3. 5+5 10
SET-II
Q. No Questions Marks Total Marks
A) What is dynamic memory storage and how is link
list stored in memory? Write the algorithm for
4. traversal of a singly link list. 5+5 10
B) What are the different types of link list. Write an
algorithm to create circular list.
Write the Algorithm to find the maximum and minimum
5. items in a set of n element. Also explain the working of 10 10
the algorithm.
A) What is Stack? Discuss the Array implementation
of a stack along with push() and pop()
algorithms.
6. B) What is Queue? Discuss the Array 5+5 10
implementation of a queue along with enqueue()
and dequeue() algorithms.