MCS-021
1. Write an
algorithm for the implementation of a Tree. (20 Marks)
2. Implement
multiple stacks in a single dimensional array. Write algorithms for various
stack operations for them. (20 Marks)
3. Write
a note of not more than 5 pages summarizing the latest research in the area of
“Searching Techniques”. Refer to various journals and other online resources.
Indicate them in your assignment. (20
Marks)
4. What is a B-Tree? Write a
short note on its applications. (20 Marks)
*****************************************************************
Note: Answer with Dotcom Books
www.dotcombooks4u.com
(Last 5 year solved question
paper with Assignment solutions)
****************************************************************
No comments:
Post a Comment