Assignment No: 1

Maximum marks for Assignment:25 Assignment Declaration Date:

Assignment Submission Date (on or before):
Assignment assessment declaration Date by faculty (on or before):
Level of mapping and
Ques Number Blooms
tion Question Statement CO PO PSO Marks
Level
NO

Describe Asymptotic notation- Big-O, Theta and Omega CO1 1,2,3,4, PSO1 2 5
Q1.
With example. 7,12 PSO2
Discuss Divide and Conquer strategy with suitable example. CO1 1,2,3,4, PSO1 2 5
Q2
Comment on its time complexity. 7,12 PSO2
Describe Algorithm design tools: Pseudo code and flowchart CO1 1,2,3,4,5,7 1,2 2 5
Q3 ,12

What is an Abstract Data Types (ADT) CO1 1,2,3,4,5,7 1,2 2 5

Q4 ,12

Define and explain following terms: 1)data 2)data structure CO1 1,2 PSO1 1 5
Q5 3) Algorithm 4) sequential organization 5) linear data PSO2
structure

Prof. Radhika V. Shinde

Subject In-charge
Assignment No: 2
Maximum marks for Assignment:25 Assignment Declaration Date:
Assignment Submission Date (on or before):
Assignment assessment declaration Date by faculty (on or before):
Level of mapping and Number
Question Blooms
Question Statement CO PO PSO Marks
NO Level

CO2 1,2,3,4,7,12 PSO1 2 5

PSO2
Q1. Explain Concept of
Ordered List and sparse
matrix.
WAP for sparse matrix CO2 1,2,3,4,7,12 PSO1 1 5
Q2 addition, transpose and PSO2
fast transpose
CO2 1,2,3,4,5,7,12 PSO1 2 5
Discuss representation PSO2
Q3 of single variable
polynomial expression
using array of structure
Explain Memory CO2 1,2,3,4,5,7,12 1,2 2 5
Representation and Address
Q4 Calculation of two
dimensional array.
WAP for Polynomial CO2 1,2,3,4,5,7,12 PSO1 2 5
Q5 addition PSO2

Prof. Radhika V. Shinde

Subject In-charge
Assignment No: 3
Maximum marks for Assignment:25 Assignment Declaration Date:
Assignment Submission Date (on or before):
Assignment assessment declaration Date by faculty (on or before):

Level of mapping and Number

Question Blooms
Question Statement CO PO PSO Marks
NO Level

Compare time complexity of all searching CO4 1,2,3,4,7,12 PSO1 3 5

Q1.
and sorting algorithm. PSO2
Sort following numbers using bubble, CO4 1,2,3,4,7,12 PSO1 3 5
selection and insertion sort. PSO2
Q2
23,45,32,33,2,17
Show allsteps. How many swaps and
comparisons are required for each method.

Exp sentinel ,Fibonacci search CO4 1,2,3,4,7,12 PSO1 2 5

Q3
PSO2
Explain merge sort using the following CO4 1,2,3,4,7,12 PSO1 2 5
Q4 example: 18,13,12,22,15,24,10,16,19,14,30. PSO2
Discuss its time and space complexity.
Apply quick sort on 39,9,81,45,90,27,72,18 CO4 1,2,3,4,7,12 PSO1 3 5
Q5 PSO2

Prof. Radhika V. Shinde

Subject In-charge
Assignment No: 4
Maximum marks for Assignment:25 Assignment Declaration Date: _
Assignment Submission Date (on or before):
Assignment assessment declaration Date by faculty (on or before):

Level of mapping and Number

Question
Question Statement CO PO PSO Blooms Level Marks
NO

Compare sequential CO5 1,2,3,4,7,12 PSO1 2 5

Q1. and linked PSO2
organizations
Write a program to CO5 1,2,3,4,5,7,12 PSO1 2 5
implement create, PSO2
Q2
delete, search, sort and
modify doubly link list
WAP to implement CO5 1,2,3,4,5,7,12 PSO1 2 5
Q3 Doubly circular PSO2
linkedlist.
Implement stack using CO5 1,2,3,4,7,12 PSO1 2 5
Q4
singly linked list. PSO2
Write pseudo c/c++ CO5 1,2,3,4,5,7,12 PSO1 2 5
code for polynomial PSO2
Q5
addition using singly
linked list.

Prof. Radhika V. Shinde

Subject In-charge
Assignment No: 5
Maximum marks for Assignment:25 Assignment Declaration Date:
Assignment Submission Date (on or before):
Assignment assessment declaration Date by faculty (on or before):

Level of mapping and Number

Question Blooms
Question Statement CO PO PSO Marks
NO Level

Q1. Implement stack as ADT using CO6 1,2,3,4,7,12 PSO1 2 5

array. PSO2
Explain multiple stack. CO6 1,2,3,4,7,12 PSO1 2 5
Q2
PSO2
Explain conversion from infix CO6 1,2,3,4,7,12 PSO1 2 5
Q3
to prefix and postfix PSO2
Evaluate the following postfix CO6 1,2,3,4,7,12 PSO1 2 5
Q4 expression PSO2
623+-382/+*2^
Evaluate the following postfix CO6 1,2,3,4,7,12 PSO1 2 5
expression PSO2
Q5
a. Ab*c+d-e+

Prof. Radhika V. Shinde

Subject In-charge
 Assignment No: 6_________
Maximum marks for Assignment:25
Assignment Submission Date (on or before):
Assignment assessment declaration Date by faculty on or before):

Level of mapping and

Number Blooms Mark
Question Statement
CO PO PSO Level s

Implement queue using array. CO6 1,2,3,4,7 PSO1 3 5

Q1
,12 PSO2
Pizza parlor accepting maximum M orders. Orders are CO6 1,2,3,4,7 PSO1 3 5
served in first come first served basis. Order once ,12 PSO2
Q2 placed cannot be cancelled. Write C++ program to
simulate the system using circular queue using array.

What are the application of simple queue and priority CO6 1,2,3,4,7 PSO1 3 5
Q3 queue? ,12 PSO2
Implement queue using linked list. CO6 1,2,3,4,7 PSO1 3 5
Q4
,12 PSO2
Consider the following queue of characters CO6 1,2,3,4,7 PSO1 3 5
,implemented as array of 6 memory location:- ,12 PSO2
Front =2, Rear=4
Queue: - _, A, D, _, _, _
Where ‘_’ denotes empty cell. Describe the queue
as the following operations take place
Q5
1. Add ‘S’,
2. Add ‘J’
3. Delete two letters
4. Shift toward left to bring all free
spaces to the right side.
5. Inset M, H, I and delete on letter.

Prof. Radhika V. Shinde

Subject In-charge