INTERNAL ASSIGNMENT

SESSION SEPTEMBER 2022

PROGRAM BACHLER OF COMPUTER APPLICATIONS
(BCA)
SEMESTER II
COURSE CODE & NAME DCA1202 - Data Structure and Algorithm
CREDITS 4
NUMBER OF ASSIGNMENTS 02 & 30 Marks each
& MARKS

Note:
 There will be two sets of assignments for every course and all questions are compulsory in both sets.
 Average of both assignments’ marks scored will be considered as Internal Assessment Marks.
 Answers for 10 marks questions should be approximately of 400-500 words.

Q.No Assignment Set –1 Marks Total

Questions Marks
1 What are the characteristics and Building Blocks of an Algorithm? 10 10
And what are Control Mechanism and Control structures?
2. A) What are Binary trees? How many types of Binary trees are there, 5+5 10
discuss?
B) Discuss the linked storage representation of binary tree.
3. Explain the algorithms of Bubble sort and Merge sort. 10 10

Q.No Assignment Set – 2 Marks Total

Questions Marks
4 A) What is dynamic memory storage and how is link list stored in 5+5 10
memory? Write the algorithm for traversal of a singly link list.
B) What are the different types of link list. Write an algorithm to
create circular list.
5. Write the Algorithm to find the maximum and minimum items in a 10 10
set of n element. Also explain the working of the algorithm.
6. A) What is Stack? Discuss the Array implementation of a stack along 5+5 10
with push() and pop() algorithms.
B) What is Queue? Discuss the Array implementation of a queue
along with enqueue() and dequeue() algorithms.

Mail id: helpdesk@mujonline.edu.in

Phone: +91 79966 00444 (Toll Free)