Course Code MCS-021
Course Title Data and File Structures
Assignment Number MCA(3)/021/Assignment/2019-20
Maximum Marks 100
Weightage 25%
Last Dates for Submission 15th October 2019 (For July 2019 Session)
15th April 2020 (For January 2020 Session)

This assignment has four questions that carry 80 marks. Answer all the questions. Each question carries 20 marks. You may use illustrations and diagrams to enhance the explanations. Please go through the guidelines regarding assignments given in the Programme Guide. All the implementations should be in the C language.

Q1. Write an algorithm that accepts a Binary Tree as input and prints the number of leaf nodes to standard output.

Q2. Write an algorithm for the implementation of an AVL Tree.

Q3. Write a note of not more than 5 pages summarizing the latest research in the area of “Trees”. Refer to various journals and other online resources. Indicate them in your assignment.

Q4. Write an algorithm for the implementation of a Stack.

About Abhishek Pandey

My name is Abhishek Pandey, I am fond of writing the best content and apart from writing I am an SEO specialist as well. I have written many blogs and post so far that have ranked on the first page. I am a video editor as well and I have got three-channel on youtube. In nutshell, I am the allrounder of digital marketing and I want to flourish more and more.

Leave a Reply

Your email address will not be published. Required fields are marked *