ERODE SENGUNTHAR ENGINEERING COLLEGE
(An Autonomous Institution, Affiliated to Anna University)
PERUNDURAI, ERODE -638 057 AP CO2
I Year-M.E – COMPUTER SCIENCE AND ENGINEERING
(OR)
CONTINUOUS ASSESSMENT TEST- I 11.
23MCS12- ADVANCED DATA STRUCTURES AND
Credit: 3 R-2023
ALGORITHMS
Date:. SET – I Maximum marks: 50 AP CO2
ANSWER ALL THE
Time:9.40am to 11.10am Duration: 1Hr. 30 Min.
QUESTIONS
Qno Part- A(9 x 2 = 18 Marks) BL COs The following course outcomes are assessed: -
COURSE OUTCOMES MARKS
1. What is an Algorithms? RE CO1
2. Distinguish between Time and Space complexity of algorithms . UN CO1 Design data structures and algorithms to solve
CO1 50
3. Define Asymptotic analysis UN CO1
computing problems.
4. Expalin about average case analysis and worst case analysis. RE CO1 Choose and implement efficient data structures and
CO2 32
apply them to solve problems.
5. Write the Importance of efficient algorithms AP CO1
Bloom’s level Keyword Marks
6. Describe Asymptotic notation UN CO1
Prepared by Remembering RE 04
7. Outline the Recurrences AP CO1
8. Differentiate Substitution Method and Recursion-Tree Method UN CO1 Understanding UN 26
Ms. [Link] Approved by
9. Express the term Data structures and its types. UN CO1 AP/CSE Applying AP 52
Part- B (2 x 16 = 32 Marks)
Analyzing AN -
a) (i) Summarize an Algorithm and its technology. UN CO1 Scrutinized by
Evaluating EV - [Link]
(ii) Expalin about the Time and Space complexity of algorithms Head/CSE
AP CO1
Creating CR -
[Link]
(OR) AP/CSE 82(Including
10. TOTAL
Choices)
UN CO1
AP CO1
