MCS-021 Solved Assignment 2021-22
MCS-021 Solved Assignment 2021-22
| Subject Name | Data and File Structures |
| Assignment Code | MCS-021 |
| Session | 2021-2022 (July – January) |
| File Type | |
| Number of Pages | 42 |
| Price | Rs. 45 |
To get the PDF click on the button below.
Pay Now
Note:
|
Data and File Structures (MCS-021) 2021-2022 (July-January)
Note : This assignment has four questions which 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 C programming language.
Question 1: (20 Marks)
Write an algorithm that accepts a Binary Tree as inputs and outputs the traversals of Inorder, Postorder and Preorder of it.
Question 2: (20 Marks)
Is it possible to implement multiple queues in a Stack. Justify your answer.
Question 3: (20 Marks)
List the names of all Sorting Algorithms along with their Complexities (Best case, Average case and Worst case). List as many names as possible along with their year of Invention and Inventor. Make necessary assumptions.
Question 4: (20 Marks)
Show the effect of making the following insertions into a Binary Search Tree which is already having one node consisting of 91 (value):
| 50 | 30 | 40 | 60 | 10 | 80 | 90 | 5 | 100 |
MCS-021 Solved Assignment 2021-22
IGNOU BCA 3rd Sem Solved Assignment 2021-22
IGNOU BCA 3rd Sem Assignment 2021-22 Question PDF Download