IGNOU MCS-021 Exam Most Questions Free For 2022-23 Session: If you were searching for the IGNOU MCS-021 Exam Most Questions free for 2022-23 Session then finally you are at right place as IGNOU MCS-021 Exam Most Questions for free 2022-23 is now available IGNOU MCS-021 Exam Most Questions PDF files from here.
 |
| ignou student zone |
IGNOU MCS-021 Exam Most Questions Free For 2022-23 Session
Students may easily mcs021 like know about their Assignment Topics by clicking on the official link of IGNOU. All-important links will be take links shared on the web Panel.
MCS-021 : DATA AND FILE STRUCTURES
IGNOU MCS-021 Exam Most Questions
(1.)Write an algorithm to sort "N" numbers using Bubble sort. Also, show that bubble
sort algorithm, on average, makes 0(N2) comparisions
while sorting a list of N
elements
(2.)Show step-by-step construction of a B-Tree (t=3) resulting from the insertion of the
following keys. A, S, T, M, U, K, j, B, G, N Also, show
deletion of Key 'U' and 'K' from
the B-Tree constructed above.
(3.)What is a height-balanced tree ? Construct an AVL so that tree for the following elements :
6, 3, 15, 24, 7, 89, 12, 34, 2 Show all the intermediate
steps.
(4.) What is a Dequeue ? Write an algorithm to insert and delete to the node in a Queue.
(5.) Write an algorithm to implement Heap using linked list. The algorithm should clearly perform
PUSH and POP list operation.
(6.)Write an algorithm to reverse the order of nodes in a doubly linked list with header node.
(7.) Differentiate between the Kraal's and prim's algorithm based on their principle,
operation and running time. Also know write any two
applications of minimum cost spanning
tree.
(8.)Differentiate between Indexed file organisation and Indexed sequential file organisation.
Also, write any four disadvantages of sequential file organization
(9)Consider the algorithm given below : 10
(i) scanf ("%d", &n);
(ii) {for (int i = n; < = n * n; i = n + 10)
(iii) (for (int j = 1; j <>= n; j++)
(iv) printf ("%d", n/i + j);}}
Calculate to the complexity (both space and time) of the
above code by using Big "0"
notation
(10.)Write an algorithm for Heapsort. Write step by step to the working of algorithm for the following set of data :
9, 16, 43, 27, 91, 33, 21, 7, 3,4
(11.)Write an algorithm for adding two polynomials.
Algorithm should take the two
polynomials as input and display the resultant
polynomial.
(12.)What is a BST ? Explain with an example. What are
its limitations
(13.)Find the order of the function 3n + 2.
(14.)Write the functions to perform Push and Pop operations of stack using pointers.
Using above functions, write an algorithm to convert a
given infix notation to its
equivalent postfix notation
(15.) Design algorithms for various operations performed on circularly linked list.
(16.) What are the advantages of using lists than arrays while implementing a stack ? Explain.
(17.) Write a procedure to find minimum cost spanning tree for a graph using Prim's
algorithm.
(18.) Explain the process of creating a Splay Tree using an example
How to Download IGNOU Solved Assignment?
2. Click on Assignments codes types /screen shoot .
3. Enter your right Subjects code.
4. Click on “sent ”.
5. select (all payments methods available)
6. Success your transaction than check your Whats app Automatically download
7. Download the Assignment.
IGNOU more assignments B.A/BDP/BAG/BCA/MCA/PGDCA/MBA ALSO AVILABLE
BELOW
IGNOU PROGRAMMES | SELECT | |
IGNOU All Solved Assignments | ||
IGNOU BCA Solved Assignments | ||
IGNOU MCA Solved Assignments | ||
IGNOU BAG/BDP/BA Solved Assignments | ||
IGNOU PGDCA | ||
IGNOU MBA | ||
| IGNOU Other Assignments | Click here |
IGNOU MCA/MCA New Handwriting pdf Available 2022-23
IGNOU SOLVED ASSIGNMENTS 2022-23
All ignou website this important links will be shared on the web Panel. This is the more Distance University and that is why students are needed to make their Assignments at their Home. If you are feeling any doubt, then students ask from us by below comment box
No comments:
Post a Comment