Semester : SEMESTER 1
Subject : Advanced Data Structures
Year : 2020
Term : DECEMBER
Branch : MCA
Scheme : 2020 Full Time
Course Code : 20 MCA 105
Page:2
17
18
20
001
What is B tree? Explain B tree operations.
Module 111
Describe Binomial heap with example
OR
Explain Fibonacci Heap operations with example.
Module IV
Explain the Prim’s algorithm with an example.
OR
Describe Dijikstra’s single source shortest paths algorithm with an example
Module V
Explain about Blockchain architecture in detail.
OR
What are the advantages and disadvantages of Blockchain?
க்க்க்க்
Page 2 of 2
(6)
(6)
(6)
(6)
(6)
(6)
(6)