CO 1.

Study and analyze the effects of data organization and

algorithms on program efficiency.
CO 2. Ability of design considerations for constructing
balanced trees and its applications.
CO 3. Analyze various sorting techniques and their performance.
CO 4. Applying Dictionary construction with skip lists, and hash
tables for effective data/Information management.
CO 5. Get an understanding of how heaps, files and buffers can
be created ,manipulated and Analyze its applications in
various data structures.
PO 1 PO 2 PO 3

PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO
10
PO
11
PO
12
CO 1
H H H H
CO 2
H M H
CO 3
M M M
CO 4
H M M
CO 5
M M M M
1. Can you able to design algorithm for best, average and worst cases analysis ( )
2. Applying the knowledge of different types of algorithms ( )
3. Studying importance of balanced trees for data organization ( )
4. Performance analysis of different sorting techniques ( )
5. Importance of dictionaries for effective information retrieval ( )
6. Importance of Hashing techniques for random retrieval of information. ( )
7. What is your understanding level of Skip Lists Organization. ( )
8. How you can apply Binary heaps for real world applications ( )
9. Can you implement memory capabilities of CPP Files w.r.t Heap storage ( )
Please Rate your opinion for the Course based on 5-point scale
(Excellent-5 Very Good -4 Good-3 Average-2 Poor-1)
S.No Reg.N
o
Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9
1
2
3
Total 504 508 483 459 470 475 478 464 478
Total no of students attempted:116
*Percentage
attainment
86.89 87.58 83.27 79.13 81.03 81.89 82.41 80.00 82.41
Academic Year:2013-14 Year/Semester: III/II



*Percentage attainment = [(Total marks for Q1)/ (no. of students*5)]*100