Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 1

MARTHANDAM COLLEGE OF ENGINEERING AND

TECHNOLOGY
I Year-M.E. Degree
Assignment-1
I YEAR / I SEMESTER
Sub. Code: CP4151 Sub. Name : Advanced Datastructures &
Credit : 3 R-2021
Algorithms
Maximum marks:
Submission Date : ANSWER ALL THE QUESTIONS
40
Bloom’
Q. No Part- A ( 5 * 8 = 40 Marks) s COs
Level
1(a) Explain asymptotic notation and its types UN CO1
1(b) Fundamentals of analysis of algorithmic efficiency UN CO1
2(a) Implementation of heap and its operation UN CO2
2(b) Red Black Tree and its operations UN CO2
3(a) Topological sort algorithm with example UN CO3
The following course outcome are assessed:-
COURSE OUTCOME MARKS
CO1 To understand the usage of algorithms in computing 16
To learn and use hierarchical data structures and its operations 16
CO2
To learn the usage of graphs and its applications 8
CO3
Prepared by Bloom’s level Keyword Marks
Remembering RE 40 Approved by
R.J.Alice Nineta Understanding UN
AP/IT
Applying AP
Analyzing AN
Evaluating EV -
Creating CR - HOD/CSE
TOTAL 40
AP/CSE

ACD/10 Issue No: 1 &Date: 01.10.06 Rev. No: 1 & Date: 18.03.2017

You might also like