COURSE INFORMATION SHEET
Course Name: ADVANCED DATA STRUCTURES Course Code: C223 AY: 2018-19
Course Category: Professional Core L-T-P-C 4-0-0-3
COURSE OUTCOMES (CO):
CO# CO STATEMENT TAXONOMY
C223.1 To Explain external sorting techniques Understand
C223.2 To Analyse the static and dynamic hashing techniques Analyse
C223.3 Creation of binary heap and binomial heap structures Create
C223.4 Creation of AVL trees and Red Black trees Create
C223.5 Design of M-way search trees-Trees and B+Trees Analyse
C223.6 Creation of Digital search trees Create
SYLLABUS:
UNIT DETAILS
I External Sorting, Introduction, K-way Merging - Buffer Handling for parallel Operation-
Run Generation- Optimal Merging of Runs.
II Introduction-Static Hashing- Hash Table- Hash Functions- Secure Hash Function- Overflow
Handling- Theoretical Evaluation of Overflow Techniques, Dynamic Hashing- Motivation
for Dynamic Hashing -Dynamic Hashing Using Directories- Directory less Dynamic,
Hashing,
III Model, Simple Implementation, Binary Heap-Structure Property-Heap-Order Property-
Basic Heap Operations- Other Heap Operation, Applications of Priority Queues- The
Selection Problem Event Simulation Problem, Binomial Queues- Binomial Queue Structure
– Binomial Queue Operation- Implementation of Binomial Queues
IV Optimal Binary Search Trees, AVL Trees, Red-Black Trees, Definition- Representation of a
Red- Black Tree- Searching a Red-Black Tree- Inserting into a Red Black Tree- Deletion
from a Red-Black Tree- Joining Red-Black Trees, Splitting a Red-Black tree.
V M-Way Search Trees, Definition and Properties- Searching an M-Way Search Tree, B-
Trees, Definition and Properties- Number of Elements in a B-tree- Insertion into B-Tree-
Deletion from a B-Tree- B+-Tree Definition- Searching a B+-Tree- Insertion into B+-tree-
Deletion from a B+-Tree.
VI Digital Search Trees, Definition- Search, Insert and Delete- Binary tries and
Patricia, Binary Tries, Compressed Binary Tries- Patricia, Multiway Tries-
Definitions- Searching a Trie- Sampling Strategies- Insertion into a Trie- Deletion
from a Trie- Keys with Different Length- Height of a Trie- Space Required and
Alternative Node Structure- Prefix Search and Applications- Compressed Tries-
Compressed Tries With Skip Fields- Compressed Tries With
Labeled Edges- Space Required by a Compressed Tries, Tries and Internet Packet
Forwarding ,- IP Routing- 1-Bit Tries- Fixed-Stride Tries-Variable-Stride Tries.
TEXT/REFERENCE/ADDITIONAL BOOKS:
T/ BOOK TITLE/AUTHORS/PUBLISHER
R
T1 Data Structures, a Pseudocode Approach, Richard F Gilberg, Behrouz A Forouzan,
Cengage.
T2 Fundamentals of DATA STRUCTURES in C: 2nd ed, , Horowitz , Sahani, Anderson- freed,
Universities Press
R1 File Structures :An Object oriented approach with C++, 3rd ed, Michel J Folk, Greg
Riccardi, Bill Zoellick
R2 C and Data Structures: A Snap Shot oriented Treatise with Live examples from Science
and Engineering, NB Venkateswarlu & EV Prasad, S Chand, 2010.
WEB REFERENCES: (Detailed Topic link)
W1 https://www.udemy.com/course/datastructurescncpp/
W2 https://www.oracle.com/technical-resources/articles/it-infrastructure/mixing-c-and-cplusplus.html
W3 https://www.geeksforgeeks.org/advanced-data-structures/
COs VS Program Outcomes (POs) mapping (HIGH: 3; MEDIUM: 2; LOW: 1)
CO# PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
C223.1 2 2 2 - - - - - - - - - 1
C223.2 2 2 2 - - - - - - - - - 2
C223.3 2 - 3 - - - - - - - - - 1
C223.4 - 2 2 - - - - - - - - - 2
C223.5 2 - 3 - - - - - - - - - 1
C223.6 1 - 2 - - - - - - - - - 1
C223* 1.8 2 2.33 1.33
* For Entire Course, PO & PSO Mapping
POs & PSOs:
PO Engineering Knowledge PO6 Engineer & Society PO11 Project Mgmt & Finance
1
PO Problem Analysis PO7 Environment & Sustainability PO12 Life-long Learning
2
PO Design / Development of Solutions PO8 Ethics PSO1 Advanced concepts of C+
3 +
PO Conduct Investigations of complex PO9 Individual & Team Work PSO2 ………………………….
4 problems
PO Modern Tool usage PO10 Communication Skills PSO3 …………………………..
5
Curricular Gaps identified - To attain COs, POs & PSOs:
S.No GAP DESCRIPTION CO# PO / PSO
1 Detailed explanation of internal sorting techniques C223.1 PO1/PSO1
2 Different operations of Binary search trees, heap creation C223.3 PO2/PSO1
TOPICS BEYOND SYLLABUS:
S.N Description CO# PO / PSO
o
1 Application of Binomial queues, priority queues C223.3 Po1,PO2, PSO1
2 Applications of AVL trees and RED BLACK trees C223.4 PO1,PSO1
3 Applications of Digital search trees C223.6 PO1
INSTRUCTIONAL METHODS / PEDAGOGICAL INITIATIVES:
SNO TEACHING METHODOLOGY
1 Power point presentation and use of internet to make teaching -learning more interactive and interesting
2 Virtual Video Lecture
3 Students are allotted topics to prepare power point presentations and class seminars are held
4 Feedback on lectures obtained from students
Web Link of the Course Material: www.byndr.in
COURSE OUTCOMES VS POs MAPPING WITH TOPIC BEYOND SYLLABUS:
CO# PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
C223.1 2 2 2 - - - - - - - - - 1
C223.2 2 2 2 - - - - - - - - - 2
C223.3 3 3 3 - - - - - - - - - 3
C223.4 2 2 2 - - - - - - - - - 2
C223.5 2 - 3 - - - - - - - - - 1
C223.6 3 - 2 - - - - - - - - - 1
C223* 2.33 2.25 2.33 1.66
ASSESSMENT METHODOLOGIES-DIRECT METHOD
Examination CO1 CO2 CO3 CO4 CO5 CO6 TL1 TL2 TL3 TL4 TL5 TL6
Internal exam 16.7% 16.7% 16.7% 16.7% 16.7% 16.7% ------ 16.67% -------- 33.34% ------ 50.01%
Assignments 16.7% 16.7% 16.7% 16.7% 16.7% 16.7% ------ 16.67% --------- 33.34% ------- 50.01%
End semester 16.7% 16.7% 16.7% 16,7% 16.7% 16.7% 16.67% 16.67% 16.67% ------- 50.501%
Taxonomy Levels: TL1: Remember; TL2: Understand; TL3: Apply; TL4: Analyse; TL5: Evaluate; TL6: create
CO ATTAINMENT
Direct Methods Weightage CO1 CO2 CO3 CO4 CO5 CO6 Overall
Internal examinations (Subjetive) 15 2 2 2 2 2 2 2
Internal examinations (Objective) 10 1 1 1 1 1 1 1
Assignments 05 3 3 3 3 3 3 3
End semester examination 70 3 3 3 3 3 3 3
Attainment-Direct method (a) 100% 2.65 2.65 2.65 2.65 2.65 2.65 2.65
Indirect Methods – 2.38
CO Feedback (b) 2.39 2.38 2.40 2.41 2.40 2.30
Overall Attainment (0.8a+0.2b) 2.592 2.596 2.6 2.602 2.6 2.58 2.595
Target Set for the course 2.142
Attainment Status Attained
Best performing CO: CO1,CO2,CO3,CO4,CO5 Least Performing CO: CO6
Reasons for low attainment First reason here
Second
Third
Plan of Action First corrective action
Second
Third
PO ATTAINMENT (Direct)
Course PO1 PO2 PO3 PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
Attainmen 4 5 6 7 8 9 0 1 2 1 2
t
2.595 2.59 2.59 2.59
- - - - - - - 2.595
5 5 5
Prepared by Approved by
B. Ganga Bhavani HOD
