Presentation Topics
Course Class Given Date Due Date
Data Structures BSCS 3rd Semester (Fall 2024) 13-01-2025 20-01-2025
General Guidelines:
Each group will have 15 minutes to present, followed by 5 minutes for Q&A. Presentations
should begin with an introduction defining the data structure and its significance, followed
by a detailed explanation of key concepts using diagrams or visuals. Include a practical
implementation with a code snippet, demonstrating one key operation (e.g., insertion,
deletion, or search). Conclude by discussing real-world applications to showcase the
relevance of the topic.
Group No. Participant ID Participant Name Assigned Topic
Circular and Priority Queues
23018020050 HAMMAD ALI
Using Linked List
• Explain the structure and
23018020051 HUZAIFA JAYYAD operations of circular and priority
G1 queues.
23018020054 ABDULLAH • Use diagrams to illustrate the
enqueue and dequeue processes.
23018020083 MUHAMMAD ANAS • Include a short code example
showing linked list implementation.
23018020069 USWA ZUBAIR Binary Search and Ternary Trees
• Define the structure and operations
of binary search and ternary trees.
23018020070 MINAHIL SHOAIB
G2 • Compare their efficiency and use
ZAINAB FAROOQ cases.
23018020075 • Use visuals and examples to
CHAUDHARY
demonstrate search operations.
23018020088 NOOR FATIMA
AVL Tree
23018020055 MUHAMMAD HABIB
• Explain how AVL trees maintain
balance using rotations (LL, RR, LR,
23018020072 ZONIA TARIQ RL).
G3 • Show balance factor calculations
23018020080 MUHAMMAD HAMDAN and include an example insertion
process.
23018020089 SYEDA TASKEEN FATIMA • Use animations or diagrams to
visualize rotations.
23018020045 IRSA SATTAR Red-Black Tree
• Highlight the balancing rules and
23018020057 SAIRA BATOOL significance of red and black nodes.
G4 • Demonstrate an insertion process
23018020084 SHARINA KHAN with color changes and rotations.
• Include diagrams and code snippets
23018020021 ANFAL TAHIR to illustrate the key concepts.
G5 23018020049 RIMSHA Balanced Tree
• Discuss the general concept of
23018020073 SEERAT SHAKEEL height balancing and why it
improves efficiency.
• Compare balanced and unbalanced
trees with examples.
23018020064 ESHA KHANAM • Use flowcharts to explain
operations and show practical
applications.
B tree and B+ Tree
• Explain the structure, node
23018020074 MOHAMMAD ZAID splitting, and balancing
mechanisms of B-Trees and B+
Trees.
G6
• Highlight the differences between
the two, with a focus on sequential
23018020079 MASAB ULLAH KHAN access in B+ Trees.
• Use diagrams and code snippets to
show insertion or search processes.
Evaluation Criteria
• Clarity of Explanation (40%)
• Use of Visuals and Examples (30%)
• Engagement and Team Collaboration (20%)
• Time Management (10%)
