Get IGNOU Help Books Delivered in Delhi NCR within 4-6 Hours! Through BORZO, Order Now for Exam Success, Call us on 9350849407. (T&C Apply)

IGNOU MCS-21 - Data and File Structures

Bought By: 8084

Rating: 3.8

#1 Best Selling IGNOU MCS-21 Help-Book & Study-Guide in IGNOU Marketplaces.

Get Good Marks in your BCA Computer Application Programme in the Term-End Exams even if you are busy in your job or profession.

We've sold over 44,312,662 Help Books and Delivered 54,477,310 Assignments Since 2002.
As our customers will tell you...yes, it really result-oriented.

IGNOU MCS-21 Code Details

  • University IGNOU (Indira Gandhi National Open University)
  • Title Data and File Structures
  • Language(s) English
  • Code MCS-21
  • Subject Computer Application
  • Degree(s) MCA, BCA
  • Course Core Courses (CC)

IGNOU MCS-21 English Topics Covered

Block 1 - Introduction to Algorithms and Data Structures

  • Unit 1 - Analysis of Algorithms
  • Unit 2 - Arrays
  • Unit 3 - Lists

Block 2 - Stacks, Queues and Trees

  • Unit 1 - Stacks
  • Unit 2 - Queues
  • Unit 3 - Trees

Block 3 - Graph Algorithms and Searching Techniques

  • Unit 1 - Advanced Trees
  • Unit 2 - Graphs
  • Unit 3 - Searching

Block 4 - File Structures and Advanced Data

  • Unit 1 - Sorting
  • Unit 2 - Advanced Data Structures
  • Unit 3 - File Structures
Buy MCS-21 Help Book

IGNOU MCS-21 (July 2023 - January 2024) Assignment Questions

Q1: Elaborate various asymptotic notations used 10 to evaluate the efficiency of the algorithm. Q2: Write a program that accepts two polynomials as input and displays the resultant polynomial after multiplication of input polynomials. Q3: Write a C programme to implement a doubly linked list. Also write functions to perform insertion and deletion operations in it. Q4: What is a Circular Queue? Write an algorithm to perform insertion and deletion operation in a Circular Queue Q5: Write a program in C for insertion sort. Write the step-by-step working of the insertion sort for the following set of data: 10, 25, 86, 1, 16, 95, 37, 56, 5, 15, 20, 4. Also count the number of swaps and comparison operations performed for it. Q6: Write a detailed note on file organization techniques. Q7: Create the binary tree for which the in-order and post order traversal are given as below: In-order: QUVTMPSYZXR Post-order: VUTQZYXSRPM Q8: Create a B tree of order-5 for the following keys, inserted in the sequence. 25, 5, 10, 2, 3 35, 45, 30, 50, 55, 60, 12, 18, 20, 1 Further, delete the keys 1, 2, 10, and 12. Show all the intermediate steps. Q9: Create AVL tree for the following keys inserted in the order: 5, 15, 3, 25, 10, 2, 35, 7, 45, 30, 12, 20, 14 Further, delete the keys 2, 5, 7, and 8. Show all the intermediate steps. Q10: Solve the following instance of single source shortest paths problem with vertex 'a' as the source using suitable method.

IGNOU MCS-21 (July 2022 - January 2023) Assignment Questions

Q1. Write an algorithm that converts a Tree into a Binary Tree. Q2. Is it possible to implement multiple stacks in a Queue. Justify your answer. Q3. List the names of all SEARCH 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. Q4. Write an algorithm for creation of an AVL tree.
Buy MCS-21 Assignment

Related Codes