Mca 2 Sem Data Structures and File Handling Ca204 2019
Mca 2 Sem Data Structures and File Handling Ca204 2019
Mca 2 Sem Data Structures and File Handling Ca204 2019
SECTION A
SECTION B
SECTION C
3. Attempt any one part of the following: 10 x 1= 10
(a) Discuss solutions of the Tower of Hanoi problem where the numbers of disks
are 3 and numbers of pegs/rods are 3. Also write its algorithm.
(b) Write an algorithm for binary search and discuss its speed compared with linear
search.
CA204
http://www.aktuonline.com
Page 2 of 2
CA204
http://www.aktuonline.com